LeetCode

LeetCode 3984 note: replacing a composite k by one of its prime factors only helps (more values divisible, smaller k), so try every prime factor of the numbers plus 2, running Kadane once per candidate

LeetCode note for Out of Boundary Paths, rebuilt from the original learning note

LeetCode 1411 note: a row’s colorings come in two patterns, ABA (ends match) and ABC (all different), 6 each; the next row gives ABA → 3 ABA + 2 ABC and ABC → 2 ABA + 2 ABC

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

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

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