DSA Playlist in C++ (Hindi) (Part 2)

   Monday, February 24, 2025   

Starting a new Lecture Notes Series on DSA Playlist in C++

Youtube Lecture Playlist Credits 

Channel Name: Coder Army

So Let Us Start to This Journey of Learning 

DSA Playlist in C++ By Lecture Notes together!

Lecture 58: Lecture 58: Time Complexity and Space Complexity in Recursion

Lecture 59: Lecture 59: Merge Sort Algorithm

Lecture 60: Lecture 60: Quick Sort Algorithm

Lecture 61: Lecture 61: Recursion on Subsequence || Print All Subsequence || Generate Parentheses

Lecture 62: Lecture 62: Recursion on Subset Sum || Target Sum

Lecture 63: Lecture 63: Recursion Perfect Sum Problem || Target Sum with Repetition

Lecture 64: Lecture 64: Permutation of Arrays and Strings

Lecture 65: Lecture 65: Permutation with repetition || Ways to Sum N

Lecture 66: Lecture 66: Tower of Hanoi || Code part and Dry Run

Lecture 67: Lecture 67: Josephus Problem || Predict the winner

Lecture 68: Lecture 68: Recursion Rat in a Maze Problem

Lecture 69: Lecture 69: Print N-bit binary numbers having more 1s than 0s

Lecture 70: Lecture 70: Object Oriented Programming in C++

Lecture 71: Lecture 71: Constructor and Destructor in C++

Lecture 72: Lecture 72: Object Oriented Programming: Static data Member and Function | Encapsulation

Lecture 73: Lecture 73: Inheritance | Access Modifier | Real Life Example

Lecture 74: Lecture 74: Type of Inheritance in C++ | Single Inheritance | Multiple | Hybrid | Multipath

Lecture 75: Lecture 75: Polymorphism and Virtual Function in C++

Lecture 76: Lecture 76: Exception Handling in C++

Lecture 77: Lecture 77: File Handling in C++

Lecture 78: Lecture 78: Introduction To Linked List | Traversal and Insertion in a Linked List

Lecture 79: Lecture 79: Deletion in a Singly Linked List | Deletion in Constant Time

Lecture 80: Lecture 80: Reverse a Linked List | Middle of Linked List | Rotate Linked List

Lecture 81: Lecture 81: Linked List LeetCode Problem: Remove Every Kth Node | Rotate List | Palindrome List

Lecture 82: Lecture 82: Introduction to Doubly Linked List || Insertion and Deletion in Doubly Linked List

Lecture 83: Lecture 83: LinkedList Problems: Remove Duplicates | Merge 2 Sorted LinkedList | Sort a LinkedList

Lecture 84: Lecture 84: Circular Linked List: Detect Loop in Linked List || Find Length of Loop

Lecture 85: Lecture 85: Hard Problem: Detect and Remove Loop in LinkedList

Lecture 86: Lecture 86: Add two numbers represented by linked lists | Reverse a Linked List in groups

Lecture 87: Lecture 87: Hard Problem on Linked List: Flattening a Linked List | Merge K Sorted Linked List

Lecture 88: Lecture 88: LinkedList Series End Here: Clone a linked list with next and random pointer

Lecture 89: Coding Battles : Arrays vs. Linked Lists Showdown

Lecture 90: Lecture 89: Introduction To STACK || Implement Stack Using Arrays and LinkedList

Lecture 91: Lecture 90: STACK : Valid Parentheses | Print Bracket Number | Reverse Array | Get min at pop

Lecture 92: Lecture 91: Stack Problem: Next Greater Element | Next Smaller Element | Stock Span Problem

Lecture 93: Lecture 92: Stack Problem: Largest Rectangle in Histogram | Maximal Rectangle

Lecture 94: Lecture 93: The Celebrity Problem

Lecture 95: Lecture 94: Stack Hard: Maximum of minimum for every window Size | Get Minimum Element from Stack

Lecture 96: Lecture 95: Implement two stacks in an array | N Stack in an Array

Lecture 97: Lecture 96: Introduction To Queue || Implement Queue with Array and LinkedList || Circular Queue

Lecture 98: Lecture 97: Print all Elements in Queue | Implement Queue using Stack | Implement Stack using Queue

Lecture 99: Lecture 98: Queues with Sliding Window Problems

Lecture 100: Introduction to Deque and implementation

Lecture 101: Queue Hard: Sliding Window Maximum | Minimum Number of K Consecutive Bit Flips

Lecture 102: Introduction To Trees | Binary Tree in Data Structure

Lecture 103: Binary Tree in Data Structure | Binary Tree Traversal | How to Create Binary Tree | DSA

Lecture 104: Binary Tree Problems For Technical Interview | Size of Binary Tree | Height of Binary Tree

Lecture 105: Binary Tree Problems: Mirror Tree | Two Nodes are Cousins | Check for Balanced Tree | Spiral Form

Lecture 106: Binary Tree: Left View of Binary Tree | Right View of Binary Tree | Top View of Binary Tree

Lecture 107: Binary Tree: PreOrder Traversal Iterative | PostOrder Traversal Iterative | InOrder Traversal

Lecture 108: Binary Tree Problems: Construct Tree from Inorder & Preorder | Tree from Postorder and Inorder

Lecture 109: Binary Tree Traversal: Vertical Traversal of Binary Tree | Diagonal Traversal | Boundary Traversal

Lecture 110: Morris Traversal : Inorder Traversal | Flatten Binary Tree to LinkedList | Post Order | PreOrder

Lecture 111: Burning Tree || Maximum Path Sum between 2 Special Nodes