HackMD
Dynamic Programming Study Guide
Basic DP Problems
Fundamental problems that introduce the concept of dynamic programming.
- 🟩 70. Climbing Stairs [Solution]
- 🟩 509. Fibonacci Number [Solution]
- 🟩 746. Min Cost Climbing Stairs [Solution]
Matrix Path Problems
Problems involving finding optimal paths through a matrix.
- 🟨 64. Minimum Path Sum [Solution]
- 🟨 120. Triangle [Solution]
- 🟨 931. Minimum Falling Path Sum [Solution]
Counting Paths in a 2D Array
Problems that involve counting the number of possible paths.
Substring and Subsequence Problems
Problems involving finding or manipulating substrings and subsequences.
- 🟨 516. Longest Palindromic Subsequence [Solution]
- 🟨 647. Palindromic Substrings [Solution]
- 🟧 1143. Longest Common Subsequence [Solution]
Knapsack Problems
A class of problems involving optimizing a selection of items under constraints.
- 🟨 279. Perfect Squares [Solution]
- 🟨 322. Coin Change [Solution]
- 🟨 416. Partition Equal Subset Sum
- 🟨 474. Ones and Zeroes [Solution]
- 🟨 494. Target Sum [Solution]
- 🟨 518. Coin Change II
String Matching and Decoding
Problems involving string manipulation and decoding.
Time Series Problems
Problems that involve sequences of data points in time order.
- 🟨 198. House Robber [Solution]
- 🟨 213. House Robber II [Solution]
- 🟨 983. Minimum Cost For Tickets [Solution]
Stock Trading Problems
A subset of time series problems focusing on stock trading scenarios.
- 🟩 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]
- 🟥 188. Best Time to Buy and Sell Stock IV [Solution]
- 🟨 309. Best Time to Buy and Sell Stock with Cooldown
- 🟨 714. Best Time to Buy and Sell Stock with Transaction Fee
Maximum Subarray Problems
Problems involving finding subarrays with maximum sum or product.
- 🟨 53. Maximum Subarray [Solution]
- 🟨 152. Maximum Product Subarray [Solution]
- 🟨 918. Maximum Sum Circular Subarray [Solution]
Edit Distance Problems
Problems involving calculating the minimum number of operations to transform one string into another.
- 🟥 72. Edit Distance [Solution]
- 🟨 583. Delete Operation for Two Strings
- 🟨 712. Minimum ASCII Delete Sum for Two Strings
Keyboard Problems
Problems involving simulating keyboard operations.
Matrix Area Problems
Problems involving finding areas or shapes within matrices.
Sequence Problems
Problems involving manipulating or analyzing sequences.
Problem Difficulty Legend
- 🟩 Easy
- 🟨 Medium
- 🟧 Medium-Hard
- 🟥 Hard
- ⬛ Very Hard
