This comprehensive learning path is designed to take you from the fundamentals of recursion to advanced backtracking algorithms and classic divide-and-conquer sorting techniques. You'll explore recursion trees, stack space, parameterised and functional recursion, and tackle complex problems involving subsequences, combinations, permutations, and backtracking puzzles like N-Queens and Sudoku Solver. Develop a strong problem-solving foundation essential for competitive programming and technical interviews.
Re 1. Introduction to Recursion | Recursion Tree | Stack Space | Strivers A2Z DSA Course
22:46
Re 2. Problems on Recursion | Strivers A2Z DSA Course
22:04
Re 3. Parameterised and Functional Recursion | Strivers A2Z DSA Course
18:14
Re 4. Problems on Functional Recursion | Strivers A2Z DSA Course
19:48
Re 5. Multiple Recursion Calls | Problems | Strivers A2Z DSA Course
16:45
Quiz: Introduction to Recursion Fundamentals
10 min