Counting DP Problems
Less than 1 minute
Counting DP Problems
| Problem ID | Title | Solution | Tags | Difficulty |
|---|---|---|---|---|
| 0062 | Unique Paths | [[LeetCode XXXX]] | Math, Dynamic Programming, Combinatorics | Medium |
| 0063 | Unique Paths II | [[LeetCode XXXX]] | Array, Dynamic Programming, Matrix | Medium |
| 0343 | Integer Break | [[LeetCode XXXX]] | Math, Dynamic Programming | Medium |
| 0096 | Unique Binary Search Trees | [[LeetCode XXXX]] | Tree, Binary Search Tree, Math, Dynamic Programming, Binary Tree | Medium |
| 1259 | Handshakes That Don't Cross | Math, Dynamic Programming | Hard | |
| 0790 | Domino and Tromino Tiling | Dynamic Programming | Medium | |
| 0070 | Climbing Stairs | [[LeetCode XXXX]] | Memoization, Math, Dynamic Programming | Easy |
| 0746 | Min Cost Climbing Stairs | [[LeetCode XXXX]] | Array, Dynamic Programming | Easy |
| 0509 | Fibonacci Number | [[LeetCode XXXX]] | Recursion, Memoization, Math, Dynamic Programming | Easy |
| 1137 | N-th Tribonacci Number | [[LeetCode XXXX]] | Memoization, Math, Dynamic Programming | Easy |