Dynamic-Programming

LeetCode 4041 note: with operations in any order, BFS finds every value a number can become (up to sum) with the fewest steps, then the same grouped 0/1 knapsack as 4040

LeetCode 4040 note: with multiplications before divisions, the best is always multiply-only or divide-only; list each number’s reachable values and costs, then run a grouped 0/1 knapsack

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 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 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 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

LeetCode note for Number of Dice Rolls With Target Sum, rebuilt from the original learning note

LeetCode note for Profitable Schemes, rebuilt from the original learning note

LeetCode note for Ones and Zeroes, rebuilt from the original learning note