Scribd
Upload
179 views2 pages

Essential LeetCode Recursion Problems

The document outlines a roadmap for mastering recursion through 60 curated problems from LeetCode, categorized into four stages: Beginner, Intermediate, Backtracking, and Advanced. Each stage contains a list of specific problems designed to progressively build recursion skills, starting from basic concepts to complex recursive structures. This structured approach aims to guide learners from foundational knowledge to advanced problem-solving techniques in recursion.

Uploaded by

Pritam Maity
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
179 views2 pages

Essential LeetCode Recursion Problems

The document outlines a roadmap for mastering recursion through 60 curated problems from LeetCode, categorized into four stages: Beginner, Intermediate, Backtracking, and Advanced. Each stage contains a list of specific problems designed to progressively build recursion skills, starting from basic concepts to complex recursive structures. This structured approach aims to guide learners from foundational knowledge to advanced problem-solving techniques in recursion.

Uploaded by

Pritam Maity
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

60 Must-Do Recursion Problems from LeetCode

A complete roadmap from Beginner to Advanced, curated for mastering recursion step by step.

Stage 1: Beginner (Base Case & Simple Recursion — 1 to 15)


• 509. Fibonacci Number
• 326. Power of Three
• 231. Power of Two
• 342. Power of Four
• 344. Reverse String
• 206. Reverse Linked List
• 24. Swap Nodes in Pairs
• 21. Merge Two Sorted Lists
• 100. Same Tree
• 104. Maximum Depth of Binary Tree
• 111. Minimum Depth of Binary Tree
• 112. Path Sum
• 226. Invert Binary Tree
• 617. Merge Two Binary Trees
• 938. Range Sum of BST

Stage 2: Intermediate (Recursive Decomposition & Divide and


Conquer — 16 to 30)
• 50. Pow(x, n)
• 169. Majority Element
• 53. Maximum Subarray
• 108. Convert Sorted Array to Binary Search Tree
• 109. Convert Sorted List to Binary Search Tree
• 23. Merge k Sorted Lists
• 148. Sort List
• 95. Unique Binary Search Trees II
• 241. Different Ways to Add Parentheses
• 894. All Possible Full Binary Trees
• 654. Maximum Binary Tree
• 105. Construct Binary Tree from Preorder and Inorder Traversal
• 106. Construct Binary Tree from Inorder and Postorder Traversal
• 889. Construct Binary Tree from Preorder and Postorder Traversal
• 427. Construct Quad Tree
Stage 3: Backtracking (Recursive Search & Decision Making — 31
to 45)
• 46. Permutations
• 47. Permutations II
• 77. Combinations
• 78. Subsets
• 90. Subsets II
• 39. Combination Sum
• 40. Combination Sum II
• 216. Combination Sum III
• 131. Palindrome Partitioning
• 93. Restore IP Addresses
• 22. Generate Parentheses
• 17. Letter Combinations of a Phone Number
• 79. Word Search
• 51. N-Queens
• 52. N-Queens II

Stage 4: Advanced (Complex Recursive Structures — 46 to 60)


• 37. Sudoku Solver
• 126. Word Ladder II
• 212. Word Search II
• 301. Remove Invalid Parentheses
• 394. Decode String
• 282. Expression Add Operators
• 698. Partition to K Equal Sum Subsets
• 473. Matchsticks to Square
• 980. Unique Paths III
• 329. Longest Increasing Path in a Matrix
• 124. Binary Tree Maximum Path Sum
• 437. Path Sum III
• 968. Binary Tree Cameras
• 51. N-Queens (Revisit for Optimization)
• 70. Climbing Stairs (Recursion + Memoization)

You might also like