Cacher is the code snippet organizer for pro developers

請只審查 `sha_old..sha_new` 範圍內的變更，不要修改任何檔案。

請以以下 Git 範圍為審查依據：

```bash
git log --oneline sha_old..sha_new
git diff --stat sha_old..sha_new
git diff sha_old..sha_new
```

審查範圍只限於 `sha_old` 之後到 `sha_new` 為止的變更。

可以閱讀其他未變更檔案作為上下文，但不要把原本就存在的舊問題列為本次問題，除非該問題是由 `sha_old..sha_new` 範圍內的變更引入、擴大或暴露。

本專案是 Flutter 專案，請特別審查：

* Widget lifecycle，例如 `initState`、`dispose`、Controller / Listener / Worker 是否釋放
* GetX 狀態管理是否有狀態殘留、重複刷新、Controller 過肥問題
* async / await 是否有 race condition、重複請求、頁面離開後仍更新狀

/**
 * @param {number} n
 * @param {number[]} nums
 * @param {number} maxDiff
 * @param {number[][]} queries
 * @return {boolean[]}
 */
var pathExistenceQueries = function(n, nums, maxDiff, queries) {
    const comp = new Array(n).fill(0);

    // Build connected components
    for (let i = 1; i < n; i++) {
        if (nums[i] - nums[i - 1] <= maxDiff) {
            comp[i] = comp[i - 1];
        } else {
            comp[i] = comp[i - 1] + 1;
        }
    }

    // Answer queries
    const ans

/**
 * @param {string} s
 * @param {number[][]} queries
 * @return {number[]}
 */
var sumAndMultiply = function(s, queries) {
    const MOD = 1000000007;
    const MODB = BigInt(MOD);

    // Safe modular multiplication using BigInt
    const mulmod = (a, b) => Number((BigInt(a) * BigInt(b)) % MODB);

    // ------------------------------------------------------------
    // STEP 1: Extract all NON-ZERO digits and their original positions
    // --------------------------------------------------

/**
 * @param {number} n
 * @return {number}
 */
var sumAndMultiply = function(n) {
    // Step 1: build x by concatenating non-zero digits
    let s = String(n);
    let filtered = "";
    for (let ch of s) {
        if (ch !== '0') filtered += ch;
    }

    let x = filtered.length === 0 ? 0 : Number(filtered);

    // Step 2: compute digit sum of x
    let sum = 0;
    while (x > 0) {
        sum += x % 10;
        x = Math.floor(x / 10);
    }

    // Step 3: multiply original x by sum
    r

/**
 * @param {number[][]} intervals
 * @return {number}
 */
var removeCoveredIntervals = function(intervals) {
    // Step 1: Sort intervals by:
    //   - start ascending
    //   - if starts are equal, end descending
    //
    // This ensures that any interval that *could* cover another
    // appears before the interval it might cover.
    intervals.sort((a, b) => {
        if (a[0] === b[0]) {
            // For same start, put the longer interval first
            return b[1] - a[1];
    

/**
 * @param {string[]} board
 * @return {number[]}
 */
var pathsWithMaxScore = function(board) {
    const n = board.length;
    const MOD = 1e9 + 7;

    // dpScore[i][j] = max score to reach (i,j)
    // dpCount[i][j] = number of ways to achieve that score
    const dpScore = Array.from({ length: n }, () => Array(n).fill(-Infinity));
    const dpCount = Array.from({ length: n }, () => Array(n).fill(0));

    // Start at S (bottom-right)
    dpScore[n-1][n-1] = 0;
    dpCount[n-1][n-1] = 1;

/**
 * @param {number} n
 * @param {number[][]} roads
 * @return {number}
 */
var minScore = function(n, roads) {
    const graph = Array.from({ length: n + 1 }, () => []);
    for (const [a, b, w] of roads) {
        graph[a].push([b, w]);
        graph[b].push([a, w]);
    }

    const seen = new Array(n + 1).fill(false);
    const stack = [1];
    seen[1] = true;

    // Find all nodes reachable from 1
    while (stack.length) {
        const node = stack.pop();
        for (const [nei] of gr

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

/**
 * @param {number[][]} edges
 * @param {boolean[]} online
 * @param {number} k
 * @return {number}
 */
var findMaxPathScore = function(edges, online, k) {
    const n = online.length;

    // Build adjacency list only for edges whose endpoints are online
    const adj = Array.from({ length: n }, () => []);
    let maxEdgeCost = 0;

    for (const [u, v, cost] of edges) {
        if (online[u] && online[v]) {
            adj[u].push([v, cost]);
            if (cost > maxEdgeCost) maxEdgeCost 

dig +short A sub.domain.end

/**
 * @param {number[][]} grid
 * @param {number} health
 * @return {boolean}
 */
var findSafeWalk = function (grid, health) {
  const m = grid.length;
  const n = grid[0].length;

  // dist[i][j] = minimum health lost to reach cell (i, j)
  const dist = Array.from({ length: m }, () => Array(n).fill(Infinity));

  // Starting cell: if it's unsafe (1), you lose 1 health immediately
  dist[0][0] = grid[0][0];

  // Directions for moving up, down, left, right
  const dirs = [
    [1, 0],
    [-1, 

<mvt:comment> 1. Build a discount state from the current basket </mvt:comment>
<mvt:do file="g.Module_Feature_PGR_UT" name="l.ok"
        value="DiscountState_CreateFromBasket( g.Basket, l.discount_state )" />
<mvt:do file="g.Module_Feature_PGR_UT" name="l.ok"
        value="DiscountState_Load_PriceGroups_Basket( g.Basket, l.discount_state )" />

<mvt:comment> 2. Predict the price for this product + subscription term
     args: discount_state, product, subterm_id, variant_id, quantity,
         

<mvt:assign name="l.cache_key"			value="tolower( slugify( g.Domain:name ) ) $ '-' $ tolower( slugify( g.Store:branch:name ) ) $ '-global_mega_menu'" />
<mvt:assign name="l.global_mega_menu"	value="''" />
<mvt:assign name="l.redis_connected"	value="0" />
<mvt:assign name="l.expiration"			value="2 * 60 * 60" />
<mvt:if expr="g.Store:cache_type EQ 'redis'">
	<mvt:do file="g.Module_Library_Crypto" name="l.redispwd" value="Decrypt_Payment_Password( g.Store:redispwd )" />
	<mvt:do file="g.Module

Out of the box Ubuntu doesn't use a root password unless you set one yourself. Here's how to recover:

When you see the grub screen, hit 'e' to edit kernel arguments.

Find the line that starts with 'linux' and at the end of that line, add init=/bin/bash.

Hit F10 or ESC to boot the machine. You're now in single user mode but filesystems are mounted read-only. We'll fix that like this: mount -no remount,rw /

Next, change the root password using passwd root.

Last, reboot the machine and you sho

select {o:code} as 'Eazle Order Number', {o:bcordernumber} as 'BC Order Number', {o:sapordernumber} as 'SAP Order number', {os:code} as 'Status', {bu:companycode} as 'Company Code', {bu:uid} as 'SoldTo', {o:originalordercode} as 'Amended Order', convert(date,{o:creationtime}) as 'Order Creation date', convert(time,{o:creationtime}) as 'Order Creation time'
from {order as o join b2bunit as bu on {bu:pk} = {o:unit} join orderstatus as os on {os:pk} = {o:status}}
where {o:creationtime} >= '2026-05-