C++ Full Course | C++ Tutorial | Data Structures & Algorithms (Hindi) (Part 3)

   Thursday, July 16, 2026   

Starting a new Lecture Notes Series on C++ Full Course | C++ Tutorial | Data Structures & Algorithms

Youtube Lecture Playlist Credits 

Channel Name: ScoreShala

So Let Us Start to This Journey of Learning 

C++ Full Course | C++ Tutorial | Data Structures & Algorithms By Lecture Notes together!

Lecture 103: Stacking using Queues (Method 2) | C++ Placement Course | Lecture 24.4.2

Lecture 104: Sliding Window Maximum using Deque | C++ Placement Course | Lecture 25.1

Lecture 105: Largest Rectangle Code | C++ Placement Course | Lecture 25.2

Lecture 106: Trapping Rainwater | C++ Placement Course | Lecture 25.3

Lecture 107: Redundant Parenthesis | C++ Placement Course | Lecture 25.4

Lecture 108: The Stock Span Problem | C++ Placement Course | Lecture 25.5

Lecture 109: Two Pointers | Three Sum Problem | C++ Placement Course | Lecture 26.1

Lecture 110: Max Consecutive Ones | C++ Placement Course | Lecture 26.2

Lecture 111: Longest substring without repeating characters | C++ Placement Course | Lecture 26.3

Lecture 112: Binary Tree Introduction | C++ Placement Course | Lecture 27.1

Lecture 113: Binary Tree Traversals| Preorder, Inorder, Postorder Traversal | C++ Placement Course | Lecture 27.2

Lecture 114: Build Tree from Preorder and Inorder | C++ Placement Course | Lecture 27.3

Lecture 115: Build Tree Postorder and Inorder | C++ Placement Course | Lecture 27.4

Lecture 116: Level Order Traversal , Sum at Kth Level In Binary Tree | C++ Placement Course | Lecture 27.5

Lecture 117: Count and Sum of Nodes | C++ Placement Course | Lecture 27.6

Lecture 118: Height and Diameter in Binary Tree | C++ Placement Course | Lecture 27.7

Lecture 119: Sum Replacement in Binary Tree | C++ Placement Course | Lecture 27.8

Lecture 120: Height Balanced Binary Tree | C++ Placement Course | Lecture 27.9

Lecture 121: Right View of Binary Tree | C++ Placement Course | Lecture 27.10

Lecture 122: Left View of Binary Trees | C++ Placement Course | Lecture 27.11

Lecture 123: Shortest Distance between 2 Nodes | C++ Placement Course | Lecture 27.12

Lecture 124: Flatten a Binary Tree | C++ Placement Course | Lecture 27.13

Lecture 125: Nodes at Distance K in Binary Tree | C++ Placement Course | Lecture 27.14

Lecture 126: Lowest Common Ancestor in Binary Tree | C++ Placement Course | Lecture 27.15

Lecture 127: Max Sum Path from One Node to Another in Binary Tree | C++ Placement Course | Lecture 27.16

Lecture 128: Binary Search Trees | Introduction & Build | C++ Placement Course | Lecture 28.1

Lecture 129: Search and Delete in Binary Search Tree | C++ Placement Course | Lecture 28.2

Lecture 130: Construct Binary Search Tree from Preorder | C++ Placement Course | Lecture 28.3

Lecture 131: Check for Binary Search Tree | C++ Placement Course | Lecture 28.4

Lecture 132: Build Balanced BST from Sorted Array | C++ Placement Course | Lecture 28.5

Lecture 133: Catalan Numbers Application | C++ Placement Course | Lecture 28.6

Lecture 134: Zig Zag Traversal Binary Search Tree | C++ Placement Course | Lecture 28.7

Lecture 135: Identical Binary Search Tree | C++ Placement Course | Lecture 28.8

Lecture 136: Largest Binary Search Tree in BT | C++ Placement Course | Lecture 28.10

Lecture 137: Recover Binary Search Tree | C++ Placement Course | Lecture 28.11

Lecture 138: Set & Multiset | Standard Template Library | C++ Placement Course | Lecture 28.12

Lecture 139: Place Elements to Maximise Minimum Distance | C++ Placement Course | Lecture 29.1

Lecture 140: Page Allocation Problem | C++ Placement Course | Lecture 29.2

Lecture 141: Painters Partition Problem | C++ Placement Course | Lecture 29.3

Lecture 142: Search in Sorted & Rotated Array | C++ Placement Course | Lecture 29.4

Lecture 143: Find the Peak Element | C++ Placement Course | Lecture 29.5

Lecture 144: Max Sum Subarray | Sliding Window Challenge | C++ Placement Course | Lecture 30.1

Lecture 145: Minimum Subarray Size | Sliding Window Challenge | C++ Placement Course | Lecture 30.2

Lecture 146: Form Number Divisible by 3 | Sliding Window Challenge | C++ Placement Course | Lecture 30.3

Lecture 147: Subarray with Palindromic Concatenation | C++ Placement Course | Lecture 30.4

Lecture 148: Perfect Numbers in Subarrays | C++ Placement Course | Lecture 30.5

Lecture 149: Heap Intro Final Export for Upload

Lecture 150: HeapsSort | C++ Placement Course | Lecture 31.2