Dynamic Programming
- 🟨 53. Maximum Subarray [Solution]
- 🟨 62. Unique Paths [Solution]
- 🟨 63. Unique Paths II [Solution]
- 🟨 64. Minimum Path Sum [Solution]
- 🟩 70. Climbing Stairs [Solution]
- 🟥 72. Edit Distance [Solution]
- 🟥 85. Maximal Rectangle
- 🟨 91. Decode Ways [Solution]
- 🟨 97. Interleaving String
- 🟨 120. Triangle [Solution]
- 🟩 121. Best Time to Buy and Sell Stock [Solution]
- 🟨 122. Best Time to Buy and Sell Stock II [Solution]
- 🟥 123. Best Time to Buy and Sell Stock III [Solution]
- 🟨 152. Maximum Product Subarray [Solution]
- 🟥 188. Best Time to Buy and Sell Stock IV [Solution]
- 🟨 198. House Robber [Solution]
- 🟨 213. House Robber II [Solution]
- 🟨 221. Maximal Square [Solution]
- 🟨 279. Perfect Squares [Solution]
- 🟨 300. Longest Increasing Subsequence [Solution]
- 🟨 309. Best Time to Buy and Sell Stock with Cooldown
- 🟨 322. Coin Change [Solution]
- 🟨 416. Partition Equal Subset Sum
- 🟨 474. Ones and Zeroes [Solution]
- 🟨 494. Target Sum [Solution]
- 🟩 509. Fibonacci Number [Solution]
- 🟨 516. Longest Palindromic Subsequence
- 🟨 518. Coin Change II
- 🟨 583. Delete Operation for Two Strings
- 🟨 647. Palindromic Substrings
- 🟨 650. 2 Keys Keyboard [Solution]
- 🟨 651. 4 Keys Keyboard
- 🟨 712. Minimum ASCII Delete Sum for Two Strings
- 🟨 714. Best Time to Buy and Sell Stock with Transaction Fee
- 🟩 746. Min Cost Climbing Stairs [Solution]
- 🟨 918. Maximum Sum Circular Subarray [Solution]
- 🟨 931. Minimum Falling Path Sum [Solution]
- 🟨 983. Minimum Cost For Tickets [Solution]
- 🟥 1092. Shortest Common Supersequence
- 🟧 1143. Longest Common Subsequence [Solution]