Dynamic-Programming

LeetCode 312 note: choose the last balloon k burst in the range (i, j); at that moment its neighbors are i and j, and the two sides are independent subproblems

LeetCode 3660 note: cutting between i and i+1, if the left max exceeds the right min the two sides reach each other and share the answer; otherwise the left answer is the left max

LeetCode 3952 note: each token moves left at most once, so the state is whether this index’s token moved left; moving only helps if the index to the left was not already covered

LeetCode note for Domino and Tromino Tiling, rebuilt from the original learning note

LeetCode note for Paint Fence, rebuilt from the original learning note

LeetCode note for Minimum Swaps To Make Sequences Increasing, rebuilt from the original learning note

LeetCode note for Wiggle Subsequence, rebuilt from the original learning note

LeetCode note for Best Time to Buy and Sell Stock with Transaction Fee, rebuilt from the original learning note

LeetCode note for Best Time to Buy and Sell Stock with Cooldown, rebuilt from the original learning note

LeetCode note for House Robber, rebuilt from the original learning note

LeetCode note for Best Time to Buy and Sell Stock IV, rebuilt from the original learning note

LeetCode note for Best Time to Buy and Sell Stock III, rebuilt from the original learning note