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

   Thursday, July 23, 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 49: Combination Sum Problem | Recursion & Backtracking

Lecture 50: Palindrome Partitioning Problem | Recursion & Backtracking

Lecture 51: Merge Sort Algorithm | Recursion & Backtracking

Lecture 52: One Major update & reaching 1000M views

Lecture 53: Quick Sort Algorithm - Lecture 51 of Complete DSA Placement Series

Lecture 54: Count Inversions Problem | Brute and Optimal

Lecture 55: KNIGHTS TOUR Problem - Backtracking | Leetcode 2596

Lecture 56: OOPs Tutorial in One Shot | Object Oriented Programming | in C++ Language | for Placement Interviews

Lecture 57: Introduction to Linked List | Data Structures & Algorithms

Lecture 58: Reverse a Linked List | DSA Series by ‪@shradhaKD‬

Lecture 59: Middle of a Linked List | DSA Series by ‪@shradhaKD‬

Lecture 60: Detect & Remove Cycle in Linked List | DSA Series by ‪@shradhaKD‬

Lecture 61: Merge Two Sorted Lists | DSA Series by ‪@shradhaKD‬

Lecture 62: Copy List with Random Pointer | DSA Series by ‪@shradhaKD‬

Lecture 63: Doubly Linked List Tutorial

Lecture 64: Circular Linked List in Data Structures

Lecture 65: Flatten a Doubly Linked List | Leetcode 430 | DSA Series by ‪@shradhaKD‬

Lecture 66: Reverse Nodes in K-Group | Linked List

Lecture 67: Swap Nodes in Pairs | Linked List

Lecture 68: Introduction to STACKS | Data Structures & Algorithms | Lecture 66

Lecture 69: Valid Parentheses | Stack | Lecture 67

Lecture 70: Stock Span Problem | Optimal Solution

Lecture 71: Next Greater Element | Optimal Solution & Code

Lecture 72: Previous Smaller Element | Optimal Solution & Code

Lecture 73: Design a Min Stack | Optimal Solution & Code

Lecture 74: Largest Rectangle in Histogram | Best Solution & Code

Lecture 75: L73. Next Greater Element - II | Stack & Queue

Lecture 76: L74. Trapping Rainwater Problem | Optimal Solution & Code

Lecture 77: L75. The Celebrity Problem | Stack & Queue

Lecture 78: L76. Implement LRU Cache | Linked List

Lecture 79: New Chapter : Queue Data Structure

Lecture 80: L78. Circular Queue in Data Strucuture

Lecture 81: L79. Implement Queue using Stack & Stack using Queue

Lecture 82: L80. First Unique Character in String | Easy - Leetcode387

Lecture 83: L81. Sliding Window Maximum | Queue

Lecture 84: L82. Gas Station | Greedy Approach | Leetcode 134

Lecture 85: Binary Trees in Data Structures | Tree Traversal | DSA Placement Series

Lecture 86: L.84 Height of a Binary Tree | Count of Nodes in a Binary Tree

Lecture 87: L.85 Identical Tree (same tree) | Subtree of another Tree

Lecture 88: L.86 Diameter of Binary Tree

Lecture 89: Top View of a Binary Tree | DSA Series : L.87

Lecture 90: Kth Level of a Binary Tree | DSA Series : L.88

Lecture 91: Lowest Common Ancestor in Binary Tree | DSA Series : L.89

Lecture 92: Build Tree from Preorder & Inorder | DSA Series : L.90

Lecture 93: Transform to Sum Tree | DSA Series : L.91

Lecture 94: Binary Tree Paths | DSA Series : L.92

Lecture 95: Maximum Width of Binary Tree | DSA Series : L.93

Lecture 96: Morris Inorder Traversal | DSA Series : L.94