Dynamic Programming
Master dynamic programming patterns and optimization techniques.
Showing 12 of 12 questions
Easy: 2 Medium: 7 Hard: 3
| Question | Difficulty |
|---|---|
Climbing Stairs Count the number of distinct ways to reach the top of n stairs | Easy |
Fibonacci Numbers Calculate the nth Fibonacci number using dynamic programming | Easy |
Coin Change (Minimum Coins) Find the minimum number of coins needed to make a given amount | Medium |
Coin Change II (Number of Ways) Count the number of ways to make a given amount using coins | Medium |
House Robber Find maximum amount that can be robbed without robbing adjacent houses | Medium |
0/1 Knapsack Find maximum value that can be obtained with given weight capacity | Medium |
Longest Common Subsequence Find the length of the longest common subsequence between two strings | Medium |
Longest Increasing Subsequence Find the length of the longest increasing subsequence in an array | Medium |
Unique Paths in Grid Count unique paths from top-left to bottom-right in a grid | Medium |
Edit Distance Find minimum operations to convert one string to another | Hard |
Regular Expression Matching Implement regular expression matching with '.' and '*' | Hard |
Word Break II Return all possible ways to break a string into dictionary words | Hard |