FREE System Design Course Loading...

Time to Level UP Your Development Journey

House Robber | House Robber 2

Count number of hops | Min Cost Climbing Stairs

Climbing Stairs | Dynamic Programming

Introduction To Dynamic Programming

Launching Live WEB Development and WEB3 Course | NEXUS

Hashing in Data Structure | Zero To Advance Level

Launching Free Dynamic Programming , Trie and Segment Tree Course

Greedy Algorithm From Basic To Advance

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

Strongly Connected Components | Kosaraju Algorithm | Tarjan Algorithm

Hamiltonian Path | Hamiltonian Cycle

Articulation Point in a Graph | Tarjan's Algorithm

SHOWTIME

Bridge in a Graph | Critical Connections in a Network

Kruskal's Algorithm | Disjoint set

Minimum Spanning Tree | Prim’s Algorithm

Circle of Strings

Euler Path and Euler Circuit in a Graph

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

Floyd Warshall Algorithm | MultiSource Shortest Path Algorithm

Why I am Not Uploading DSA Video

Bellman-Ford Algorithm | Distance from the Source

Shortest Path in Weighted undirected graph

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

Graphs: Shortest Path in Directed Acyclic Graph

Graph: Shortest Path in Undirected Graph

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

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

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

Detect Cycle in a Directed Graph | BFS + DFS

Topological Sort | Kahn's Algorithm

Detect Cycle in an Undirected Graph | BFS + DFS

BFS Traversal in Graph | DFS Traversal in Graph

Graph Representation in Data Structure | Adjacency Matrix and Adjacency List

Graph Data Structure | Real world Example to Explain Graph

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

Sliding Window: Minimum Size Subarray Sum | Minimum Window Substring

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

Sliding Window: Zero Sum Subarrays | Subarray Sum Equals K

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

I Am BACK

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

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

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

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

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

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

Heap Data Structure | Insertion and Deletion in Max Heap

STL in C++

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

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

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

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

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

Binary Search Tree Problems for Coding Round

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

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

Burning Tree || Maximum Path Sum between 2 Special Nodes