Recursion Roadmap - Easy to Medium
Easy Stage (Foundation Building)
Array
1. Sum of array elements [ ]
2. Check if array is sorted [ ]
3. Find maximum element in array [ ]
4. Linear search recursively [ ]
5. Find first index of an element [ ]
6. Find last index of an element [ ]
7. Count occurrences of an element [ ]
8. Reverse array recursively [ ]
String
1. Print characters of a string one by one [ ]
2. Reverse a string [ ]
3. Palindrome check [ ]
4. Count vowels in string [ ]
5. Remove a specific character [ ]
6. Replace all occurrences of a character [ ]
7. Remove duplicates (basic version) [ ]
Other
1. Factorial of a number [ ]
2. Fibonacci series (simple recursion) [ ]
3. Power of a number (a^b) [ ]
4. Sum of digits of a number [ ]
5. GCD of two numbers [ ]
6. Print numbers from 1 to N and N to 1 [ ]
Medium Stage (Pattern Expansion)
Array
1. Binary search recursively [ ]
2. Merge two sorted arrays recursively [ ]
Recursion Roadmap - Easy to Medium
3. Remove duplicates from sorted array recursively [ ]
4. Generate all subsets of an array (Power set) [ ]
5. Generate all permutations of an array [ ]
6. Maximum subarray sum (Divide & Conquer) [ ]
7. Recursive merge sort [ ]
String
1. Generate all subsequences of a string [ ]
2. String permutations [ ]
3. Remove duplicates without extra space [ ]
4. Word break problem (basic) [ ]
5. Longest common subsequence (pure recursion) [ ]
6. Generate all balanced parentheses [ ]
7. String to integer (atoi recursively) [ ]
Other
1. Tower of Hanoi [ ]
2. N-th stair problem [ ]
3. Rat in a Maze (basic backtracking) [ ]
4. N-Queens (basic recursion) [ ]
5. Subset sum problem [ ]
6. Josephus problem [ ]
7. Count paths in a grid [ ]
