Recursion Series - 10 Day Recursion Challenge

Learn recursion fundamentals and advanced problem-solving techniques through this comprehensive video series designed for programming placement preparation. Master the core concepts of recursion starting with basic understanding and gradually progress to complex algorithmic implementations including binary search, string manipulation, merge sort, and quick sort. Practice essential coding interview problems such as generating subsets and subsequences, solving the phone keypad problem, finding string permutations, and navigating the classic rat in a maze challenge. Develop proficiency in analyzing time and space complexity of recursive algorithms while building a solid foundation for technical interviews. The series follows a structured 10-day challenge format that systematically builds your recursive thinking skills from beginner to advanced level, covering both theoretical concepts and practical coding implementations in C++.

Syllabus

Lecture 31: Learning Recursion the Best Way! | 10 Day Recursion Challenge
Lecture32: Understanding Recursion the easiest way || Day-2 || 10 Day Recursion Challenge
Lecture33: Recursion and Binary Search | Day-3 | 10 Days Recursion Challenge
Lecture34: Recursion with Strings | Day-4 | 10 Day Recursion Challenge
Lecture35: Merge Sort using Recursion | Day-5 | 10 Day Recursion Challenge
Lecture36: Quick Sort using Recursion | Day-6 | 10 Day Recursion Challenge
Lecture37: Recursion - Subsets / Subsequences of String [Theory + Code]
Lecture38: Phone Keypad Problem Recursion || C++ Placement Course
Lecture39: Permutations of a String || C++ Placement Course
Lecture40: Rat in a Maze Problem || C++ Placement Course 2022
Lecture 41: Time & Space Complexity of Recursive Algorithms || C++ Placement Course