Recursion Problems
Less than 1 minute
Recursive Algorithm Problems
| Problem ID | Title | Solution | Tags | Difficulty |
|---|---|---|---|---|
| 0344 | Reverse String | [[LeetCode XXXX]] | Two Pointers, String | Easy |
| 0024 | Swap Nodes in Pairs | [[LeetCode XXXX]] | Recursion, Linked List | Medium |
| 0118 | Pascal's Triangle | [[LeetCode XXXX]] | Array, Dynamic Programming | Easy |
| 0119 | Pascal's Triangle II | [[LeetCode XXXX]] | Array, Dynamic Programming | Easy |
| 0206 | Reverse Linked List | [[LeetCode XXXX]] | Recursion, Linked List | Easy |
| 0092 | Reverse Linked List II | [[LeetCode XXXX]] | Linked List | Medium |
| 0021 | Merge Two Sorted Lists | [[LeetCode XXXX]] | Recursion, Linked List | Easy |
| 0509 | Fibonacci Number | [[LeetCode XXXX]] | Recursion, Memoization, Math, Dynamic Programming | Easy |
| 0070 | Climbing Stairs | [[LeetCode XXXX]] | Memoization, Math, Dynamic Programming | Easy |
| 0104 | Maximum Depth of Binary Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy |
| 0124 | Binary Tree Maximum Path Sum | [[LeetCode XXXX]] | Tree, Depth-First Search, Dynamic Programming, Binary Tree | Hard |
| 0226 | Invert Binary Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy |
| 0050 | Pow(x, n) | [[LeetCode XXXX]] | Recursion, Math | Medium |
| 0779 | K-th Symbol in Grammar | [[LeetCode XXXX]] | Bit Manipulation, Recursion, Math | Medium |
| 0095 | Unique Binary Search Trees II | [[LeetCode XXXX]] | Tree, Binary Search Tree, Dynamic Programming, Backtracking, Binary Tree | Medium |