Guest
#25-Network Time Delay (Medium)\ 2:05 Coding Our Solution With Dijkstra 19:38 Time And Space Complexity Of Our Solution 32:46 Thinking About Negative Weights 40:28 What is The Bellman-Ford Algorithm-Conceptualizing Dynamic Programming 56:50 What is The Bellman-Ford Algorithm-The Algorithm Itself 1:13:07 Coding Our Solution With Bellman-Ford Programming-Question #26-Minimum Cost Of Climbing Stairs (Easy)\ 1:22:27 Question #26-Minimum Cost Of Climbing Stairs & How To Approach DP 1:32:05 Understanding & Identifying Recurrence Relation 1:47:54 First Step-Recursive Solution From Recurrence Relation 1:53:28 Second Step-Memoizing Our Redundant Recursive Calls 2:01:17 Coding Our Memoization Optimization 2:09:08 Understanding The Bottom Up Approach (Tabulation) 2:15:38 Third Step-Bottom Up Tabulation 2:21:03 Fourth Step-Bottom Up Optimization Programming-Question #27-Knight Probability In Chessboard (Medium)\ 2:27:55 Question #27-Knight Probability In Chessboard 2:38:04 Thinking About Test Cases To Help Us 2:41:56 Identifying The Recurrence Relation 2:57:26 First Step-Recursive Solution From Recurrence Relation 3:02:36 Second Step-Memoizing Our Redundant Recursive Calls 3:16:49 Figuring Out The Logic For Our Bottom Up Solution 3:30:49 Third Step-Bottom Up Tabulation 3:39:20 Fourth Step-Bottom Up Optimization #28-Sudoku Solver (Hard)\ 3:46:16 Understanding The Basics Of Backtracking 3:53:22 Question #28-Sudoku Solver 3:57:42 Learning The Backtracking Template 4:09:00 Applying Our Backtracking Template To Sudoku Solver Logic 4:15:43 Coding How To Get Box ID 4:23:32 Setting Up Our Solution Code 4:30:37 Coding The Recursive Backtracking Portion Of Our Solution 4:49:56 Thinking About The Space And Time Complexity Design-Question #29-Monarchy\ 4:56:55 Understanding Interface Design & Question #29-Monarchy 5:07:47 Figuring Out Our Test Cases 5:13:45 Thinking About The Logical Of The Monarchy 5:23:26 Coding Our Monarchy Solution #30-Implement Prefix Trie (Medium)\ 5:38:24 Introducing Tries 5:39:32 Question #30-Implement Prefix Trie 5:49:22 Understanding The Logic For Our Methods 5:53:16 Implementing Our Prefix Trie Data Structure Solution To Go From Here\ 6:08:32 Thank You! Big O\ 6:09:50 Section Overview 6:12:14 What Is Good Code 6:19:11 Big O and Scalability 6:30:20 O(n) 6:35:59 O(1) 6:42:10 Solution Big O Calculation 6:48:04 Solution Big O Calculation 2 6:50:34 Simplifying Big O 6:52:25 Big O Rule 1 6:56:54 Big O Rule 2 7:03:31 Big O Rule 3 7:06:45 O(n^2) 7:13:58 Big O Rule 4 7:20:46 Big O Cheat Sheet 7:24:05 What Does This All Mean 7:29:37 O(n!) 7:30:56 3 Pillars Of Programming 7:34:28 Space Complexity 7:36:51 Exercise Space Complexity 7:43:15 Exercise Twitter 7:50:29 Section Summary Arrays\ 7:55:13 Arrays Introduction 8:09:04 Static vs Dynamic Arrays 8:15:45 Optional Implementing An Array Hash Tables\ 8:33:05 Hash Tables Introduction 8:37:15 Hash Function 8:43:11 Hash Collisions 8:52:55 Hash Tables VS Arrays Linked Lists\ 8:54:56 Linked Lists Introduction 8:57:23 What Is A Linked List 9:02:00 Exercise Why Linked Lists 9:04:06 Solution Why Linked Lists 9:09:42 What Is A Pointer 9:15:27 Doubly Linked Lists 9:18:46 Singly VS Doubly Linked Lists 9:21:26 Linked Lists Review Stacks Queues\ 9:26:34 Stacks Queues Introduction 9:29:33 Stacks 9:33:02 Queues 9:36:33 Exercise Stacks VS Queues 9:39:39 Solution Stacks VS Queues 9:43:18 Stacks Queues Review Trees\ 9:45:38 Trees Introduction 9:52:01 Binary Trees 9:57:46 O(log n) 10:04:47 Binary Search Trees 10:10:59 Balanced VS Unbalanced BST 10:14:42 BST Pros and Cons 10:17:09 Tries Searching BFS DFS\ 10:20:25 Graph Tree Traversals 10:24:22 BFS Introduction 10:27:07 DFS Introduction 10:30:30 BFS vs DFS 10:33:51 Exercise BFS vs DFS 10:34:35 Solution BFS vs DFS 10:37:51 breadthFirstSearch() 10:47:07 PreOrder, InOrder, PostOrder 10:52:28 depthFirstSearch() Recursion\ 11:04:31 Recursion Introduction 11:10:08 Stack Overflow 11:16:26 Anatomy Of Recursion 11:26:53 Recursive VS Iterative 11:31:10 When To Use Recursion 11:35:10 Recursion Review Sorting\ 11:37:57 Sorting Introduction 11:44:59 The Issue With sort() 11:51:50 Sorting Algorithms 11:55:28 Bubble Sort 11:59:14 Solution Bubble Sort
