Climbing stairs - dp
8 videos • 30 views • by LetsCode
Need to think about the relationship between current state with previous states.
1
Leetcode 509. Fibonacci Number (dp)
LetsCode
Download
2
Leetcode 70. Climbing Stairs (dp)
LetsCode
Download
3
Leetcode 1137. N-th Tribonacci Number (dp)
LetsCode
Download
4
Leetcode 746. Min Cost Climbing Stairs (dp)
LetsCode
Download
5
Leetcode 377. Combination Sum IV (unbounded knapsack with sequence)
LetsCode
Download
6
Leetcode 2466. Count Ways To Build Good Strings (unbounded knapsack)
LetsCode
Download
7
Leetcode 2266. Count Number of Texts (climbing stairs dp)
LetsCode
Download
8
Leetcode 2533. Number of Good Binary Strings (climbing stairs or unbounded knapsack)
LetsCode
Download