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

     
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 112: Binary Search Tree in Data Structure || Implementation, Insertion , Deletion and Search
Lecture 113: Binary Search Tree Interview Problem | 5 Binary Search Tree Problems in One Shot
Lecture 114: Binary Search Tree Problems for Coding Round
Lecture 115: Binary Search Tree: LCA of BST | Find Common Nodes in 2 BST | Check whether BST contains Dead End
Lecture 116: Binary Search Tree: Fixing Two nodes of a BST | Sorted Link List to BST | Merge two BST
Lecture 117: Largest Binary Search Tree | Maximum Sum BST in Binary Tree | Leetcode
Lecture 118: AVL Tree in Data Structure | AVL Tree Insertion | AVL Tree Search | AVL Tree Rotation
Lecture 119: AVL Tree Deletion | (Theory + Dry Run + Code Implementation)
Lecture 120: STL in C++
Lecture 121: Heap Data Structure | Insertion and Deletion in Max Heap
Lecture 122: Heap Sort | Build Heap in C++ | Priority Queue
Lecture 123: Heap 6 Interview Problem | Height of Heap | Minimum Cost of ropes | Magician and Chocolates
Lecture 124: Kth smallest element in an array | Kth Largest element in an array | Heap | Priority Queue
Lecture 125: Merge two binary Max heaps | Is Binary Tree Heap | BST to max heap
Lecture 126: Heap Hard Problem: Kth element in Matrix (5 Approaches) | Find median in a stream
Lecture 127: Heap Interview Problem: Merge K Sorted Linked List | Merge K Sorted Arrays
Lecture 128: Heap: Smallest Range Covering Elements from K Lists | Construct Target Array With Multiple Sums
Lecture 129: Sliding Window: Zero Sum Subarrays | Subarray Sum Equals K
Lecture 130: Sliding Window: Subarray Sums Divisible by K | Subarray Product Less Than K
Lecture 131: Sliding Window: Minimum Size Subarray Sum | Minimum Window Substring
Lecture 132: Subarrays with K Different Integers | Count Subarrays Where Max Element Appears at Least K Times
Lecture 133: Graph Data Structure | Real world Example to Explain Graph
Lecture 134: Graph Representation in Data Structure | Adjacency Matrix and Adjacency List
Lecture 135: BFS Traversal in Graph | DFS Traversal in Graph
Lecture 136: Detect Cycle in an Undirected Graph | BFS + DFS
Lecture 137: Topological Sort | Kahn's Algorithm
Lecture 138: Detect Cycle in a Directed Graph | BFS + DFS
Lecture 139: Bipartite Graph | BFS + DFS + Code + Real Life application
Lecture 140: Graphs: Covid Spread | Find the number of Islands | Replace O's with X's
Lecture 141: Graphs: Alien Dictionary | Parallel Courses 3 | Course Schedule | Prerequisite Tasks
Lecture 142: Graph: Shortest Path in Undirected Graph
Lecture 143: Graphs: Shortest Path in Directed Acyclic Graph
Lecture 144: Dijkstra Algorithm | Intuition + Code + Dry Run + 2 Methods
Lecture 145: Shortest Path in Weighted undirected graph
Lecture 146: Bellman-Ford Algorithm | Distance from the Source
Lecture 147: Floyd Warshall Algorithm | MultiSource Shortest Path Algorithm
Lecture 148: Graphs: Knight Walk | Shortest Source to Destination Path in Binary Matrix | Find whether path exist
Lecture 149: Euler Path and Euler Circuit in a Graph
Lecture 150: Circle of Strings
Lecture 151: Minimum Spanning Tree | Prim’s Algorithm
Lecture 152: Kruskal's Algorithm | Disjoint set
Lecture 153: Bridge in a Graph | Critical Connections in a Network
Lecture 154: Articulation Point in a Graph | Tarjan's Algorithm
Lecture 155: Hamiltonian Path | Hamiltonian Cycle
Lecture 156: Strongly Connected Components | Kosaraju Algorithm | Tarjan Algorithm
Lecture 157: BackTracking: N-Queens | M-Coloring Problem | Sudoku Solver
Lecture 158: Greedy Algorithm From Basic To Advance
Lecture 159: Hashing in Data Structure | Zero To Advance Level
Lecture 160: Introduction To Dynamic Programming
Pinterest
More
Less
Tumblr
Mix
GMail
LinkedIn
Reddit
XING
WhatsApp
Hacker News
VK
Telegram
Line
Related Posts