Curated Library
Data Structures and Algorithms in Python for Coding Interviews (Hindi)
A 230-lesson, roughly 74-hour Hindi course that teaches data structures and algorithms in Python through LeetCode and GeeksforGeeks problems. It starts with complexity analysis and basic number and array problems. It then covers searching, sorting, linked lists, recursion and backtracking, stacks and queues, sliding window, greedy, trees, graphs, heaps, dynamic programming, strings and tries. Most problems are taught from brute force to optimal with time and space analysis. It suits learners who know basic Python and are preparing for coding interviews.
Lessons by Code and Debug on YouTubeCurated by YodaHut. These lessons are hosted on YouTube and produced by their original creators, who are not affiliated with YodaHut. You still earn YodaCoins, keep your streak and track progress here.
What You'll Learn
- Analyse time and space complexity with Big O, and know the cost of common Python list, set and dict operations
- Implement core sorting algorithms (selection, bubble, insertion, merge, quick, heap) and binary search variants such as lower/upper bound and rotated-array search
- Build and manipulate linked lists, doubly linked lists, stacks, queues, heaps, binary trees, BSTs, tries and disjoint sets from scratch
- Apply recursion, backtracking, sliding window, two pointers, greedy and monotonic stack patterns to LeetCode and GFG problems
- Implement graph traversals (BFS, DFS) and algorithms such as topological sort, Dijkstra, Bellman-Ford, Floyd-Warshall, Prim and Kruskal
- Solve dynamic programming problems by moving from recursion to memoization, tabulation and space optimization, including knapsack, LCS and stock-trading variants
Prerequisites
- Basic Python: variables, loops, functions, lists, dictionaries and simple classes
- Comfort with basic school-level maths
- Ability to follow Hindi explanations (technical terms are in English)
Course Curriculum
- 1Course Introduction0:56
- 2Time and Space Complexity36:16
- 3Time Limit Exceeded (TLE) Errors5:28
- 4Time Complexity of Common Python Operations14:05
- 5Extracting Digits Using Loops6:14
- 6Counting the Digits in an Integer8:32
- 7Palindrome Number9:31
- 8Armstrong Number8:51
- 9Print All Factors of a Number20:28
- 10Store Frequency in a Dictionary16:50
- 11Introduction to Hashing27:47
- 12Introduction to Recursion25:03
- 13Recursion Using Parameters18:31
- 14Functional Recursion16:18
- 15Factorial of a Number9:06
- 16Reverse an Array Using Recursion15:00
- 17Check if a String Is a Palindrome20:57
- 18Fibonacci Number11:18
- 19Selection Sort13:13
- 20Bubble Sort17:43
- 21Insertion Sort17:53
- 22Merge Sort31:56
- 23Quick Sort29:34
- 24Largest Element in an Array9:49
- 25Second Largest Element Without Sorting15:02
- 26Check if an Array Is Sorted5:22
- 27Remove Duplicates from a Sorted Array20:05
- 28Right Rotate an Array by One Place9:32
- 29Rotate Array by K Places (LeetCode 189)22:17
- 30Move Zeros to the End (LeetCode 283)18:14
- 31Linear Search4:53
- 32Merge Two Sorted Arrays Without Duplicates14:43
- 33Missing Number (LeetCode 268)14:44
- 34Max Consecutive Ones (LeetCode 485)9:46
- 35Two Sum (LeetCode 1)16:44
- 36Maximum Subarray Sum (LeetCode 53)19:40
- 37Best Time to Buy and Sell Stock (LeetCode 121)17:17
- 38Rearrange Array Elements by Sign (LeetCode 2149)18:17
- 39Longest Consecutive Sequence (LeetCode 128)29:53
- 402D Lists and Matrices25:53
- 41Set Matrix Zeroes (LeetCode 73)30:18
- 42Rotate Matrix by 90 Degrees (LeetCode 48)26:58
- 43Spiral Matrix (LeetCode 54)21:40
- 443Sum (LeetCode 15)39:46
- 454Sum (LeetCode 18)39:10
- 46Introduction to Binary Search35:06
- 47Lower Bound and Upper Bound22:39
- 48Search Insert Position (LeetCode 35)7:24
- 49Floor and Ceil in a Sorted Array10:50
- 50First and Last Occurrence in a Sorted Array16:10
- 51Count Occurrences in a Sorted Array10:24
- 52Search in Rotated Sorted Array (LeetCode 33)18:29
- 53Search in Rotated Sorted Array II (LeetCode 81)12:19
- 54Minimum in Rotated Sorted Array (LeetCode 153)16:57
- 55Introduction to Linked Lists11:08
- 56Singly Linked List Operations41:11
- 57Middle of the Linked List (LeetCode 876)15:17
- 58Reverse a Linked List (LeetCode 206)19:21
- 59Linked List Cycle (LeetCode 141)17:34
- 60Linked List Cycle II (LeetCode 142)18:00
- 61Length of a Loop in a Linked List16:55
- 62Odd Even Linked List (LeetCode 328)23:21
- 63Remove Nth Node from End of List (LeetCode 19)20:04
- 64What Is a Doubly Linked List?4:51
- 65Doubly Linked List Methods23:27
- 66Reverse a Doubly Linked List17:34
- 67Delete All Occurrences of a Key in a Doubly Linked List14:41
- 68Find Pairs with Given Sum in a Doubly Linked List26:24
- 69Remove Duplicates from a Sorted Doubly Linked List9:32
- 70Introduction to Bit Manipulation33:43
- 71Bit Manipulation Basics: Set, Clear, Toggle, Swap33:01
- 72Minimum Bit Flips to Convert a Number9:42
- 73Single Number (LeetCode 136)8:13
- 74Subsets Using Bit Manipulation (LeetCode 78)15:10
- 75Generate All Subsequences Using Recursion35:58
- 76Generate Subsequences with Sum K33:11
- 77Check if a Subsequence with Sum K Exists22:41
- 78Count Subsequences with Sum K24:15
- 79Generate All Binary Strings24:15
- 80Generate Parentheses (LeetCode 22)25:42
- 81Combination Sum (LeetCode 39)24:37
- 82Combination Sum II (LeetCode 40)33:22
- 83Subset Sums16:26
- 84Combination Sum III (LeetCode 216)21:58
- 85Letter Combinations of a Phone Number (LeetCode 17)20:56
- 86N-Queens (LeetCode 51)48:28
- 87Rat in a Maze29:49
- 88Implement a Stack Using Arrays21:12
- 89Implement a Queue Using Arrays14:35
- 90Deque in Python9:04
- 91Implement a Stack Using Queues13:05
- 92Implement a Queue Using Stacks11:51
- 93Stack and Queue Using a Doubly Linked List8:55
- 94Valid Parentheses (LeetCode 20)16:22
- 95Min Stack (LeetCode 155)11:11
- 96Infix, Postfix and Prefix Conversions45:40
- 97Next Greater Element20:08
- 98Next Greater Element II (LeetCode 503)12:47
- 99Asteroid Collision (LeetCode 735)18:14
- 100Longest Substring Without Repeating Characters (LeetCode 3)29:03
- 101Max Consecutive Ones III (LeetCode 1004)28:46
- 102Fruit Into Baskets (LeetCode 904)30:45
- 103Maximum Points You Can Obtain from Cards (LeetCode 1423)11:56
- 104Assign Cookies (LeetCode 455)12:17
- 105Fractional Knapsack20:08
- 106Minimum Number of Coins9:22
- 107Lemonade Change (LeetCode 860)11:13
- 108N Meetings in One Room15:42
- 109Jump Game (LeetCode 55)9:46
- 110Jump Game II (LeetCode 45)21:13
- 111Minimum Platforms Required18:39
- 112Introduction to Binary Trees16:38
- 113Binary Tree Node Class and Construction8:45
- 114DFS Traversals: Preorder, Inorder, Postorder23:31
- 115Level Order Traversal (BFS)11:39
- 116Height of a Binary Tree (LeetCode 104)18:39
- 117Diameter of a Binary Tree (LeetCode 543)11:22
- 118Balanced Binary Tree (LeetCode 110)10:13
- 119Binary Tree Maximum Path Sum (LeetCode 124)13:53
- 120Top View of a Binary Tree14:55
- 121Bottom View of a Binary Tree8:36
- 122Right Side View of a Binary Tree (LeetCode 199)19:24
- 123Introduction to Graphs15:55
- 124Graph Representation in Python22:44
- 125Connected Components in Graphs6:40
- 126BFS Traversal of a Graph21:34
- 127DFS Traversal of a Graph19:11
- 128Rotting Oranges (LeetCode 994)29:28
- 129Flood Fill (LeetCode 733)34:03
- 130Detect Cycle in an Undirected Graph (BFS)21:13
- 131Detect Cycle in an Undirected Graph (DFS)15:24
- 13201 Matrix (LeetCode 542)25:42
- 133Surrounded Regions (LeetCode 130)29:08
- 134Number of Enclaves (LeetCode 1020)25:23
- 135Word Ladder (LeetCode 127)35:06
- 136Word Ladder II (LeetCode 126)23:06
- 137Number of Islands (LeetCode 200)25:18
- 138Count Distinct Islands30:40
- 139Is Graph Bipartite? (LeetCode 785)23:42
- 140Topological Sort Using DFS17:10
- 141Detect Cycle in a Directed Graph (DFS)23:13
- 142Topological Sort Using Kahn's Algorithm15:24
- 143Detect Cycle in a Directed Graph Using Kahn's Algorithm6:13
- 144Course Schedule I and II (LeetCode 207, 210)11:59
- 145Eventual Safe States (BFS / Topological Sort)19:57
- 146Eventual Safe States (DFS)18:54
- 147Alien Dictionary7:30
- 148Shortest Path in an Undirected Graph with Unit Distance16:06
- 149Shortest Path in a Weighted DAG28:58
- 150Dijkstra's Algorithm with a Priority Queue22:27
- 151Dijkstra's Algorithm with a Set17:23
- 152Why Dijkstra Needs a Priority Queue16:30
- 153Print the Shortest Path with Dijkstra21:31
- 154Shortest Path in Binary Matrix (LeetCode 1091)22:23
- 155Path With Minimum Effort (LeetCode 1631)21:56
- 156Cheapest Flights Within K Stops (LeetCode 787)25:26
- 157Minimum Multiplications to Reach End14:35
- 158Number of Ways to Arrive at Destination (LeetCode 1976)26:49
- 159Bellman-Ford Algorithm25:53
- 160Floyd-Warshall Algorithm30:16
- 161City With the Smallest Number of Neighbors (LeetCode 1334)14:13
- 162Minimum Spanning Tree Concepts7:03
- 163Prim's Algorithm19:09
- 164Disjoint Set (Union-Find)44:37
- 165Kruskal's Algorithm16:10
- 166Number of Provinces Using Union-Find10:31
- 167Make Network Connected (LeetCode 1319)18:34
- 168Introduction to Binary Search Trees7:37
- 169Search in a BST6:57
- 170Minimum Element in a BST5:35
- 171Ceil in a BST10:33
- 172Floor in a BST5:08
- 173Insert into a BST7:48
- 174Delete Node in a BST14:10
- 175Morris Traversal21:40
- 176Kth Smallest Element in a BST10:39
- 177Validate Binary Search Tree12:25
- 178Lowest Common Ancestor of a BST19:20
- 179Predecessor and Successor in a BST11:55
- 180Priority Queues and Binary Heaps22:35
- 181Heapify Algorithm22:26
- 182Implement a Min Heap13:00
- 183Implement a Max Heap7:07
- 184Check if an Array Represents a Min Heap7:27
- 185Build a Heap from an Array15:22
- 186Convert a Min Heap to a Max Heap2:20
- 187Heap Sort16:19
- 188Kth Largest Element in an Array (QuickSelect)38:29
- 189Kth Largest Element in a Stream9:27
- 190Introduction to Dynamic Programming37:59
- 191Climbing Stairs11:10
- 192Frog Jump35:09
- 193House Robber II11:03
- 194House Robber29:40
- 195Geek's Training (2D DP)50:42
- 196Unique Paths II9:36
- 197Unique Paths43:44
- 198Minimum Path Sum23:17
- 199Triangle: Minimum Path Sum32:16
- 200Minimum Falling Path Sum34:41
- 201Cherry Pickup II37:32
- 202Partition Equal Subset Sum6:20
- 203Subset Sum Equal to Target35:40
- 204Partition into Two Subsets with Minimum Difference21:19
- 205Count Subsets with Sum K36:30
- 206Count Partitions with Given Difference8:47
- 2070/1 Knapsack37:41
- 208Longest Common Subsequence53:59
- 209Print the Longest Common Subsequence18:58
- 210Longest Common Substring14:29
- 211Longest Palindromic Subsequence9:19
- 212Minimum Insertions to Make a String Palindrome11:43
- 213Delete Operation for Two Strings9:31
- 214Best Time to Buy and Sell Stock II37:46
- 215Best Time to Buy and Sell Stock III32:32
- 216Best Time to Buy and Sell Stock IV5:26
- 217Remove Outermost Parentheses11:46
- 218Reverse Words in a String7:44
- 219Largest Odd Number in a String6:55
- 220Longest Common Prefix17:12
- 221Isomorphic Strings15:50
- 222Rotate String13:21
- 223Valid Anagram15:18
- 224Sort Characters by Frequency11:32
- 225Maximum Nesting Depth of Parentheses10:21
- 226Roman to Integer12:33
- 227Implement Trie (Prefix Tree)32:59
- 228Implement Trie II20:57
- 229Complete String22:08
- 230Count Distinct Substrings13:09
About the Instructor
Code and Debug
YouTube creator
230 lessons here 73h 44m
The lessons in this course were produced by Code and Debug and are published on YouTube. YodaHut selected and sequenced them into this course; we did not make them, and Code and Debug is not affiliated with YodaHut.
Visit the channel on YouTubeMore in the Library: Development
Programming, Data Structures and Algorithms using Python (IIT Madras)
Data Structures and Algorithms in Python for Coding Interviews
TypeScript for Beginners: Types, Interfaces, Classes and Generics
React with TypeScript: Typing Props, Hooks and Reusable Components
Git and GitHub in Hindi: From First Commit to Pull Requests and Rebase
Git and GitHub for Beginners: Commits, Branches, Pull Requests and Collaboration
- 230 lessons
- 73h 44m of video
- Earns YodaCoins & streaks
- Timestamped notes
- Free — hosted on YouTube
No certificate is issued for Library courses.