Complete C++ DSA Course | Data Structures & Algorithms Playlist (Hindi) (Part 3)

   Friday, July 24, 2026   

Starting a new Lecture Notes Series on Complete C++ DSA Course | Data Structures & Algorithms Playlist

Youtube Lecture Playlist Credits 

Channel Name: Apna College

So Let Us Start to This Journey of Learning 

Complete C++ DSA Course | Data Structures & Algorithms Playlist By Lecture Notes together!

Lecture 97: Flatten Binary Tree to Linked List | DSA Series : L.95

Lecture 98: Binary Search Trees (BSTs) | DSA Series : L.96

Lecture 99: Sorted Array to Balanced BST | DSA Series : L.97

Lecture 100: Validate Binary Search Tree | DSA Series : L.98

Lecture 101: Min Distance between BST Nodes | DSA Series : L.99

Lecture 102: Kth Smallest in BST | DSA Series : L.100

Lecture 103: Lowest Common Ancestor in BST | DSA Series : L.101

Lecture 104: Construct BST from Preorder | DSA Series : L.102

Lecture 105: Merge Two Binary Search Trees | DSA Series : L.103

Lecture 106: Recover BST | DSA Series : L.104

Lecture 107: Largest BST in Binary Tree | DSA Series : L.105

Lecture 108: Populate Next Right Pointers in Each Node | DSA Series : L.106

Lecture 109: BST Iterator | DSA Series : L.107

Lecture 110: Inorder Predecessor & Successor in BST | DSA Series : L.108

Lecture 111: Introduction to Graphs | Data Structure & Algorithms

Lecture 112: BFS Traversal in Graphs | Data Structure & Algorithms

Lecture 113: DFS Traversal in Graphs | Data Structure & Algorithms

Lecture 114: Detect a Cycle in Undirected Graph using DFS | Data Structure & Algorithms

Lecture 115: Detect a Cycle in Undirected Graph using BFS | Data Structure & Algorithms

Lecture 116: Number of Islands | Connected Components in Matrix | Leetcode 200

Lecture 117: Rotting Oranges | Multi-source BFS | Leetcode 994

Lecture 118: Detect a Cycle in Directed Graph using DFS | Lecture 116

Lecture 119: Topological Sorting in Graph | using DFS | Lecture 117

Lecture 120: Course Schedule Problem | using Graph & Topological Sort

Lecture 121: Course Schedule II Problem | using Graph & Topological Sort

Lecture 122: Flood Fill Algorithm | Graph Problem

Lecture 123: Topological Sorting using Kahn's Algorithm | Graph - DSA Lecture 121

Lecture 124: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

Lecture 125: Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming

Lecture 126: DSA Series Quick Update - 125 lectures | New DSA Sheet | DP, Heaps, Tries etc

Lecture 127: Prim's Algorithm - Minimum Spanning Tree in Graph

Lecture 128: Disjoint Set Union | With Rank/Size & Path Compression | Union Find

Lecture 129: Kruskal's Algorithm - Minimum Spanning Tree in Graph

Lecture 130: Number of Provinces | Graph Problem

Lecture 131: Min Cost to Connect All Points | Graph Problem

Lecture 132: Cheapest Flights Within K Stops | Graph Problem

Lecture 133: Bridge in Graph using Tarjan's Algorithm | Critical Connections

Lecture 134: Articulation Point in Graph using Tarjan's Algorithm | Critical Points

Lecture 135: Strongly Connected Components - Kosaraju's Algorithm | Graphs

Lecture 136: Floyd Warshall Algorithm | All Pairs Shortest Path in Graph

Lecture 137: Complete Dynamic Programming | DP Series - Lecture 1

Lecture 138: DP 2. Climbing Stairs | 1D Dynamic Programming

Lecture 139: DP 3. House Robber | 1D Dynamic Programming

Lecture 140: DP 4. House Robber II | 1D Dynamic Programming

Lecture 141: DP 5. Frog Jump | 1D Dynamic Programming

Lecture 142: DP 6. Min Cost Climbing Stairs | 1D Dynamic Programming

Lecture 143: Fractional Knapsack Algorithm | Greedy Method

Lecture 144: DP 8. 0/1 Knapsack | Recursion to DP Solution | Space Optimized