ZeroToMastery - master-the-coding-interview-big-tech-faang-interviews-updated-7-2022-1

(Binary Search)-Question #14-Start And End Of Target (Medium)\ 8:34 How To Code Binary Search 14:56 Question #14-Start And End Of Target In A Sorted Array 20:02 Walking Through Our Solution 30:50 Coding Our Solution Trees-Question #15-Maximum Depth Of Binary Tree (Easy)\ 43:45 Intro to Binary Trees 45:38 Question #15-Maximum Depth of Binary Tree 52:33 Learning The Process For Solving Binary Tree Problems 1:11:46 Coding Our Solution Trees-Question #16-Level Order Of Binary Tree (Medium)\ 1:17:57 Question #16-Level Order Of Binary Tree 1:23:26 Walking Through Our Solution 1:40:54 Coding Out Level Order Traversal Trees-Question #17-Right Side View of Tree (Medium)\ 1:52:32 Question #17-Right Side View of Tree 1:59:15 Understanding The Breadth First Search Approach 2:07:42 Understanding The Depth First Search Approach 2:17:05 Thinking About Pre-Order, In-Order, and Post-Order Traversals For Our Solution 2:29:28 Completing Our DFS Solution 2:37:09 Coding Our Final DFS Solution & Complete Binary Trees-Question #18-Number Of Nodes In Complete Tree\ 2:49:05 Question #18-Number Of Nodes In Complete Tree 2:57:37 Thinking Deeply About A Full Binary Tree 3:08:03 Figuring Out Number Of Nodes At Last Level 3:23:32 Coding Out Our Full Solution Search Tree-Question #19-Validate Binary Search Tree (Medium)\ 3:44:11 Question #19-Validate Binary Search Tree 3:52:58 Thinking About Our Logical Solution 4:08:03 Figuring Out Our Boundaries 4:14:56 Coding Our Our Full Solution & Priority Queues\ 4:22:54 Introducing Heaps 4:31:40 Insertion In Heaps-Understanding Sift Up 4:39:15 Deletion In Heaps-Understanding Sift Down 4:50:04 Starting To Code Our Priority Queue Class 5:00:53 Coding Our Insertion And Sift Up Methods 5:06:43 Coding Our Deletion And Sift Down Methods To 2D-Arrays-Basics & Traversal Algorithms\ 5:19:43 Introducing 2D Arrays-What Are They 5:27:06 Depth First Search In 2D-Arrays 5:34:31 Coding DFS-Setting Up For DFS 5:44:15 Coding DFS-Implementing Recursive DFS 5:52:55 Breadth First Search In 2D-Arrays 6:00:44 Coding BFS #20 Number Of Islands (Medium)\ 6:10:50 A General Approach To Thinking About Most Graph Questions 6:19:59 Question #20 Number Of Islands 6:27:49 Approaching Our Problem-Thinking Deeply About The Values 6:44:01 Approaching Our Problem-Thinking About Traversals 6:52:57 Coding Our Solution 7:12:06 Thinking About Space And Time Complexity #21 Rotting Oranges (Medium)\ 7:26:45 Question #21 Rotting Oranges 7:33:42 Figuring Out Our Initial Logic 7:44:46 Figuring Out The Rest Of Our Solution 7:59:14 Coding Out Our Solution #22-Walls And Gates (Medium)\ 8:14:01 Question #22-Walls And Gates 8:20:21 Figuring Out Our Logical Solution 8:32:37 Coding Out Our Solution to Graphs-Representation & Traversal Algorithms\ 8:44:22 Introduction To The Types Of Graphs 8:55:29 Representing Our Graphs-Adjacency List & Adjacency Matrix 9:02:49 Breadth First Search In Graphs 9:07:29 Coding BFS 9:15:22 Depth First Search In Graphs 9:18:25 Coding DFS #23-Time Needed to Inform All Employees (Medium)\ 9:25:29 Question #23-Time Needed to Inform All Employees 9:38:21 Verifying Our Constraints And Thinking About Test Cases 9:46:33 How To Represent Our Graph As An Adjacency List 9:56:11 Solving Our Problem Logically Using DFS Traversal 10:04:00 Coding Our DFS Solution #24-Course Scheduler (Medium)\ 10:14:01 Question #24-Course Scheduler 10:24:26 Thinking About Our Initial Solution-BFS 10:32:23 Coding Out Our Initial BFS Solution 10:47:51 What is Topological Sort 10:55:47 Thinking About A Solution With Topological Sort 11:00:36 Coding Our Final Solution #25-Network Time Delay (Medium)\ 11:16:24 Question #25-Network Time Delay 11:29:03 Thinking About How To Approach The Problem 11:37:40 Greedy Method & What Is Dijkstra’s Algorithm 11:53:10 Thinking About A Solution With Dijkstra’s Algorithm