[Udemy] Master the Coding Interview 3a Big Tech (FAANG) Interviews [04.2021] [En]

• 30 Graphs - Question #25 - Network Time Delay (Medium)/003 Greedy Method & What Is Dijkstra's Algorithm_.mp4-233.71 MB
• 15 Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/002 Optional_ Tail Recursion.mp4-231.88 MB
• 30 Graphs - Question #25 - Network Time Delay (Medium)/001 Question #25 - Network Time Delay.mp4-199.67 MB
• 04 Arrays - Questions #3 - Trapping Rainwater (Hard)/004 Figuring Out Our Optimization Strategy.mp4-170.94 MB
• 27 Intro to Graphs - Representation & Traversal Algorithms/001 Introduction To The Types Of Graphs.mp4-166.07 MB
• 34 Interface Design - Question #29 - Monarchy/001 Understanding Interface Design & Question #29 - Monarchy.mp4-164.94 MB
• 28 Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/001 Question #23 - Time Needed to Inform All Employees.mp4-157.37 MB
• 07 Strings - Question #6 - Valid Palindrome & Almost Palindrome/001 Intro To Palindromes.mp4-153.74 MB
• 01 Introduction/001 Course Breakdown.mp4-151.25 MB
• 32 Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/001 Question #27 - Knight Probability In Chessboard.mp4-150.38 MB
• 31 Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/001 Question #26 - Minimum Cost Of Climbing Stairs & How To Approach DP.mp4-145.96 MB
• 11 Linked List - Question #9 - Cycle Detection (Medium)/004 Optional_ Proof Of How And Why Floyd's Algorithm Works.mp4-142.55 MB
• 10 Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/001 Interview Question #8 - Merge Multi-Level Doubly Linked List.mp4-141.27 MB
• 16 Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/001 Understanding Binary Search.mp4-136.76 MB
• 35 Tries - Question #30 - Implement Prefix Trie (Medium)/002 Question #30 - Implement Prefix Trie.mp4-135.27 MB
• 30 Graphs - Question #25 - Network Time Delay (Medium)/004 Thinking About A Solution With Dijkstra's Algorithm.mp4-132.54 MB
• 24 2D-Arrays - Question #20 Number Of Islands (Medium)/001 A General Approach To Thinking About Most Graph Questions.mp4-130.85 MB
• 20 Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/004 Coding Out Our Full Solution.mp4-125.81 MB
• 33 Backtracking - Question #28 - Sudoku Solver (Hard)/007 Coding The Recursive Backtracking Portion Of Our Solution.mp4-123.84 MB
• 15 Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/006 Understanding Divide And Conquer.mp4-120.82 MB
• 23 Intro To 2D-Arrays - Basics & Traversal Algorithms/005 Breadth First Search In 2D-Arrays.mp4-117.34 MB
• 29 Graphs - Question #24 - Course Scheduler (Medium)/004 What is Topological Sort_.mp4-115.71 MB
• 23 Intro To 2D-Arrays - Basics & Traversal Algorithms/002 Depth First Search In 2D-Arrays.mp4-115.09 MB
• 17 Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/003 Learning The Process For Solving Binary Tree Problems.mp4-112.96 MB
• 23 Intro To 2D-Arrays - Basics & Traversal Algorithms/001 Introducing 2D Arrays - What Are They_.mp4-112.42 MB
• 30 Graphs - Question #25 - Network Time Delay (Medium)/005 Coding Our Solution With Dijkstra.mp4-111.36 MB
• 09 Linked List - Question #7 - M, N Reversals (Medium)/002 Coming Up With A Logical Solution.mp4-111.3 MB
• 18 Binary Trees - Question #16 - Level Order Of Binary Tree (Medium)/002 Walking Through Our Solution.mp4-110.65 MB
• 05 Strings - Question #4 - Typed Out Strings (Easy)/001 Interview Question #4 -Typed Out Strings.mp4-110.38 MB
• 27 Intro to Graphs - Representation & Traversal Algorithms/002 Representing Our Graphs - Adjacency List & Adjacency Matrix.mp4-109.3 MB
• 02 Arrays - Question #1 Google Interview Question Two Sum (Easy)/001 Interview Question #1 Two Sum.mp4-107.13 MB
• 33 Backtracking - Question #28 - Sudoku Solver (Hard)/001 Understanding The Basics Of Backtracking.mp4-106.54 MB
• 24 2D-Arrays - Question #20 Number Of Islands (Medium)/005 Coding Our Solution.mp4-105.21 MB
• 29 Graphs - Question #24 - Course Scheduler (Medium)/001 Question #24 - Course Scheduler.mp4-102.5 MB
• 03 Arrays - Questions #2 - Container With Most Water (Medium)/003 Thinking Through A Logical Brute Force Solution.mp4-102.42 MB
• 02 Arrays - Question #1 Google Interview Question Two Sum (Easy)/006 Analyzing Space and Time Complexity.mp4-102.24 MB
• 12 Stacks - Question #10 - Valid Parentheses (Easy)/002 Interview Question #10 - Valid Parentheses.mp4-102.01 MB
• 10 Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/004 Thinking About Our Approach.mp4-100.74 MB
• 38 Appendix_ Arrays/003 Optional_ Implementing An Array.mp4-99.32 MB
• 30 Graphs - Question #25 - Network Time Delay (Medium)/008 What is The Bellman-Ford Algorithm_ - Conceptualizing Dynamic Programming.mp4-98.86 MB
• 45 Appendix_ Sorting/017 Quick Sort.mp4-98.78 MB
• 24 2D-Arrays - Question #20 Number Of Islands (Medium)/006 Thinking About Space And Time Complexity.mp4-98.11 MB
• 24 2D-Arrays - Question #20 Number Of Islands (Medium)/003 Approaching Our Problem - Thinking Deeply About The Values.mp4-97.89 MB
• 20 Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/003 Figuring Out Number Of Nodes At Last Level.mp4-97.4 MB
• 31 Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/002 Understanding & Identifying Recurrence Relation.mp4-96.23 MB
• 07 Strings - Question #6 - Valid Palindrome & Almost Palindrome/003 Almost A Palindrome.mp4-95.98 MB
• 10 Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/005 Coding Out Our Solution.mp4-95.82 MB
• 21 Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/001 Question #19 - Validate Binary Search Tree.mp4-95.15 MB
• 30 Graphs - Question #25 - Network Time Delay (Medium)/006 Time And Space Complexity Of Our Solution.mp4-94.68 MB
• 32 Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/006 Figuring Out The Logic For Our Bottom Up Solution.mp4-94.02 MB