712. Minimum ASCII Delete Sum for Two Strings

Given two strings s1 and s2, return the lowest ASCII sum of deleted characters to make two strings equal.
/**
 * @param {string} s1
 * @param {string} s2
 * @return {number}
 */
var minimumDeleteSum = function(s1, s2) {
    const n = s1.length;
    const m = s2.length;

    // dp[i][j] = minimum ASCII delete sum to make s1[i:] and s2[j:] equal
    const dp = Array.from({ length: n + 1 }, () => Array(m + 1).fill(0));

    // Base case: if s1 is empty, delete all remaining chars in s2
    for (let j = m - 1; j >= 0; j--) {
        dp[n][j] = dp[n][j + 1] + s2.charCodeAt(j);
    }

    // Base case: if

how to create an slice in Go?

// []T{e1, e2, e3, ...}
// Where T is the type of the elements (e.g., int, string, bool, struct), 
// and e1, e2, e3, etc., are the initial elements of the slice
fruits := []string{"Apple", "Banana", "Orange"}

Docker Portainer

services:
  portainer:
    container_name: portainer
    image: portainer/portainer-ce:latest
    ports:
      - 9000:9443
      # - 8000:8000
    volumes:
      - /var/run/docker.sock:/var/run/docker.sock
      # - ./data:/data
    restart: always

Ignore Permission Changes After Copying a Git Repository (Linux)


## Ignore Permission Changes After Copying a Git Repository (Linux)

**Purpose**
Resolve false Git changes caused by permission differences (e.g., executable bit) after copying a repository between Linux machines.

---

### Check current setting

```bash
git config --get core.fileMode
```

---

### Disable permission tracking for this repository

```bash
git config core.fileMode false
```

---

### Reset working tree to remove permission-only changes

```bash
git checkout -- .
```

---

**Notes

865. Smallest Subtree with all the Deepest Nodes

Given the root of a binary tree, the depth of each node is the shortest distance to the root. Return the smallest subtree such that it contains all the deepest nodes in the original tree. A node is called the deepest if it has the largest depth possible among any node in the entire tree. The subtree of a node is a tree consisting of that node, plus the set of all descendants of that node.
/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {TreeNode}
 */
var subtreeWithAllDeepest = function(root) {
    // Helper DFS returns an object: { depth, node }
    // depth = max depth from this node downward
    // node = the subtree root that contains all dee

BAPI_GOODSMVT_CREATE 413 STOCK E

  METHOD move_batch.

    DATA: lt_return TYPE bapiret2_t.
    DATA: wt_zsd_trasf_log TYPE zsd_trasf_log.

    DATA: lv_index  TYPE sy-tabix.

    SELECT mblnr,
           mjahr,
           matnr,
           charg,
           werks,
           kdauf,
           kdpos,
           sjahr,
           smbln
      FROM mseg
      INTO TABLE @DATA(lt_mseg_413)
      WHERE bwart = @mc_trasf
        AND kdauf = @mv_salesdocument.

    SELECT mblnr,
           mjahr,
           matnr,
           charg,
  

how to compare arrays in go?

// In Go, arrays are value types, so they can be compared directly if their elements are comparable.

a := [3]int{1, 2, 3}
b := [3]int{1, 2, 3}
c := [3]int{3, 2, 1}

fmt.Println(a == b) // true
fmt.Println(a == c) // false

Fresh CC Fullz Bank Logs Paypal Transfer WU Transfer Bug MoneyGram CashApp Zelle Venmo Apple Pay Skrill Transfer ATM Cards.


_______ JEANSON ANCHETA_______

💻💸 Fresh Logs Pricing 💸💻
🔐 UK Logs / Clean Bank Drops (GBP)
💰 10K GBP = $250
💰 12K GBP = $300
💰 16K GBP = $350
💰 20K GBP = $500
💰 30K GBP = $800

🛡️ Verified • HQ Access • Fast Delivery
💬 DM for escrow or direct 🔥
WESTERN UNION / MONEY GRAM/BANKS LOGINS/BANK TRANFERS/PAYPAL TRANSFERS WORLDWIDE/CASHAPP/ZELLLE/APPLE PAY/SKRILL/VENMO TRANSFER
Telegram:@JeansonCarder     
Group: https://t.me/+2__ynBAtFP00M2Fk                 
Group: https://t.me/+CsF2t7HvV_ljMmU8


Y

Next.jsでSSG(もしくはISR)時にビルドエラーになる関数の存在

# Next.js App Routerで静的生成ページに動的パラメータを追加する際の注意点
 
## 状況
例えばSSGもしくはISRを使用しているページに、クエリパラメータに応じて表示内容を変える機能を追加する場合。
具体的には、一覧ページからの遷移時に ?from=/path/to/list のようなパラメータを付与し、そのパラメータを元にパンくずリストを動的に生成する要件。
 
## 失敗するアプローチ
Next.js App Router では、ページコンポーネントのsearchParams propsから直接クエリパラメータを取得できる。
このアプローチは開発モード(next dev)ではエラーなく動作する。静的生成は本番ビルド(next build)時に実行されるため、searchParams と静的生成設定の矛盾はビルド時に初めて DYNAMIC_SERVER_USAGE エラーとして検出される。
 
## 原因
searchParams は「動的レンダリングを引き起こす機能」に分類される。(https://nextjs.org/docs/app/guides/cach

1458. Max Dot Product of Two Subsequences

Given two arrays nums1 and nums2. Return the maximum dot product between non-empty subsequences of nums1 and nums2 with the same length. A subsequence of a array is a new array which is formed from the original array by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, [2,3,5] is a subsequence of [1,2,3,4,5] while [1,5,3] is not).
/**
 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number}
 */
var maxDotProduct = function(nums1, nums2) {
    const m = nums1.length;
    const n = nums2.length;

    // Create a DP table where:
    // dp[i][j] = max dot product using nums1[0..i-1] and nums2[0..j-1]
    //
    // We initialize everything to -Infinity because:
    // - We want to allow negative numbers.
    // - We want to ensure that taking no elements is never considered valid.
    const dp = Array.from({ l

Switch user in Linux (Ubuntu) e.g. edit file with ownership

sudo -u <user> bash

Search Substring

- Given 2 sheets: sheet 1 and sheet 2 
 - Sheet 1 contains column sku
 - Sheet 2 contains column compatibility (comma separated string which may contain
 the sku from sheet 1 column sku)
 - Result: Sheet 3, for every sku in sheet 1, find the compatible part in sheet 2
 return the part name, comma seperated

### Sheet 1
id | sku
---|---
1 | ABC

### Sheet 2
Part ID | Model Compatibilty
--|--
1039228 | "ABC, DEF"
AB9034-89 | "VDR, ABC"
HUDH90-0122 | "BDN, EDF"

### Sheet 3
sku | compatibilities
--

C1 U12

B
outing
unwind
idle
avid
pastime
gym bunny
hiking
couch potato

Questions:
blow the cobwebs away - clean your mind 
pound the pavements - 
know your audience
set up boundaries
daily grind

how to iterate an array in Go?

fruits := [4]string{"Apple", "Banana", "Orange", "Grapes"}

for index, fruit := range fruits {
    fmt.Println(position, fruitName)
}

for i, v := range fruits {
    fmt.Println(i, v)
}

for position, fruitName := range fruits {
    fmt.Println(position, fruitName)
}

Hide extra product option woocommerce single product page

div#tm-extra-product-options {
    display: none;
}

.tm-totals-form-main.tc-show {
    display: none;
}

xpra

Xpra 

If anyone is facing issues restarting their Xpra server after yesterday’s reboot, please try the following steps:
xpra list – to check whether there is an existing (possibly expired) session
xpra stop – to stop any existing session, if found
. start_xpra – to start the Xpra server again
Please feel free to reach out if you have any questions or need assistance.