Recursion and Backtracking - DSA

By take U forward

Master the fundamentals and advanced paradigms of recursion and backtracking through a comprehensive collection of algorithmic problems and patterns. Gain practical problem-solving skills to efficiently tackle complex coding challenges, spanning subsequences, sorting algorithms, permutations, and classic puzzles like N-Queens and Sudoku Solver.

Table of Contents

Recursion and Backtracking - DSA

Table of Contents

Re 1. Introduction to Recursion | Recursion Tree | Stack Space | Strivers A2Z DSA Course

Re 2. Problems on Recursion | Strivers A2Z DSA Course

Re 3. Parameterised and Functional Recursion | Strivers A2Z DSA Course

Re 4. Problems on Functional Recursion | Strivers A2Z DSA Course

Re 5. Multiple Recursion Calls | Problems | Strivers A2Z DSA Course

L6. Recursion on Subsequences | Printing Subsequences

L7. All Kind of Patterns in Recursion | Print All | Print one | Count

Merge Sort | Algorithm | Pseudocode | Dry Run | Code | Strivers A2Z DSA Course

Quick Sort For Beginners | Strivers A2Z DSA Course

L8. Combination Sum | Recursion | Leetcode | C++ | Java

L9. Combination Sum II | Leetcode | Recursion | Java | C++

L10. Subset Sum I | Recursion | C++ | Java

L11. Subset Sum II | Leetcode | Recursion

L12. Print all Permutations of a String/Array | Recursion | Approach - 1

L13. Print all Permutations of a String/Array | Recursion | Approach - 2

L14. N-Queens | Leetcode Hard | Backtracking

L15. Sudoko Solver | Backtracking

L16. M-Coloring Problem | Backtracking

L17. Palindrome Partitioning | Leetcode | Recursion | C++ | Java

L19. Rat in A Maze | Backtracking

L18. K-th Permutation Sequence | Leetcode

Count Inversions in an Array | Brute and Optimal