DSA Playlist in C++

Lecture 01: Introduction To Programming for Beginners

Lecture 02: Introduction to FlowCharts and PseudoCode in Programming

Lecture 03: Start C++ from Zero and Write Your First Program

Lecture 04: If Else Statement in c++ || Loop in C++

Lecture 05: For Loop in c++ Advance || Prime Number || Factorial || Fibonacci || Sum of n number

Lecture 06: Solve Any Pattern Problem With Simple Trick Part-1

Lecture 07: Solve Any Pattern Problem with Simple Trick Part-2

Lecture 08: Solve HARD Pattern Print Problem with Simple Trick

Lecture 09: Top 5 Advance Pattern Print Problems

Lecture 10: Operators in C++ with implementation

Lecture 11: While and Do while Loop || Switch || break || Continue in C++

Lecture 12: Binary To Decimal || Decimal To Binary || Decimal To Octal || Binary To Octal Conversion

Lecture 13: Write Your First Program On LeetCode

Lecture 14: Functions in C++ || Pass by Value || Pass by Reference

C++ Series Problem Solving

Introduction To Arrays in C++

Lecture 17: Master Arrays By Solving Problems

Lecture 18: Time and Space Complexity From Zero To Advance

Lecture 19: SELECTION SORT Algorithm with Theory and Code

Lecture 20: Bubble Sort with Theory and Code

Lecture 21: Insertion Sort with Theory and Code

Lecture 22: Binary Search with Theory and Code

Lecture 23: Binary Search Different Problem || Search Insert Position || Sqrt(x) || Count occurrence

Lecture 24: Search in a Rotated Array | Peak index in a Mountain Array | Kth Missing Positive Number

Lecture 25: Binary Search Top Interview Problem | Book Allocation | Painter Partition | Ship Package

Lecture 26: Binary Search Hard Interview Problem || Aggressive Cow || KOKO Eating Banana

Lecture 27: What is STL || Vector in C++

Lecture 28: Two Pointer in C++ | TWO SUM | Pair Sum | Pair Difference | Move 0 to end

Lecture 29: Kadane's Algorithm || Prefix and Suffix Sum || Array into 2 equal Sum Subarray

Lecture 30: Trapping Rain Water || 3 SUM || 4 SUM

Lecture 31: Introduction To 2D Arrays in C++

Lecture 32: 2D Arrays Interview Problems || Wave Form || Spiral Form || Transpose Matrix

Lecture 33: Rotate Image | Rotate by 90 degree | Rotate Matrix Element Clockwise |Rotate Matrix 180

Lecture 34: Binary Search in 2D Arrays || Search in a sorted row-col wise Matrix

Lecture 35: Majority Elements || Count Frequency of element | Find Missing and Repeating elements

Introductions To STRINGS in C++

String Interviews Problem Solving || Sort a String

Lecture 38: Longest Palindrome || Sorting the Sentence

Lecture 39: Strings Interview Problems on LeetCode || Add Strings || Sort Vowels in a String

Lecture 40: Factorial of Large Number || Integer to Roman || Roman to Integer

Lecture 41: Sliding Window Protocol on Strings

Lecture 42: KMP Algorithm || Longest Prefix Suffix

Lecture 43: String Matching || KMP Algorithm

Lecture 44: Strings HARD Problems For Coding Round

Pointers in C++ || Introduction to Pointers in C+

Pointers Relationship with array || Arithmetic Pointers

Lecture 47: Pointers with Character Arrays and Functions

Lecture 48: Double Pointer and Multiple Pointers in C++

Lecture 49: Memory Management || Static vs Dynamic Memory Allocation

Lecture 50: Dynamic Memory Allocation of 2D and 3D Arrays in C++

Lecture 51: Introduction To Recursion From Basic To Advance

Lecture 52: How To Solve Recursion Problem from 4 different Method

Lecture 53: Recursion: Factorial of a Number | Sum of N numbers | Power of number | Sum of Square

Lecture 54: Recursion Problems on Leetcode

Lecture 55: Recursion in Arrays

Lecture 56: Recursion in Strings

Lecture 57: Recursion in Binary Search

Lecture 58: Time Complexity and Space Complexity in Recursion

Lecture 59: Merge Sort Algorithm

Lecture 60: Quick Sort Algorithm

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

Lecture 62: Recursion on Subset Sum || Target Sum

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

Lecture 64: Permutation of Arrays and Strings

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

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

Lecture 67: Josephus Problem || Predict the winner

Lecture 68: Recursion Rat in a Maze Problem

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

