08:45

Time to Level UP Your Development Journey

01:14:12

House Robber | House Robber 2

01:20:00

Count number of hops | Min Cost Climbing Stairs

01:10:52

Climbing Stairs | Dynamic Programming

01:05:12

Introduction To Dynamic Programming

11:10

Launching Live WEB Development and WEB3 Course | NEXUS

01:27:05

Hashing in Data Structure | Zero To Advance Level

08:33

Launching Free Dynamic Programming , Trie and Segment Tree Course

04:26:18

Greedy Algorithm From Basic To Advance

02:34:01

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

02:03:51

Strongly Connected Components | Kosaraju Algorithm | Tarjan Algorithm

35:44

Hamiltonian Path | Hamiltonian Cycle

01:10:44

Articulation Point in a Graph | Tarjan's Algorithm

06:22

SHOWTIME

01:31:09

Bridge in a Graph | Critical Connections in a Network

01:26:55

Kruskal's Algorithm | Disjoint set

01:04:48

Minimum Spanning Tree | Prim’s Algorithm

54:13

Circle of Strings

01:07:45

Euler Path and Euler Circuit in a Graph

01:11:50

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

01:09:57

Floyd Warshall Algorithm | MultiSource Shortest Path Algorithm

14:03

Why I am Not Uploading DSA Video

01:09:30

Bellman-Ford Algorithm | Distance from the Source

36:08

Shortest Path in Weighted undirected graph

01:40:34

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

01:03:18

Graphs: Shortest Path in Directed Acyclic Graph

56:21

Graph: Shortest Path in Undirected Graph

01:24:16

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

01:49:42

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

01:13:28

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

01:16:24

Detect Cycle in a Directed Graph | BFS + DFS

54:59

Topological Sort | Kahn's Algorithm

01:11:45

Detect Cycle in an Undirected Graph | BFS + DFS

01:19:17

BFS Traversal in Graph | DFS Traversal in Graph

01:02:45

Graph Representation in Data Structure | Adjacency Matrix and Adjacency List

47:53

Graph Data Structure | Real world Example to Explain Graph

01:24:56

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

01:11:30

Sliding Window: Minimum Size Subarray Sum | Minimum Window Substring

01:09:15

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

01:00:55

Sliding Window: Zero Sum Subarrays | Subarray Sum Equals K

01:30:28

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

04:00

I Am BACK

01:28:49

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

01:18:58

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

55:15

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

01:08:18

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

01:22:08

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

01:19:47

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

01:15:24

Heap Data Structure | Insertion and Deletion in Max Heap

01:52:30

STL in C++

54:58

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

01:38:20

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

01:19:24

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

01:30:21

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

01:03:06

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

01:28:53

Binary Search Tree Problems for Coding Round

01:25:18

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

01:28:26

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

01:27:12

Burning Tree || Maximum Path Sum between 2 Special Nodes

01:00:26

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