Dynamic Programming
- 0022 - Generate Parentheses
- 0042 - Trapping Rain Water
- 0045 - Jump Game II
- 0053 - Maximum Subarray
- 0055 - Jump Game
- 0070 - Climbing Stairs
- 0072 - Edit Distance
- 0096 - Unique Binary Search Trees
- 0118 - Pascal's Triangle
- 0121 - Best Time to Buy and Sell Stock
- 0122 - Best Time to Buy and Sell Stock II
- 0123 - Best Time to Buy and Sell Stock III
- 0188 - Best Time to Buy and Sell Stock IV
- 0309 - Best Time to Buy and Sell Stock with Cooldown
- 0396 - Rotate Function
- 0740 - Delete and Earn
- 0877 - Stone Game
- 0907 - Sum of Subarray Minimums
- 1262 - Greatest Sum Divisible by Three
- 1526 - Minimum Number of Increments on Subarrays to Form a Target Array
- 1578 - Minimum Time to Make Rope Colorful
- 2380 - Time Needed to Rearrange a Binary String
- 2826 - Sorting Three Groups
- 3147 - Taking Maximum Energy From the Mystic Dungeon
- 3693 - Climbing Stairs II
- 3840 - House Robber V