Data Structures and Algorithms with Python | Free DSA with Python Course
5.0
(2)
23 learners
What you'll learn
This course includes
- 73.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 230 lessons • 73.5 hours of video
Data Structures and Algorithms with Python | Free DSA with Python Course
230 lessons
• 73.5 hours
Data Structures and Algorithms with Python | Free DSA with Python Course
230 lessons
• 73.5 hours
- DSA Python Course 2026 - Data Structures & Algorithms Using Python - Part 1 [Hindi] | Code & Debug 00:56
- Time and Space Complexity? - DSA Python Course 2025 - Part 2 [Hindi] | Code & Debug 36:16
- What is Time Limit Exceeded (TLE) Error? - DSA Python Course 2025 - Part 3 [Hindi] | Code & Debug" 05:28
- Time Complexity of Common Python Operations & Methods - DSA Python Course 2025 - Part 4 [Hindi] 14:05
- DSA in Python - Extraction of Digits Using Loops - Part 5 [Hindi] | Code & Debug 06:14
- DSA in Python Course - Count the Number of Digits in an Integer - Part 6 [Hindi] | Code & Debug 08:32
- DSA in Python Course - Check if a Number is Palindrome or Not - Part 7 [Hindi] | Code & Debug 09:31
- DSA in Python Course - Armstrong Number Explained - Part 8 [Hindi] | Code & Debug 08:51
- DSA in Python Course - Print All Factors of a Given Number - Part 9 [Hindi] | Code & Debug 20:28
- DSA Python Course 2025 - Store Frequency in Dictionary - Part 10 [Hindi] | Code & Debug 16:50
- DSA Python Course 2025 - Introduction to Hashing in Python - Part 11 [Hindi] | Code & Debug 27:47
- DSA Python Course 2025 - Introduction to Recursion Concept - Part 12 [Hindi] | Code & Debug 25:03
- DSA Python Course 2025 - Recursion Using Parameters - Part 13 [Hindi] | Code & Debug 18:31
- DSA Python Course 2025 - What is Functional Recursion? - Part 14 [Hindi] | Code & Debug 16:18
- DSA Python Course 2025 - Find the Factorial of a Number - Part 15 [Hindi] | Code & Debug 09:06
- DSA in Python Course - Reverse an Array Using Recursion - Part 16 [Hindi] | Code & Debug 15:00
- DSA in Python Course- Check if a String is Palindrome or Not - Part 17 [Hindi] | Code & Debug 20:57
- DSA in Python Course - Find the Fibonacci Number - Part 18 [Hindi] | Code & Debug 11:18
- DSA in Python Course - Selection Sort in Python - Part 19 [Hindi] | Code & Debug 13:13
- DSA in Python Course - Bubble Sort in Python - Part 20 [Hindi] | Code & Debug 17:43
- DSA in Python Course - Insertion Sort in Python - Part 21 [Hindi] | Code & Debug 17:53
- DSA in Python Course - Merge Sort in Python - Part 22 [Hindi] | Code & Debug 31:56
- DSA in Python Course - Quick Sort Algorithm in Python - Part 23 [Hindi] | Code & Debug 29:34
- DSA in Python Course - Find the Largest Element in an Array - Part 24 [Hindi] | Code & Debug 09:49
- DSA in Python Course - Find the Second Largest Element in an Array Without Sorting - Part 25 15:02
- DSA in Python Course - Check if an Array is Sorted - Part 26 [Hindi] | Code & Debug 05:22
- DSA in Python Course - Remove Duplicates from a Sorted Array - Part 27 [Hindi] | Code & Debug 20:05
- DSA in Python Course - Right Rotate an Array by One Place - Part 28 [Hindi] | Code & Debug 09:32
- DSA in Python Course - Leetcode 189: Right Rotate an Array by K Places - Part 29 [Hindi] 22:17
- DSA in Python Course - Leetcode 283: Move Zeros to the End of the List - Part 30 [Hindi] 18:14
- DSA in Python Course - Implementing Linear Search - Part 31 [Hindi] | Code & Debug 04:53
- DSA in Python Course - Merge 2 Sorted Arrays Without Duplicates - Part 32 [Hindi] | Code & Debug 14:43
- DSA in Python Course - Leetcode 268: Find Missing Number in an Array - Part 33 [Hindi] 14:44
- DSA in Python Course - Leetcode 485: Max Consecutive Ones - Part 34 [Hindi] | Code & Debug 09:46
- DSA in Python Course - Leetcode 1: Two Sum Problem - Part 35 [Hindi] | Code & Debug 16:44
- DSA in Python Course - Leetcode 53: Find the Maximum Subarray Sum - Part 36 [Hindi] | Code & Debug 19:40
- DSA in Python Course - Leetcode 121: Best Time to Buy and Sell Stock - Part 37 [Hindi] 17:17
- DSA in Python Course - Leetcode 2149: Rearrange Array Elements by Sign - Part 38 [Hindi] 18:17
- DSA in Python Course - Leetcode 128: Longest Consecutive Sequence - Part 39 [Hindi] | Code & Debug 29:53
- DSA in Python Course - Learn About 2D List or Matrix - Part 40 [Hindi] | Code & Debug 25:53
- DSA in Python Course - Leetcode 73: Set Matrix Zeros - Part 41 [Hindi] | Code & Debug 30:18
- DSA in Python Course - Leetcode 48: Rotate Matrix by 90 Degrees - Part 42 [Hindi] | Code & Debug 26:58
- DSA in Python Course - Leetcode 54: Print the Matrix in Spiral Order - Part 43 [Hindi] 21:40
- DSA in Python Course - Leetcode 15: 3Sum Problem - Part 44 [Hindi] 39:46
- DSA in Python Course - Leetcode 18: 4Sum Problem - Part 45 [Hindi] | Code & Debug 39:10
- DSA in Python Course - Introduction to Binary Search - Part 46 [Hindi] | Code & Debug 35:06
- DSA in Python Course - Implementation of Lower and Upper Bound - Part 47 [Hindi] | Code & Debug 22:39
- DSA in Python - Leetcode 35: Search Insert Position | Binary Search Optimization - Part 48 [Hindi] 07:24
- DSA in Python Course - Floor & Ceil in Sorted Array | Binary Search Approach - Part 49 [Hindi] 10:50
- DSA in Python - Find First & Last Occurrence in Sorted Array | Binary Search - Part 50 [Hindi] 16:10
- DSA in Python Course - Count Occurrences in Sorted Array | Binary Search Approach - Part 51 [Hindi] 10:24
- DSA in Python Course - Search in Rotated Sorted Array | Binary Search Approach - Part 52 [Hindi] 18:29
- DSA in Python - Search in Rotated Sorted Array II | Binary Search with Duplicate - Part 53 [Hindi] 12:19
- DSA in Python Course - Find Minimum in Rotated Sorted Array | Binary Search - Part 54 [Hindi] 16:57
- Introduction to Linked Lists in Python | Real-Life Example | Memory Allocation - Part 55 [Hindi] 11:08
- Singly Linked List Operations | Traversal, Insertion, Deletion, Append in Python - Part 56 [Hindi] 41:11
- DSA in Python - Leetcode 876: Middle of the Linked List | Tortoise-Hare Approach - Part 57 [Hindi] 15:17
- DSA in Python Course - Reverse a Linked List | Iterative Approach - Part 58 [Hindi] 19:21
- DSA in Python Course - Leetcode 141: Linked List Cycle | Floyd’s Cycle Detection - Part 59 [Hindi] 17:34
- DSA in Python - Leetcode 142: Linked List Cycle II | Find the Cycle Starting Point - Part 60 [Hindi] 18:00
- DSA in Python Course - Find Length of Loop in Linked List | Floyd Cycle Detection Algo - Part 61 16:55
- DSA in Python Course - Leetcode 328: Odd Even Linked List | Rearrange Nodes | Part 62 [Hindi] 23:21
- DSA Python - Leetcode 19: Remove Nth Node from End of List | Two Pointer Approach - Part 63 [Hindi] 20:04
- DSA in Python Course - What is a Doubly Linked List? | Real Life Example | Part 162 [Hindi] 04:51
- DSA in Python - Doubly Linked List Methods Explained with Code | Insert, Delete, Traverse | Part 163 23:27
- DSA in Python Course - Reverse a Doubly Linked List | GFG Practice | Part 164 [Hindi] 17:34
- DSA in Python - Delete All Occurrences of a Key in Doubly Linked List | GFG Practice | Part 165 14:41
- DSA in Python - Find Pairs with Given Sum in Doubly Linked List | Brute to Optimal | GFG | Part 166 26:24
- DSA in Python Course - Remove Duplicates from a Sorted Doubly Linked List | GFG Practice | Part 167 09:32
- DSA in Python - Introduction to Bit Manipulation | AND, OR, XOR, NOT, Shift Operations - Part 64 33:43
- DSA in Python - Bit Manipulation Basics | Swapping, Setting, Clearing, Toggling Bits - Part 65 33:01
- DSA in Python - Minimum Bit Flips to Convert Number | Bit Manipulation | Leetcode 2220 - Part 66 09:42
- DSA in Python - Single Number | Bit Manipulation & XOR Trick | Leetcode 136 - Part 67 [Hindi] 08:13
- DSA in Python - Generate Subsets Using Bit Manipulation | Power Set | Leetcode 78 - Part 68 [Hindi] 15:10
- DSA in Python - Advanced Recursion | Generate All Subsequences Using Recursion - Part 69 [Hindi] 35:58
- DSA in Python - Advanced Recursion | Generate Subsequences with Sum K | Backtracking - Part 70 33:11
- DSA in Python Course - Backtracking | Check if a Subsequence with Sum = K Exists | Part 71 [Hindi] 22:41
- DSA in Python - Advanced Recursion | Count All Subsequences with Sum K | Backtracking - Part 72 24:15
- DSA in Python - Generate All Binary Strings | Backtracking & Recursion | GFG - Part 73 [Hindi] 24:15
- DSA in Python - Generate Parentheses | Recursion & Backtracking | Leetcode 22 - Part 74 [Hindi] 25:42
- DSA in Python - Combination Sum | Recursion & Backtracking | Leetcode 39 - Part 75 [Hindi] 24:37
- DSA in Python - Combination Sum II | Recursion & Backtracking | Leetcode 40 - Part 76 [Hindi] 33:22
- DSA in Python - Subset Sums | Recursion & Backtracking | GFG Problem - Part 77 [Hindi] 16:26
- DSA in Python - Combination Sum III | Recursion & Backtracking | Leetcode 216 - Part 78 [Hindi] 21:58
- DSA in Python - Letter Combinations of a Phone Number | Backtracking | Leetcode 17 - Part 79 [Hindi] 20:56
- DSA in Python - N-Queens Problem | Recursion & Backtracking | Leetcode 51 - Part 80 [Hindi] 48:28
- DSA in Python - Rat in a Maze | Recursion & Backtracking | GFG Problem - Part 81 [Hindi] 29:49
- DSA in Python - Implement Stack using Arrays | Stack Data Structure Explained - Part 82 [Hindi] 21:12
- DSA in Python - Implement Queue using Arrays | Queue Data Structure Explained - Part 83 [Hindi] 14:35
- DSA in Python - Understanding Deque in Python | append, popleft, appendleft, pop | Part 84 [Hindi] 09:04
- DSA in Python - Implement Stack using Queue | Two Approaches Explained | Part 85 [Hindi] 13:05
- DSA in Python - Implement Queue using Stack | Using Two Stacks Explained | Part 86 [Hindi] 11:51
- DSA in Python Course - Implement Stack & Queue using Doubly Linked List - Part 87 [Hindi] 08:55
- DSA in Python Course - Valid Parentheses | Stack-Based Approach | Leetcode 20 - Part 88 [Hindi] 16:22
- DSA in Python Course - Min Stack | Get Minimum in O(1) using Stack | Leetcode 155 - Part 89 [Hindi] 11:11
- DSA in Python Course - Infix, Postfix & Prefix | Conversions Explained with Stack - Part 90 [Hindi] 45:40
- DSA in Python - Next Greater Element | Monotonic Stack Approach | GFG Problem - Part 91 [Hindi] 20:08
- DSA Python - Next Greater Element II | Circular Array using Stack | Leetcode 503 - Part 92 [Hindi] 12:47
- DSA in Python - Asteroid Collision | Stack Simulation | Leetcode 735 - Part 93 [Hindi] 18:14
- DSA in Python - Longest Substring Without Repeating Characters | Leetcode 3 - Part 94 [Hindi] 29:03
- DSA in Python - Max Consecutive Ones III | Sliding Window Approach | Leetcode 1004 - Part 95 [Hindi] 28:46
- DSA in Python - Fruit Into Baskets | Brute, Better & Optimal | Leetcode 904 - Part 96 [Hindi] 30:45
- DSA in Python Course - Maximum Points You Can Obtain from Cards | Leetcode 1423 - Part 97 [Hindi] 11:56
- DSA in Python - Assign Cookies | Greedy Optimal O(nlogn) Solution | Leetcode 455 - Part 98 [Hindi] 12:17
- DSA in Python - Fractional Knapsack | Greedy + Sorting Optimal Solution | GFG - Part 99 [Hindi] 20:08
- DSA in Python - Minimum Number of Coins | Greedy Optimal Solution | GFG - Part 100 [Hindi] 09:22
- DSA in Python - Lemonade Change | Greedy Solution | Leetcode 860 - Part 101 [Hindi] 11:13
- DSA Python - N Meetings in One Room | Greedy Scheduling Optimal Solution | GFG - Part 102 [Hindi] 15:42
- DSA in Python - Jump Game | Optimal Greedy | Leetcode 55 - Part 103 [Hindi] 09:46
- DSA in Python - Jump Game II | Recursion to Greedy (All Approaches) | Leetcode 45 - Part 104 [Hindi] 21:13
- DSAPython - Minimum Platforms Required | Brute Force to Optimal Two-Pointer | GFG - Part 105 [Hindi] 18:39
- DSA Python - Introduction to Binary Trees | Concepts, Terminology, Types Explained | Part 106[Hindi] 16:38
- DSA in Python - Binary Tree Implementation | Node Class & Tree Construction | Part 107 [Hindi] 08:45
- DSA in Python - DFS in Binary Trees | Preorder, Inorder, Postorder Traversal - Part 108 [Hindi] 23:31
- DSA in Python - Level Order Traversal (BFS) in Binary Tree | Using Deque | Part 109 [Hindi] 11:39
- DSA in Python - Height of Binary Tree | DFS & BFS Approaches | Leetcode 104 - Part 110 [Hindi] 18:39
- DSA in Python - Diameter of Binary Tree | Optimized DFS Approach | Leetcode 543 - Part 111 [Hindi] 11:22
- DSA Python 2025 - Check if Binary Tree is Height Balanced | Optimized DFS - Part 112 [Hindi] 10:13
- DSA Python - Binary Tree Maximum Path Sum | Optimized DFS Approach | Leetcode 124 - Part 113 [Hindi] 13:53
- DSA in Python - Top View of Binary Tree | Vertical Line BFS + Hashmap | GFG - Part 114 [Hindi] 14:55
- DSA in Python - Bottom View of Binary Tree | BFS + Line Mapping | GFG - Part 115 [Hindi] 08:36
- DSA in Python - Right Side View of Binary Tree | BFS + Reverse DFS | Leetcode 199 - Part 116 [Hindi] 19:24
- DSA Python 2025 - Introduction to Graphs | Nodes, Edges, Cycles, Weighted Graphs - Part 117 [Hindi] 15:55
- DSA Python - Graph Representation in Python | Adjacency Matrix, List & Dictionary - Part 118 [Hindi] 22:44
- DSA with Python - What Are Connected Components in Graphs? - Part 119 [Hindi] 06:40
- DSA Python - Breadth First Search (BFS) in Graph | Queue + Visited Logic | GFG - Part 120 [Hindi] 21:34
- DSA Python - Depth First Search (DFS) in Graph | Recursion + Visited Set | GFG - Part 121 [Hindi] 19:11
- DSA with Python - Rotting Oranges | BFS Grid Traversal | Leetcode 994 - Part 122 [Hindi] 29:28
- DSA with Python - Flood Fill Algorithm | DFS & BFS Grid Coloring | Leetcode 733 - Part 123 [Hindi] 34:03
- DSA in Python - Detect Cycle in Undirected Graph | BFS with Parent Tracking | GFG - Part 124 [Hindi] 21:13
- DSA Python 2025 - Detect Cycle in Undirected Graph | DFS with Parent Check | GFG - Part 125 [Hindi] 15:24
- DSA Python - 01 Matrix | Multi-Source BFS for Shortest Distance | Leetcode 542 - Part 126 [Hindi] 25:42
- DSA Python 2025 - Surrounded Regions | Boundary DFS Grid Fill | Leetcode 130 - Part 127 [Hindi] 29:08
- DSA Python - Number of Enclaves | Boundary BFS Grid Traversal | Leetcode 1020 - Part 128 [Hindi] 25:23
- DSA Python 2025 - Word Ladder | BFS for Shortest Transformation | Leetcode 127 - Part 129 [Hindi] 35:06
- DSA Python 2025 - Word Ladder II | All Shortest Paths Using BFS | Leetcode 126 - Part 130 [Hindi] 23:06
- DSA Python 2025 - Number of Islands | DFS & BFS Grid Traversal | Leetcode 200 - Part 131 [Hindi] 25:18
- DSA Python 2025 - Count Distinct Islands Using DFS | Shape Normalization | GFG - Part 132 [Hindi] 30:40
- DSA Python 2025 - Check If Graph is Bipartite Using DFS | Leetcode 785 - Part 133 [Hindi] 23:42
- DSA Python - Topological Sort Using DFS | GFG Problem | Directed Acyclic Graph - Part 135 [Hindi] 17:10
- DSA Python - Detect Cycle in Directed Graph | GFG Problem | DFS + Path Visited - Part 134 [Hindi] 23:13
- DSA Python - Topological Sort using Kahn's Algorithm | GFG Problem | BFS on DAG - Part 136 [Hindi] 15:24
- DSA Python - Detect Cycle in Directed Graph using Kahn’s Algorithm | GFG Problem - Part 137 [Hindi] 06:13
- DSA Python 2025 - Course Schedule I & II | Kahn’s Algo | Leetcode 207 & 210 - Part 138 [Hindi] 11:59
- DSA Python - Eventual Safe States | BFS | Reverse Graph + Topo Sort | LC 802 - Part 139 [Hindi] 19:57
- DSA Python - Eventual Safe States | Detect Terminal Nodes | LC 802 Explained - Part 140 [Hindi] 18:54
- DSA in Python Course - Alien Dictionary | Topological Sort in Graph | GFG | Part 141 [Hindi] 07:30
- DSA in Python - Shortest Path in Undirected Graph with Unit Distance | BFS | GFG | Part 142 [Hindi] 16:06
- DSA in Python - Shortest Path in Directed Weighted Graph (DAG) | Topological Sort | GFG | Part 143 28:58
- DSA in Python Course - Dijkstra’s Algorithm Using Priority Queue | GFG | Graphs Part 144 22:27
- DSA in Python- Dijkstra’s Algorithm Using Set | Why Priority Queue is Better | Graphs Part 145 17:23
- DSA Python 2025 - Why Use Priority Queue and not Queue in Dijkstra’s Algorithm? | Part 146 16:30
- DSA in Python - Print Shortest Path Using Dijkstra | Path Reconstruction | Graphs - Part 147 [Hindi] 21:31
- DSA Python - Shortest Path in Binary Matrix | Leetcode 1091 | BFS Grid Traversal - Part 148 [Hindi] 22:23
- DSA in Python - Path With Minimum Effort | Leetcode 1631 Explained | Dijkstra on Grids - Part 149 21:56
- DSA in Python - Cheapest Flights Within K Stops | Leetcode 787 | Modified BFS | Part 150 [Hindi] 25:26
- DSA in Python - Minimum Multiplications to Reach End | GFG Problem Explained | Part 151 [Hindi] 14:35
- DSA in Python - Number of Ways to Arrive at Destination | Dijkstra | LC 1976 | Part 152 [Hindi] 26:49
- DSA in Python - Bellman-Ford Algorithm | Detect Negative Cycles | GFG Problem | Part 153 [Hindi] 25:53
- DSA in Python - Floyd Warshall Algorithm | All-Pairs Shortest Path | GFG Problem | Part 154 [Hindi] 30:16
- DSA in Python - Smallest City with Threshold Neighbors | Leetcode 1334 | Floyd Warshall | Part 155 14:13
- DSA in Python - What is Minimum Spanning Tree (MST)? | Theory Only | GFG MST | Part 156 [Hindi] 07:03
- DSA in Python - Prim’s Algorithm | Minimum Spanning Tree (MST) | GFG | Part 157 [Hindi] 19:09
- DSA in Python - Disjoint Set (Union-Find) | Path Compression + Union by Size/Rank | Part 158 [Hindi] 44:37
- DSA in Python - Minimum Spanning Tree Using Kruskal’s Algorithm | GFG MST | Part 159 [Hindi] 16:10
- DSA in Python - Number of Provinces Using Disjoint Set (Union-Find) | GFG Graph | Part 160 [Hindi] 10:31
- DSA in Python - Make Network Connected Using Disjoint Set | LeetCode 1319 | Part 161 [Hindi] 18:34
- DSA in Python Course - Introduction to Binary Search Tree | BST Explained | Part 168 [Hindi] 07:37
- DSA in Python Course - Search in a Binary Search Tree | LeetCode Easy | Part 169 [Hindi] 06:57
- DSA in Python Course - Minimum Element in BST | GFG Practice | Part 170 [Hindi] 05:35
- DSA in Python Course - Ceil in BST | Find Ceiling Value in Binary Search Tree | GFG | Part 171 10:33
- DSA in Python Course - Floor in BST | Find Floor Value in Binary Search Tree | Part 172 [Hindi] 05:08
- DSA in Python Course - Insert into a Binary Search Tree | LeetCode Medium | Part 173 [Hindi] 07:48
- DSA in Python Course - Delete Node in a BST | LeetCode Medium | Part 174 [Hindi] 14:10
- DSA in Python Course - Morris Algorithm for Inorder/Preorder Traversal | Space Optimized | Part 175 21:40
- DSA in Python Course - Kth Smallest Element in a BST | Morris Algorithm | LeetCode Medium | Part 176 10:39
- DSA in Python Course - Validate Binary Search Tree | Range Validation | LeetCode Medium | Part 177 12:25
- DSA in Python Course - Lowest Common Ancestor of a Binary Search Tree | LeetCode Medium | Part 178 19:20
- DSA in Python Course - Predecessor and Successor in BST | GFG Practice | Part 179 [Hindi] 11:55
- DSA in Python - Introduction to Priority Queues using Binary Heaps | Min & Max Heaps | Part 180 22:35
- DSA in Python Course - Heapify Algorithm Explained | Building Heaps Efficiently | Part 181 [Hindi] 22:26
- DSA in Python Course - Implement Min Heap | From Scratch with Code | Part 183 [Hindi] 13:00
- DSA in Python Course - Implement Max Heap | From Scratch with Code | Part 184 [Hindi] 07:07
- DSA in Python Course - Check if an Array Represents a Min Heap | Validation Explained | Part 185 07:27
- DSA in Python Course - Build Heap from a Given Array | Heap Construction Explained | Part 182 15:22
- DSA in Python Course - Convert Min Heap to Max Heap | Efficient Transformation | Part 186 [Hindi] 02:20
- DSA in Python Course - Heap Sort Algorithm | Sorting using Max Heap | Part 187 [Hindi] 16:19
- DSA in Python Course - Kth Largest Element in an Array | QuickSelect Algorithm | Part 188 38:29
- DSA in Python Course - Kth Largest Element in a Stream | Min Heap Design | Medium | Part 189 09:27
- Introduction to Dynamic Programming | Recursion, Memoization, Tabulation | Part 190 | DSA in Python 37:59
- Climbing Stairs | All 4 DP Approaches | Recursion to Optimal | Part 191 | DSA in Python Course 11:10
- DSA in Python - Frog Jump | All 4 DP Approaches | Recursion to Optimal | GFG Practice | Part 192 35:09
- DSA in Python - House Robber II | 4 DP Approaches | Circular Constraint | LeetCode Medium | Part 194 11:03
- DSA in Python - House Robber | All 4 DP Approaches | Recursion to Optimal | LC Medium | Part 193 29:40
- DSA in Python - Geek's Training | 2D DP on Activities | GFG Practice | Part 195 [Hindi] 50:42
- DSA in Python - Unique Paths II | Grid DP with Obstacles | LeetCode 63 | Part 197 [Hindi] 09:36
- DSA in Python - Unique Paths | 4 DP Approaches | LeetCode 62 | Part 196 [Hindi] 43:44
- DSA in Python - Minimum Path Sum | 4 Grid DP Approaches | LeetCode 64 | Part 198 [Hindi] 23:17
- DSA in Python - Minimum Path Sum in Triangular Grid | 4 DP Approaches | LeetCode 120 | Part 199 32:16
- DSA in Python - Minimum/Maximum Falling Path Sum | Grid DP Full Approaches | LeetCode 931 | Part 200 34:41
- DSA in Python - Cherry Pickup II | 3D DP for 2 Robots | LeetCode 1463 | Part 201 [Hindi] 37:32
- DSA in Python - Partition Equal Subset Sum | 1D DP on Subsequences | LeetCode 416 | Part 203 [Hindi] 06:20
- DSA in Python - Subset Sum Equal to Target | Pick/Not-Pick DP | GFG Practice | Part 202 [Hindi] 35:40
- DSA in Python - Partition Set Into 2 Subsets with Min Absolute Sum Difference | GFG | Part 204 21:19
- DSA in Python - Count Subsets with Sum K | Perfect Sum Problem | GFG Practice | Part 205 36:30
- DSA in Python - Count Partitions with Given Difference | Reduce to Subset Sum | GFG | Part 206 08:47
- DSA in Python - 0/1 Knapsack | 5 DP Approaches + Space-Optimized Tricks | GFG Practice | Part 207 37:41
- DSA in Python - Longest Common Subsequence (LCS) | 5 DP Variations + Space Optimization | Part 208 53:59
- DSA in Python - Print the Longest Common Subsequence | Build DP Table + Backtrack | Part 209 [Hindi] 18:58
- DSA in Python - Longest Common Substring | DP on Strings (Tabulation + Space Opt) | Part 210 [Hindi] 14:29
- DSA in Python - Longest Palindromic Subsequence (LPS) | LCS Trick + DP Variations | Part 211 [Hindi 09:19
- Minimum Insertion Steps to Make a String Palindrome | LPS Trick + Interval DP | Part 212 [Hindi] 11:43
- DSA in Python - Delete Operation for Two Strings | LCS-Based DP + Space Opt | Part 213 [Hindi] 09:31
- DSA in Python - Best Time to Buy and Sell Stock II | DP Intuition | LeetCode 122 | Part 214 [Hindi] 37:46
- DSA in Python - Best Time to Buy and Sell Stock III | At-Most Two Trades DP | Part 215 [Hindi] 32:32
- DSA in Python - Best Time to Buy and Sell Stock IV | At-Most K Trades DP (O(n·k)) | Part 216 [Hindi] 05:26
- DSA in Python - Remove Outermost Parentheses | Depth Counter Trick (O(n)) | Part 217 [Hindi] 11:46
- DSA in Python - Reverse Words in a String | Clean Split-Reverse-Join (O(n)) | Part 218 [Hindi] 07:44
- DSA in Python - Largest Odd Number in String | Greedy Right-to-Left Scan (O(n)) | Part 219 [Hindi] 06:55
- DSA in Python - Longest Common Prefix | Vertical Scan + Alternatives (O(N·M)) | Part 220 [Hindi] 17:12
- DSA in Python - Isomorphic Strings | Bidirectional Hash Maps (O(n)) | Part 221 [Hindi] 15:50
- DSA in Python - Rotate String | s+s Substring Trick (O(n)) | Part 222 [Hindi] 13:21
- DSA in Python - Valid Anagram | Hash Map vs Sorting (O(n) vs O(n log n)) | Part 223 [Hindi] 15:18
- Sort Characters By Frequency | Hash Map + Sort/Heap (O(n + k log k)) | Part 224 [Hindi] 11:32
- DSA in Python - Maximum Nesting Depth of the Parentheses | Depth Counter | Part 225 [Hindi] 10:21
- DSA in Python - Roman to Integer | Mapping + Subtraction Rule | LeetCode 13 | Part 226 [Hindi] 12:33
- DSA in Python - Implement Trie (Prefix Tree) | Insert, Search, startsWith | Part 227 [Hindi] 32:59
- DSA in Python - Implement Trie II | Insert, Count, and Erase Operations | Part 228 [Hindi] 20:57
- DSA in Python - Complete String | Trie Based Prefix Checking | Part 229 [Hindi] 22:08
- DSA in Python - Count Distinct Substrings | Brute Force vs Trie Approach | Naukri Code360 | Part 230 13:09
Take this course with you
Download the app to continue lessons from your phone anytime.
