Dynamic-Programming

LeetCode 1526 note: scanning left to right, every rise above the previous height needs that many new operations; drops reuse earlier operations

LeetCode note for Count Square Submatrices With All Ones, rebuilt from the original learning note

LeetCode 1335 note: partition DP into d segments; dp(i, k) = the least difficulty starting at job i with k days left, enumerating where today ends while updating today’s maximum

LeetCode 1147 note: build strings inward from both ends and cut a pair as soon as they match; cutting early is best, and any leftover middle counts as one chunk

LeetCode note for Maximal Square, rebuilt from the original learning note

LeetCode note for Dungeon Game, rebuilt from the original learning note

LeetCode note for Minimum Path Sum, rebuilt from the original learning note

LeetCode note for Unique Paths II, rebuilt from the original learning note

LeetCode note for Unique Paths, rebuilt from the original learning note

LeetCode 1745 note: build is_pal[i][j] with interval DP, then try both cut points; three palindromic parts means true, O(n^2)

LeetCode note for Triangle, rebuilt from the original learning note

LeetCode 3651 note: compute layer by layer over teleports; arriving at a cell by teleport costs the previous layer’s minimum over cells with value >= it, found with a running minimum after sorting, followed by the usual right / down grid DP