Guest
& Queue Problems\ 5:21 First Non-Repeating Letter 12:28 First Non-Repeating Code 17:02 Max Subarray (Sliding Window Deque) 41:54 Simplify Path 50:59 Simplify Path Code Trees Problems\ 1:12:12 Binary Trees Recap 1:21:16 Build Tree - Boilerplate Code 1:27:40 Level Order Print 1:36:59 Level Order Print Code 1:43:14 Level Order Build 1:49:46 Level Order Build Code 1:54:30 Tree Diameter Concept 2:03:45 Tree Diameter Code 2:06:29 Tree Diameter Optimised Code 2:17:42 Replace with Descendant Sum 2:25:14 Replace with Descendant Sum Code 2:29:38 Height of Tree 2:32:54 Height Balanced Tree Concept 2:40:41 Height Balanced Tree Code 2:47:33 Max Subset Sum Tree 2:57:35 Max Subset Sum Tree Code 3:01:03 Print At LevelK 3:02:21 Nodes at Distance K 3:17:20 Nodes at Distance K Code 3:27:11 Vertical Order Print 3:32:08 Vertical Order Print Code Problems\ 3:38:55 BST Introduction 3:46:17 BST Creation Recap 3:54:07 Minimum Height BST 3:57:42 Closest in BST 4:00:36 Closest in BST Code 4:04:54 Tree to Linked List 4:15:56 Tree 2 Linked List Code 4:23:59 Inorder Successor in BST 4:29:35 Inorder Successor in BST Code Queue Problems\ 4:35:54 Heaps - Recap! 4:39:32 Sorting using Heap! 4:44:54 Finding Cabs 4:53:05 Finding Cabs Implementation 5:04:51 Merging Ropes 5:11:44 Merging Ropes Implementation 5:14:05 Running Median 5:25:51 Running Median Implementation 5:32:35 Merging K-Arrays 5:40:18 Merge K-Sorted Arrays Code Problems\ 5:47:58 Triplets in GP Hashing with Slider 6:05:37 Triplets in GP Implementation 6:12:16 Counting Rectangles Sets 6:22:33 Counting Rectangles Implementation 6:33:47 Counting Triangles Unordered Maps 6:44:22 Counting Triangles Implementation 6:50:22 Anagrams in Substrings Maps 7:05:01 Anagrams in Substrings Implementation 7:13:41 Quick Brown Fox Hashing with DP 7:25:24 Quick Brown Fox Implementation & Pattern Matching Problems\ 7:41:06 Tries Introduction 7:56:22 Prefix Trie Implementation 8:08:33 Suffix Trie 8:12:11 Suffix Trie Implementation 8:16:25 Cute Little Cat (Trie Hashing) 8:28:31 Cute Little Cat Implementation 8:41:29 Biggest XOR (Trie Bitmasks) 8:55:05 Biggest XOR Implementation Problem Solving\ 9:10:02 Graphs Section Introduction 9:12:13 Graphs 10 Cool Applications 9:18:01 Graph Key Terms 9:27:09 Adjacency List Representation 9:35:51 Adjacency List Representation with Node Class 9:44:59 Breadth First Search (BFS) 9:51:42 BFS Code 9:58:58 Shortest Path using BFS 10:03:29 Shortest Path using BFS Code 10:09:39 Solution - Snakes & Ladders 10:18:04 Depth First Search (DFS) 10:22:22 DFS Code 10:28:03 Cycle Detection in Undirected Graphs 10:31:37 Solution - Cycle Detection in Undirected Graph 10:40:36 Backedge Detection 10:49:31 Solution - Cycle Detection in Directed Graph 11:02:18 Dijkshtra’s Algorithm 11:11:30 Dijkshtra’s Algorithm Code 11:26:24 Board Game (Trie Backtracking Graph) 11:38:36 Board Game Implementation 11:58:06 Solution - Shortest Grid Path
