Basic DP Problems
Less than 1 minute
DP Basic Problems
Problem Number | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
0509 | Fibonacci Number | [[LeetCode XXXX]] | Recursion, Memorization Search, Mathematics, Dynamic Programming | Easy |
0070 | Climbing Stairs | [[LeetCode XXXX]] | Memorization Search, Mathematics, Dynamic Programming | Easy |
0062 | Unique Paths | [[LeetCode XXXX]] | Mathematics, Dynamic Programming, Combinatorics | Medium |
1137 | N-th Tribonacci Number | [[LeetCode XXXX]] | Memorization Search, Mathematics, Dynamic Programming | Easy |
0375 | Guess Number Higher or Lower II | [[LeetCode 0375]] | Mathematics, Dynamic Programming, Game Theory | Medium |
0494 | Target Sum | [[LeetCode XXXX]] | Array, Dynamic Programming, Backtracking | Medium |
0576 | Out of Boundary Paths | [[LeetCode 0576]] | Dynamic Programming | Medium |
0087 | Scramble String | String, Dynamic Programming | Hard | |
0403 | Frog Jump | [[LeetCode 0403]] | Array, Dynamic Programming | Hard |
0552 | Student Attendance Record II | Dynamic Programming | Hard | |
0913 | Cat and Mouse | Graph, Topological Sort, Memorization Search, Mathematics, Dynamic Programming, Game Theory | Hard | |
0329 | Longest Increasing Path in a Matrix | [[LeetCode XXXX]] | Depth-First Search, Breadth-First Search, Graph, Topological Sort, Memorization Search, Array, Dynamic Programming, Matrix | Hard |