Skip to content
</>
CodingGyan
Topics
About
Search problems
☾
Home
/
Recursion and Backtracking
🌀
Recursion and Backtracking
Think in small steps. Recursion and backtracking. 24 problems · Intermediate level.
All
Easy
Medium
Hard
24 problems
Recursion basics
✓
Sum of an Array Using Recursion
easy
Backtracking
✓
All Permutations of a String
medium
✓
Generate All Subsets
medium
✓
Generate Balanced Parentheses
medium
✓
Phone Keypad Letter Combinations
medium
✓
Binary Strings Without Two 1s in a Row
medium
✓
Letter Case Permutations
medium
✓
N-Queens (Count the Solutions)
hard
✓
Combination Sum
hard
String recursion
✓
Palindrome Check (Recursive)
easy
basic recursion
✓
Sum of Digits (Recursion)
easy
✓
Power with Recursion (Divide by Two)
medium
memoization
✓
Fibonacci with Memoization
easy
classic recursion
✓
Tower of Hanoi
medium
counting paths
✓
Count Paths in a Grid
medium
include exclude
✓
Count Subsets with a Given Sum
medium
construction
✓
Gray Code Sequence
medium
recurrence
✓
Josephus Survivor
medium
partitions
✓
Count Integer Partitions
medium
deep recursion
✓
Ackermann Function
medium
subset sum
✓
Target Sum Ways
medium
recursion counting
✓
Tile a 2 x n Floor with Dominoes
medium
grid recursion
✓
Flood Fill: Region Size
medium
recursion on structure
✓
K-th Symbol in the Grammar
medium