Dynamic-Programming

LeetCode note for Form Largest Integer With Digits That Add Up To Target, rebuilt from the original learning note

LeetCode note for Last Stone Weight II, rebuilt from the original learning note

LeetCode 1235 note: sort jobs by end time with best[j] = best profit using the first j jobs; taking job j binary-searches the last job ending <= its start

LeetCode 2912 note: many cells, but only four classes relative to the destination (itself, same row, same column, neither); each class’s total moves together in O(k)

LeetCode 902 note: digit DP with state (pos, tight, started); before starting, a position can be skipped, representing numbers with fewer digits than n

LeetCode 2355 note: ending at i, each shelf to the left takes one fewer book until a bottleneck shelf j with too few books; a monotonic stack finds j, and dp[i] = dp[j] + an arithmetic series

LeetCode note for Shortest Common Supersequence, rebuilt from the original learning note

LeetCode note for Minimum ASCII Delete Sum for Two Strings, rebuilt from the original learning note

LeetCode note for Minimum Insertion Steps to Make a String Palindrome, rebuilt from the original learning note

LeetCode note for Delete Operation for Two Strings, rebuilt from the original learning note

LeetCode note for Distinct Subsequences, rebuilt from the original learning note

LeetCode note for Interleaving String, rebuilt from the original learning note