### 英文を中央寄せ時、改行位置をいい感じにする

``````.hoge {
text-align: center;
text-wrap: balance;
}``````

### 記述力に併せてフォーム入力欄を自動的に拡張

``````.hoge {
field-sizing: content
}``````

### buttonタグのスタイルを一括リセット

``````button {
all: unset;
}``````

### スクロールバーの切り替わりによる画面のガタツキを防ぐ

``````.box {
scrollbar-gutter: stable both-edges;
}``````

### 502. IPO

Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increase its capital before the IPO. Since it has limited resources, it can only finish at most k distinct projects before the IPO. Help LeetCode design the best way to maximize its total capital after finishing at most k distinct projects. You are given n projects where the ith project has a pure profit profits[i] and a minimum capital of capital[i] is needed to start it. Initially, you have w capital. When you finish a project, you will obtain its pure profit and the profit will be added to your total capital. Pick a list of at most k distinct projects from given projects to maximize your final capital, and return the final maximized capital. The answer is guaranteed to fit in a 32-bit signed integer.
``````/**
* @param {number} k
* @param {number} w
* @param {number[]} profits
* @param {number[]} capital
* @return {number}
*/
var findMaximizedCapital = function(k, w, profits, capital) {
// Create a new array to hold the pair [capital, profit] for each project
let projects = new Array(profits.length);
for (let i = 0; i < profits.length; i++) {
projects[i] = [capital[i], profits[i]];
}

// Sort the projects array in ascending order of capital
projects.sort((a, b``````

### Dart basic by Bg Sahibul

``````void main() {
int score = 60;
double asd = 100.5;
String name = "Flutter";

var score2 = 10; // var nilainya bisa diubah pas mau ditambah nilainya nanti
final score3 =
10; // final nilainya tidak bisa diubah pas mau ditambah nilainya nanti

const a = "dart"; // const harus di set nilainya
final b; // final tidak harus di set nilainya

//   print("I'am" + name + " ready to learn dart = " + isReadyLearningDart.toString()); // bool``````

### Useful Flutter Commands

``````import 'package:flutter/material.dart';

==== Void main 1 ====

void main() => runApp(const MyApp());

==== Void main 2 ====

void main() {
runApp(const MyApp());
}``````

### linux 瘦身

``````##
## journal 日志大小限制
- 编辑`/etc/systemd/journald.conf`添加
```conf
SystemMaxUse=10M   # 硬盘中只保留最近 10M 的日志
RuntimeMaxUse=10M  # 内存中只保留最近 10M 的日志
```
- 重启服务`sudo systemctl restart systemd-journald```````

### Adding predefined field set fields to an experiment overview entry

``````package com.velox.temp.plugin.actionmenu;

import com.velox.api.datafielddefinition.EnbFieldSet;
import com.velox.api.datatype.DataTypeDefinition;
import com.velox.api.datatype.datatypelayout.DataFormComponent;
import com.velox.api.datatype.datatypelayout.DataTypeTabDefinition;
import com.velox.api.datatype.fielddefinition.FieldDefinitionPosition;
import com.velox.api.datatype.fielddefinition.VeloxFieldDefinition;
import com.velox.api.eln.notebookexperiment.TemplateExperiment;
import co``````

### CSSでボックス内画像のスクロールパララックス

``````<ul class="list">
<li class="item">
<img src="assets/images/1.jpg" class="image" />
</li>
<li class="item">
<img src="assets/images/1.jpg" class="image" />
</li>
<li class="item">
<img src="assets/images/1.jpg" class="image" />
</li>
<li class="item">
<img src="assets/images/1.jpg" class="image" />
</li>
<li class="item">
<img src="assets/images/1.jpg" class="image" />
</li>
<li class="item">
<img src="assets/images/1.jpg" class="image" />
</li>
``````

### 945. Minimum Increment to Make Array Unique

You are given an integer array nums. In one move, you can pick an index i where 0 <= i < nums.length and increment nums[i] by 1. Return the minimum number of moves to make every value in nums unique. The test cases are generated so that the answer fits in a 32-bit integer.
``````/**
* @param {number[]} nums
* @return {number}
*/
var minIncrementForUnique = function(nums) {
// Sort the array in ascending order
nums.sort((a, b) => a - b);

// Initialize moves to 0
let moves = 0;

// Iterate over the array, starting from the second element
for (let i = 1; i < nums.length; i++) {
// If the current element is less than or equal to the previous one
if (nums[i] <= nums[i - 1]) {
// Calculate the difference
let ``````

### DNS records for new site

``````// Main domain
Name: @
Type: A

// www Domain
Name: www
Type: CNAME
Value: example.com

``````

### grid内の要素の高さが、最も高い要素の高さで統一されてしまう場合

``````<div class="container">
<div class="item1">1</div>
<div class="item2">2</div>
<div class="item3">3</div>
<div class="item4">4</div>
</div>``````

``````All S3_path in txt:

call set /p DUMMY=Hit ENTER to continue..

2-  ersetzen:    ^             =>>      call aws s3 cp s3://

call set /p DUMMY=Hit ENTER to continue..``````

### textareaの高さを入力された文字の行数に合わせて伸縮させる

``<textarea class="textarea"></textarea>``

### Create an empty branch/commit in Git

``````# Create an empty branch with an empty initial commit in Git

## The challenge

Before Git version v2.27, there was no regular way to create an empty branch in a repository that already had commits.

Well, unless you knew the big secrets of Git:
- http://colinschimmelfing.com/blog/gits-empty-tree/