
YouTubePrice
This course is free to watch on its platform.
Watch free on YouTube →Mark your own learning status. Opening a course link does not establish enrollment.
Loading saved status…
Despite the broad title, most of this video is a recursion course built from first principles in Python. It opens with what a data structure and an algorithm are, then spends most of its running time on recursive thinking, from base cases to induction.
Students who are new to recursion and want to understand each call rather than memorise templates. Treat the other topics in the title as a brief introduction, and expect the placement-style problems to be the most useful part.
Master DSA Recursion from scratch with this complete Python tutorial designed for students preparing for placements, coding interviews, and software engineering jobs at companies like Google and Amazon.
In this 11-hour DSA masterclass, you will learn recursion fundamentals, base cases, factorial, Fibonacci, recursion with arrays and strings, linear search, binary search, merge sort, quick sort, subsequences, permutations, and Tower of Hanoi through practical examples and coding problems.
Whether you're a beginner, college student, or placement aspirant, this course will help you build strong problem-solving skills and prepare for technical interviews.
What you'll learn: • DSA fundamentals and algorithms • Recursion, base cases, and stack overflow • Mathematical induction and recurrence relations • Recursion with arrays and strings • Linear search and binary search • Merge sort and quick sort • Subsequences and permutations • Google and Amazon-style coding interview problems • Tower of Hanoi and advanced recursion concepts
This course is ideal for students preparing for DSA placements, coding interviews, internships, and software developer jobs. Focus on understanding the logic behind every recursive call instead of memorizing code.
Subscribe for more Python tutorials, DSA courses, coding interview preparation, and placement-focused content.
0:00:00 Why Learn DSA in 2026?
0:02:30 What Is a Data Structure?
0:10:03 Stack Example: Undo Operation
0:15:04 What Is an Algorithm?
0:17:03 Built-in Data Structures in Python
0:24:42 Introduction to Recursion
0:27:23 Function Calls & Call Flow
0:40:10 What Is Recursion?
0:42:31 Infinite Recursion Problem
0:45:10 Fixing It with a Base Case
0:52:31 Factorial Using Recursion
0:57:32 Maximum Recursion Depth Error
1:00:01 Stack Memory & Stack Overflow
1:16:01 Principle of Mathematical Induction
1:22:40 PMI Proof: Sum of Natural Numbers
1:32:10 3 Steps to Solve Any Recursion
1:37:03 Power of 2 Using Recursion
1:46:56 Count Digits of a Number
1:55:41 Fibonacci Numbers Using Recursion
1:58:00 Strong Induction for Fibonacci
2:10:42 Fibonacci Recursion Tree & Calls
2:23:01 Print 1 to N & N to 1
2:32:10 Head Recursion vs Tail Recursion
2:43:50 Sum of Digits & Power of a Number
2:50:51 Recursion with Arrays
3:00:10 Sum of an Array Using Recursion
3:13:10 Sum of Array with Tail Recursion
3:30:15 Check If an Array Is Sorted
3:53:40 First Index of a Number
4:06:15 Last Index of a Number
4:20:00 All Indices of a Number
4:36:30 Index-Based Recursion (No Slicing)
4:58:30 Returning a List from Recursion
5:01:43 Global vs Local Variables
5:35:10 Linear Search Using Recursion
5:50:50 Binary Search Using Recursion
6:12:18 Merge Sort Intuition
6:32:42 Merge Two Sorted Lists
6:42:15 Coding Merge Sort
7:11:10 Quick Sort Intuition
7:20:00 Partition Function Explained
7:25:00 Coding Quick Sort
7:46:49 Recursion with Strings
7:51:20 Remove a Character from a String
8:03:10 Check Palindrome Using Recursion
8:29:17 Substring vs Subsequence
8:41:00 Print All Subsequences
9:00:02 Subsequences: Alternate Approach
9:14:40 Print All Permutations of a String
9:33:19 Return All Permutations
9:51:01 Print All Codes of a Number
10:18:41 Return All Codes of a Number
10:28:40 Letter Combinations of a Phone Number
10:50:00 Tower of Hanoi
11:08:40 Recap & Next Steps
#dsa #recursion #datastructuresandalgorithms #google #amazon #amazoninterview #python #pythonprogramming #codinginterview #placementpreparation #faang #codingforbeginners #programming #algorithms #mergesort #quicksort #backtracking #jobreadycourses #softwareengineer #techjobs #dsa2026 #placements2027
[ DSA, data structures and algorithms, DSA recursion, recursion tutorial, recursion full course, recursion in Python, Python recursion tutorial, DSA full course, learn DSA, DSA for beginners, DSA from scratch, complete DSA course, recursion masterclass, recursion explained, recursion for beginners, recursion beginner to advanced, recursion interview questions, recursion practice problems, recursion coding questions, recursion problem solving, DSA placement preparation, DSA for placements, DSA for coding interviews, Google coding interview questions, Amazon coding interview questions, Google interview preparation, Amazon interview preparation, FAANG interview preparation, top tech company interviews, coding interview preparation, placement preparation 2026, placement preparation 2027, job ready DSA course, DSA roadmap 2026, DSA roadmap 2026-27, Python DSA course, algorithms in Python, data structures in Python, factorial using recursion, backtracking problems, advanced recursion problems, DSA for college students, DSA for freshers, coding for beginners, programming for beginners, software engineering interview preparation, crack Google interviews, crack Amazon interviews, learn problem solving, placement ready coding course ]
Advertisement
No Korshub reviews yet.