Dynamic Programming
25 problems — 4 easy, 18 medium, 3 hard.
| # | Title | Difficulty | Frequency |
|---|---|---|---|
| 62 | Unique Paths | medium | foundational |
| 70 | Climbing Stairs | easy | foundational |
| 72 | Edit Distance | medium | frequently asked |
| 91 | Decode Ways | medium | frequently asked |
| 96 | Unique Binary Search Trees | medium | frequently asked |
| 118 | Pascal's Triangle | easy | foundational |
| 120 | Triangle | medium | frequently asked |
| 122 | Best Time to Buy and Sell Stock II | medium | frequently asked |
| 139 | Word Break | medium | frequently asked |
| 152 | Maximum Product Subarray | medium | frequently asked |
| 198 | House Robber | medium | frequently asked |
| 300 | Longest Increasing Subsequence | medium | frequently asked |
| 322 | Coin Change | medium | frequently asked |
| 392 | Is Subsequence | easy | foundational |
| 403 | Frog Jump | hard | occasional |
| 583 | Delete Operation for Two Strings | medium | frequently asked |
| 650 | 2 Keys Keyboard | medium | occasional |
| 698 | Partition to K Equal Sum Subsets | medium | frequently asked |
| 712 | Minimum ASCII Delete Sum for Two Strings | medium | occasional |
| 718 | Maximum Length of Repeated Subarray | medium | frequently asked |
| 1025 | Divisor Game | easy | foundational |
| 1143 | Longest Common Subsequence | medium | frequently asked |
| 1277 | Count Square Submatrices with All Ones | medium | frequently asked |
| 1335 | Minimum Difficulty of a Job Schedule | hard | occasional |
| 1547 | Minimum Cost to Cut a Stick | hard | occasional |