LeetCode

LeetCode 2328 note: strictly increasing means no cycles; dp[cell] = 1 + Σ dp[larger neighbors], processed from largest to smallest value (or by memoized DFS), summed over all cells

LeetCode 1377 note: undirected edges, seen must hold nodes, and an early arrival depends on whether the frog can still move

LeetCode 1292 note: 2D prefix sums plus binary search on the side length; never mix the two binary search styles

LeetCode 1178 note: a word only matters by its set of letters, so count 26-bit masks and enumerate each puzzle’s submasks

LeetCode 2585 note: a bounded (grouped) knapsack; each question type takes 0 to count questions, with capacity running backwards and the count enumerated inside

LeetCode 410 note: binary search the answer; for a cap mid, greedily fill each segment to count the fewest segments, and mid works if that count is <= k

LeetCode 4026 note: greedily match from the left for each worker’s earliest station and from the right for the latest; splitting between workers i and i+1, the largest gap is latest[i+1] - earliest[i]

LeetCode 1320 note: after typing word[i], one finger is always on word[i], so the state is only the other finger’s position; dp[other] is the least distance with the other finger at other

LeetCode 3895 note: convert each number to a string and add up how many times the digit appears

LeetCode note for Coin Change 2, rebuilt from the original learning note

LeetCode note for Target Sum, rebuilt from the original learning note

LeetCode note for Partition Equal Subset Sum, rebuilt from the original learning note