Lecture 70: Object Oriented Programming in C++

Lecture 71: Constructor and Destructor in C++

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

Lecture 73: Inheritance | Access Modifier | Real Life Example

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

Lecture 75: Polymorphism and Virtual Function in C++

Lecture 76: Exception Handling in C++

Lecture 77: File Handling in C++

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

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

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

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

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

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

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

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

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

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

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

Coding Battles : Arrays vs. Linked Lists Showdown

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

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

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

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

Lecture 93: The Celebrity Problem

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

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

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

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

Lecture 98: Queues with Sliding Window Problems

Introduction to Deque and implementation

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

Introduction To Trees | Binary Tree in Data Structure

Binary Tree in Data Structure | Binary Tree Traversal | How to Create Binary Tree | DSA

Binary Tree Problems For Technical Interview | Size of Binary Tree | Height of Binary Tree

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

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

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

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

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

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

Burning Tree || Maximum Path Sum between 2 Special Nodes

Binary Search Tree in Data Structure || Implementation, Insertion , Deletion and Search

Binary Search Tree Interview Problem | 5 Binary Search Tree Problems in One Shot

Binary Search Tree Problems for Coding Round

Binary Search Tree: LCA of BST | Find Common Nodes in 2 BST | Check whether BST contains Dead End

Binary Search Tree: Fixing Two nodes of a BST | Sorted Link List to BST | Merge two BST

Largest Binary Search Tree | Maximum Sum BST in Binary Tree | Leetcode

AVL Tree in Data Structure | AVL Tree Insertion | AVL Tree Search | AVL Tree Rotation

AVL Tree Deletion | (Theory + Dry Run + Code Implementation)

STL in C++

Heap Data Structure | Insertion and Deletion in Max Heap

Heap Sort | Build Heap in C++ | Priority Queue

Heap 6 Interview Problem | Height of Heap | Minimum Cost of ropes | Magician and Chocolates

Kth smallest element in an array | Kth Largest element in an array | Heap | Priority Queue

Merge two binary Max heaps | Is Binary Tree Heap | BST to max heap

Heap Hard Problem: Kth element in Matrix (5 Approaches) | Find median in a stream

Heap Interview Problem: Merge K Sorted Linked List | Merge K Sorted Arrays

Heap: Smallest Range Covering Elements from K Lists | Construct Target Array With Multiple Sums

Sliding Window: Zero Sum Subarrays | Subarray Sum Equals K

Sliding Window: Subarray Sums Divisible by K | Subarray Product Less Than K

Sliding Window: Minimum Size Subarray Sum | Minimum Window Substring

Subarrays with K Different Integers | Count Subarrays Where Max Element Appears at Least K Times

Graph Data Structure | Real world Example to Explain Graph

Graph Representation in Data Structure | Adjacency Matrix and Adjacency List

BFS Traversal in Graph | DFS Traversal in Graph

Detect Cycle in an Undirected Graph | BFS + DFS

Topological Sort | Kahn's Algorithm

Detect Cycle in a Directed Graph | BFS + DFS

Bipartite Graph | BFS + DFS + Code + Real Life application

Graphs: Covid Spread | Find the number of Islands | Replace O's with X's

Graphs: Alien Dictionary | Parallel Courses 3 | Course Schedule | Prerequisite Tasks

Graph: Shortest Path in Undirected Graph

Graphs: Shortest Path in Directed Acyclic Graph

Dijkstra Algorithm | Intuition + Code + Dry Run + 2 Methods

Shortest Path in Weighted undirected graph

Bellman-Ford Algorithm | Distance from the Source

Floyd Warshall Algorithm | MultiSource Shortest Path Algorithm

Graphs: Knight Walk | Shortest Source to Destination Path in Binary Matrix | Find whether path exist

Euler Path and Euler Circuit in a Graph

Circle of Strings

Minimum Spanning Tree | Prim’s Algorithm

Kruskal's Algorithm | Disjoint set

Bridge in a Graph | Critical Connections in a Network

Articulation Point in a Graph | Tarjan's Algorithm

Hamiltonian Path | Hamiltonian Cycle

Strongly Connected Components | Kosaraju Algorithm | Tarjan Algorithm

BackTracking: N-Queens | M-Coloring Problem | Sudoku Solver

Greedy Algorithm From Basic To Advance

Hashing in Data Structure | Zero To Advance Level

Introduction To Dynamic Programming

Climbing Stairs | Dynamic Programming

Count number of hops | Min Cost Climbing Stairs

House Robber | House Robber 2