27 - Graphs/006 Graph in Java using Adjacency Matrix.mp4 63.5 MB
17 - Queue/004 Dequeue, Peek and Delete Methods using Linear Queue Array.mp4 62.7 MB
28 - Graph Traversal - Breadth First Search and Depth First Search Algorithms/002 Breadth First Search Algorithm (BFS) in Java - Adjacency Matrix.mp4 62.3 MB
17 - Queue/013 Dequeue, Peek and Delete Methods in Queue using Linked List.mp4 62.1 MB
28 - Graph Traversal - Breadth First Search and Depth First Search Algorithms/007 Depth First Search (DFS) Algorithm in Java - Adjacency Matrix.mp4 41.3 MB
03 - Cracking Recursion Interview Questions/001 Question 1 - Sum of Digits.mp4 41.3 MB
23 - Trie/001 What is a Trie Why we need Trie.mp4 41.3 MB
11 - Linked List/011 Deletion of a Node from Singly Linked List.mp4 41.2 MB
30 - Single Source Shortest Path Problem (SSSPP)/004 BFS for SSSPP in Java using Adjacency Matrix.mp4 41.2 MB
43 - Backtracking/002 What is Backtracking.mp4 40.6 MB
28 - Graph Traversal - Breadth First Search and Depth First Search Algorithms/001 Breadth First Search Algorithm (BFS).mp4 40.6 MB
28 - Graph Traversal - Breadth First Search and Depth First Search Algorithms/003 Breadth First Search Algorithm (BFS) in Java - Adjacency List.mp4 38.7 MB
28 - Graph Traversal - Breadth First Search and Depth First Search Algorithms/006 Depth First Search (DFS) Algorithm in Java - Adjacency List.mp4 34.5 MB
17 - Queue/004 Dequeue, Peek and Delete Methods using Linear Queue Array_en.vtt 15.9 kB
28 - Graph Traversal - Breadth First Search and Depth First Search Algorithms/002 Breadth First Search Algorithm (BFS) in Java - Adjacency Matrix_en.vtt 15.9 kB
39 - Divide and Conquer Algorithms/012 Longest Common Subsequence Problem_en.vtt 9.1 kB
28 - Graph Traversal - Breadth First Search and Depth First Search Algorithms/003 Breadth First Search Algorithm (BFS) in Java - Adjacency List_en.vtt 9.0 kB
19 - Tree Binary Tree/026 Array vs Linked List in Binary Tree Implementation_en.vtt 9.0 kB
39 - Divide and Conquer Algorithms/007 House Robber in Java_en.vtt 8.9 kB
17 - Queue/001 What is a Queue_en.vtt 8.9 kB
28 - Graph Traversal - Breadth First Search and Depth First Search Algorithms/007 Depth First Search (DFS) Algorithm in Java - Adjacency Matrix_en.vtt 8.8 kB
28 - Graph Traversal - Breadth First Search and Depth First Search Algorithms/006 Depth First Search (DFS) Algorithm in Java - Adjacency List_en.vtt 8.8 kB
19 - Tree Binary Tree/022 levelOrder Traversal Binary Tree (Array)_en.vtt 8.8 kB
39 - Divide and Conquer Algorithms/008 Convert One String to Another_en.vtt 8.7 kB
20 - Binary Search Tree/001 What is a Binary Search Tree Why do we need it_en.vtt 4.9 kB
11 - Linked List/006 Insertion in Singly Linked List in Memory_en.vtt 4.9 kB
32 - Bellman Ford Algorithm/003 Why Bellman Ford runs V-1 times_en.vtt 4.9 kB
01 - Introduction/002 What is a data structure_en.vtt 4.8 kB
17 - Queue/014 Time and Space Complexity of Queue using Linked List_en.vtt 4.8 kB
19 - Tree Binary Tree/025 Delete Binary Tree (Array)_en.vtt 4.8 kB
01 - Introduction/005 Types of Data Structures_en.vtt 4.7 kB
02 - Recursion/003 Why do we need Recursion_en.vtt 4.7 kB
21 - AVL Tree/014 Time and Space Complexity of AVL_en.vtt 4.7 kB
36 - Kruskal and Prim's Algorithms/005 Kruskal vs Prim's Algorithms_en.vtt 4.6 kB
29 - Topological Sort/005 Time and Space Complexity of Topological Sort_en.vtt 4.6 kB
30 - Single Source Shortest Path Problem (SSSPP)/006 Why does BFS not work with Weighted Graph_en.vtt 4.6 kB
06 - Cracking Big O Interview Questions/007 Question 7 - Equivalent to O(N)_en.vtt 4.6 kB
28 - Graph Traversal - Breadth First Search and Depth First Search Algorithms/004 Time Complexity of Breadth First Search (BFS) Algorithm_en.vtt 4.5 kB
05 - Big O Notation/001 What is Big O_en.vtt 4.4 kB
19 - Tree Binary Tree/32569036-BinaryTreeLL.java 4.4 kB
32 - Bellman Ford Algorithm/005 BFS vs Dijkstra vs Bellman Ford_en.vtt 4.4 kB
19 - Tree Binary Tree/005 What is A Binary Tree_en.vtt 4.3 kB