| 01 - Introduction | |||
| 001 Appendix-Chapter-Arrays-and-Big-O.url | 138 B | ||
| 001 Course Breakdown.mp4 | 151.37 MB | ||
| 001 Course Breakdown_en.srt | 16.26 KB | ||
| 002 Join Our Online Classroom!.mp4 | 77.71 MB | ||
| 002 Join Our Online Classroom!_en.srt | 5.99 KB | ||
| 003 Exercise Meet Your Classmates and Instructor.html | 3.43 KB | ||
| 004 Download All Code + Solutions.html | 465 B | ||
| 004 Mastering-the-Coding-Interview-FAANG-Course-Outline.pdf | 65.42 KB | ||
| 005 Monthly Coding Challenges, Free Resources and Guides.html | 1.58 KB | ||
| external-links.txt | 157 B | ||
| 02 - Arrays - Question #1 Google Interview Question Two Sum (Easy) | |||
| 001 Interview Question #1 Two Sum.mp4 | 22.74 MB | ||
| 001 Interview Question #1 Two Sum_en.srt | 11.12 KB | ||
| 002 How To Approach Our Problem.mp4 | 17.19 MB | ||
| 002 How To Approach Our Problem_en.srt | 17.22 KB | ||
| 003 Brute-Force-Solution-Repl.url | 72 B | ||
| 003 Writing Our Brute Force Solution.mp4 | 12.99 MB | ||
| 003 Writing Our Brute Force Solution_en.srt | 9.38 KB | ||
| 004 Testing Our Brute Force Solution With Our Test Cases.mp4 | 15.06 MB | ||
| 004 Testing Our Brute Force Solution With Our Test Cases_en.srt | 13.8 KB | ||
| 005 Leetcode-Question-Link.url | 62 B | ||
| 005 Submitting To Leetcode.mp4 | 5.72 MB | ||
| 005 Submitting To Leetcode_en.srt | 3.16 KB | ||
| 006 Analyzing Space and Time Complexity.mp4 | 34.04 MB | ||
| 006 Analyzing Space and Time Complexity_en.srt | 14.53 KB | ||
| 007 Appendix-Chapter-Hash-Maps.url | 138 B | ||
| 007 Optimizing Our Solution.mp4 | 14.02 MB | ||
| 007 Optimizing Our Solution_en.srt | 11.76 KB | ||
| 008 Coding Our Optimal Solution.mp4 | 8.3 MB | ||
| 008 Coding Our Optimal Solution_en.srt | 7.48 KB | ||
| 008 Optimal-Solution-Code-Repl.url | 77 B | ||
| 010 Checking Performance on Leetcode.mp4 | 13.61 MB | ||
| 010 Checking Performance on Leetcode_en.srt | 5.34 KB | ||
| 010 Leetcode-Question-Link.url | 62 B | ||
| 011 Solutions In Other Languages.html | 264 B | ||
| 012 Web, Python, Machine Learning Monthly + Resources.html | 511 B | ||
| external-links.txt | 462 B | ||
| 03 - Arrays - Questions #2 - Container With Most Water (Medium) | |||
| 001 Interview Question #2 - Container With Most Water.mp4 | 71.9 MB | ||
| 001 Interview Question #2 - Container With Most Water_en.srt | 6.05 KB | ||
| 001 Leetcode-Question-Link.url | 80 B | ||
| 002 Coming Up With Test Cases.mp4 | 20.29 MB | ||
| 002 Coming Up With Test Cases_en.srt | 5.46 KB | ||
| 003 Thinking Through A Logical Brute Force Solution.mp4 | 37.33 MB | ||
| 003 Thinking Through A Logical Brute Force Solution_en.srt | 16.06 KB | ||
| 004 Brute-Force-Solution-Repl.url | 97 B | ||
| 004 Coding Out Our Brute Force Solution.mp4 | 16.97 MB | ||
| 004 Coding Out Our Brute Force Solution_en.srt | 9.99 KB | ||
| 005 Stepping Through Our Code.mp4 | 24.48 MB | ||
| 005 Stepping Through Our Code_en.srt | 6.85 KB | ||
| 006 Thinking About Our Optimal Solution.mp4 | 64.66 MB | ||
| 006 Thinking About Our Optimal Solution_en.srt | 19.2 KB | ||
| 007 Coding Our Optimal Solution And Testing On LeetCode.mp4 | 77.26 MB | ||
| 007 Coding Our Optimal Solution And Testing On LeetCode_en.srt | 13.67 KB | ||
| 007 Leetcode-Question-Link.url | 80 B | ||
| 007 Optimal-Solution-Code-Repl.url | 93 B | ||
| external-links.txt | 389 B | ||
| 04 - Arrays - Questions #3 - Trapping Rainwater (Hard) | |||
| 001 Interview Question #3 - Trapping Rainwater.mp4 | 86.99 MB | ||
| 001 Interview Question #3 - Trapping Rainwater_en.srt | 10.34 KB | ||
| 001 Leetcode-Question-Link.url | 74 B | ||
| 002 Thinking About A Logical Solution.mp4 | 21.46 MB | ||
| 002 Thinking About A Logical Solution_en.srt | 18.61 KB | ||
| 003 Brute-Force-Solution-Repl.url | 100 B | ||
| 003 Coding Our Brute Force.mp4 | 22.08 MB | ||
| 003 Coding Our Brute Force_en.srt | 12.01 KB | ||
| 004 Figuring Out Our Optimization Strategy.mp4 | 96.76 MB | ||
| 004 Figuring Out Our Optimization Strategy_en.srt | 35.55 KB | ||
| 005 Coding Our Optimal Solution.mp4 | 51.72 MB | ||
| 005 Coding Our Optimal Solution_en.srt | 17.43 KB | ||
| 005 Optimal-Solution-Code-Repl.url | 88 B | ||
| 006 Optimal Code And LeetCode.mp4 | 16.93 MB | ||
| 006 Optimal Code And LeetCode_en.srt | 3.16 KB | ||
| external-links.txt | 293 B | ||
| 05 - Strings - Question #4 - Typed Out Strings (Easy) | |||
| 001 Interview Question #4 -Typed Out Strings.mp4 | 110.39 MB | ||
| 001 Interview Question #4 -Typed Out Strings_en.srt | 10.76 KB | ||
| 001 Leetcode-Question-Link.url | 79 B | ||
| 002 Logic Of Our Brute Force.mp4 | 12.32 MB | ||
| 002 Logic Of Our Brute Force_en.srt | 11.69 KB | ||
| 003 Brute-Force-Solution-Repl.url | 90 B | ||
| 003 Coding Our Brute Force.mp4 | 13.78 MB | ||
| 003 Coding Our Brute Force_en.srt | 12.24 KB | ||
| 004 Space And Time Complexity.mp4 | 28.75 MB | ||
| 004 Space And Time Complexity_en.srt | 9.96 KB | ||
| 005 Coming Up With Optimal Solution.mp4 | 17.42 MB | ||
| 005 Coming Up With Optimal Solution_en.srt | 15.67 KB | ||
| 006 Coding Our Optimal Solution.mp4 | 17.87 MB | ||
| 006 Coding Our Optimal Solution_en.srt | 16.06 KB | ||
| 006 Optimal-Solution-Code-Repl.url | 78 B | ||
| 007 Leetcode-Question-Link.url | 79 B | ||
| 007 Submitting To LeetCode.mp4 | 36.77 MB | ||
| 007 Submitting To LeetCode_en.srt | 8.47 KB | ||
| external-links.txt | 365 B | ||
| 06 - Strings - Question #5 - Longest Substring Without Repeating Characters (Medium) | |||
| 001 Leetcode-Question-Link.url | 101 B | ||
| 002 Coming Up With A Brute Force Approach.mp4 | 6.96 MB | ||
| 002 Coming Up With A Brute Force Approach_en.srt | 10.96 KB | ||
| 003 Brute-Force-Solution-Repl.url | 108 B | ||
| 003 Coding Our Brute Force.mp4 | 15.83 MB | ||
| 003 Coding Our Brute Force_en.srt | 12.81 KB | ||
| 004 Space And Time Complexity.mp4 | 22.22 MB | ||
| 004 Space And Time Complexity_en.srt | 4.54 KB | ||
| 005 Sliding Window Technique.mp4 | 16.81 MB | ||
| 005 Sliding Window Technique_en.srt | 7.58 KB | ||
| 006 Hints For Optimizing Our Solution.mp4 | 6.9 MB | ||
| 006 Hints For Optimizing Our Solution_en.srt | 3.22 KB | ||
| 007 Thinking About Optimal Solution.mp4 | 9.57 MB | ||
| 007 Thinking About Optimal Solution_en.srt | 12.49 KB | ||
| 008 Coding Our Optimal Solution.mp4 | 14.25 MB | ||
| 008 Coding Our Optimal Solution_en.srt | 10.56 KB | ||
| 008 Optimal-Solution-Code-Repl.url | 104 B | ||
| 009 Note Correction for explanation of +1.html | 2.05 KB | ||
| 010 Leetcode-Question-Link.url | 101 B | ||
| 010 Optimal Code And LeetCode.mp4 | 9.8 MB | ||
| 010 Optimal Code And LeetCode_en.srt | 4.9 KB | ||
| external-links.txt | 453 B | ||
| 07 - Strings - Question #6 - Valid Palindrome & Almost Palindrome | |||
| 001 Intro To Palindromes.mp4 | 42.81 MB | ||
| 001 Intro To Palindromes_en.srt | 13.12 KB | ||
| 002 Interview Question #6 - Valid Palindrome.mp4 | 13.62 MB | ||
| 002 Interview Question #6 - Valid Palindrome_en.srt | 11.71 KB | ||
| 002 Leetcode-Question-Link.url | 71 B | ||
| 002 Palindrome-Compare-Against-Reverse-Solution.url | 101 B | ||
| 002 Two-Pointer-From-Center-Solution.url | 100 B | ||
| 002 Two-Pointers-From-Outside-Solution.url | 93 B | ||
| 003 Almost A Palindrome.mp4 | 40.85 MB | ||
| 003 Almost A Palindrome_en.srt | 14.89 KB | ||
| 003 Leetcode-Question-Link.url | 74 B | ||
| 004 Figuring Out Our Solution.mp4 | 7.2 MB | ||
| 004 Figuring Out Our Solution_en.srt | 9.51 KB | ||
| 005 Coding Our Solution.mp4 | 19.08 MB | ||
| 005 Coding Our Solution_en.srt | 12.87 KB | ||
| 005 Final-Solution-Repl.url | 87 B | ||
| external-links.txt | 614 B | ||
| 08 - Introducing Linked Lists - Basics and Reverse A Linked List | |||
| 001 Appendix-Chapter-Linked-Lists.url | 138 B | ||
| 001 Linked List Introduction.mp4 | 12.49 MB | ||
| 001 Linked List Introduction_en.srt | 5.45 KB | ||
| 002 Basic Algorithm Reverse a Linked List.mp4 | 15.27 MB | ||
| 002 Basic Algorithm Reverse a Linked List_en.srt | 12.16 KB | ||
| 003 Thinking About Our Solution.mp4 | 18.84 MB | ||
| 003 Thinking About Our Solution_en.srt | 14.58 KB | ||
| 004 Code-Solution-Repl.url | 80 B | ||
| 004 Coding Reverse A Linked List Solution.mp4 | 11.08 MB | ||
| 004 Coding Reverse A Linked List Solution_en.srt | 9.57 KB | ||
| GetFreeCourses.Co.url | 116 B | ||
| external-links.txt | 237 B | ||
| 09 - Linked List - Question #7 - M, N Reversals (Medium) | |||
| 001 Interview Question #7 - M, N Reversals.mp4 | 15.84 MB | ||
| 001 Interview Question #7 - M, N Reversals_en.srt | 9.43 KB | ||
| 001 Leetcode-Question-Link.url | 77 B | ||
| 002 Coming Up With A Logical Solution.mp4 | 33.77 MB | ||
| 002 Coming Up With A Logical Solution_en.srt | 23.04 KB | ||
| 003 Code-Solution-Repl.url | 66 B | ||
| 003 Coding Our Solution.mp4 | 31.34 MB | ||
| 003 Coding Our Solution_en.srt | 21.87 KB | ||
| external-links.txt | 155 B | ||
| 10 - Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium) | |||
| 001 Leetcode-Question-Link.url | 94 B | ||
| 002 Figuring Out Our Test Cases.mp4 | 12.14 MB | ||
| 002 Figuring Out Our Test Cases_en.srt | 12.31 KB | ||
| 004 Thinking About Our Approach.mp4 | 31.11 MB | ||
| 004 Thinking About Our Approach_en.srt | 24.59 KB | ||
| 005 Code-Solution-Repl.url | 97 B | ||
| 005 Coding Out Our Solution.mp4 | 54.28 MB | ||
| 005 Coding Out Our Solution_en.srt | 21.05 KB | ||
| external-links.txt | 203 B | ||
| 11 - Linked List - Question #9 - Cycle Detection (Medium) | |||
| 001 Interview Question #9 - Cycle Detection.mp4 | 21.58 MB | ||
| 001 Interview Question #9 - Cycle Detection_en.srt | 16.16 KB | ||
| 001 Javascript-Set.url | 65 B | ||
| 001 Leetcode-Question-Link.url | 75 B | ||
| 002 What Is Floyd's Tortoise And Hare Algorithm.mp4 | 9.55 MB | ||
| 002 What Is Floyd's Tortoise And Hare Algorithm_en.srt | 4.24 KB | ||
| 003 Code-solution-with-Set-Object-Code-Repl.url | 77 B | ||
| 003 Coding Floyd's Algorithm.mp4 | 13.14 MB | ||
| 003 Coding Floyd's Algorithm_en.srt | 12.62 KB | ||
| 003 Floyd-s-Tortoise-and-Hare-Algorithm-Code-Repl.url | 101 B | ||
| 004 Optional Proof Of How And Why Floyd's Algorithm Works.mp4 | 42.6 MB | ||
| 004 Optional Proof Of How And Why Floyd's Algorithm Works_en.srt | 34.89 KB | ||
| external-links.txt | 382 B | ||
| 12 - Stacks - Question #10 - Valid Parentheses (Easy) | |||
| 001 Appendix-Chapter-Stacks-Queues.url | 138 B | ||
| 001 Intro to Stacks and Queues.mp4 | 10.19 MB | ||
| 001 Intro to Stacks and Queues_en.srt | 3.99 KB | ||
| 002 Interview Question #10 - Valid Parentheses.mp4 | 22.49 MB | ||
| 002 Interview Question #10 - Valid Parentheses_en.srt | 11.95 KB | ||
| 002 Leetcode-Question-Link.url | 72 B | ||
| 003 Walking Through Our Problem - Identifying The Need For A Stack.mp4 | 8.99 MB | ||
| 003 Walking Through Our Problem - Identifying The Need For A Stack_en.srt | 12.4 KB | ||
| 004 Code-Solution-Repl.url | 78 B | ||
| 004 Coding Our Solution With A Stack.mp4 | 14.83 MB | ||
| 004 Coding Our Solution With A Stack_en.srt | 12.34 KB | ||
| external-links.txt | 316 B | ||
| 13 - Stacks - Question #11 - Minimum Brackets To Remove (Medium) | |||
| 001 Interview Question #11 - Minimum Brackets To Remove.mp4 | 26.79 MB | ||
| 001 Interview Question #11 - Minimum Brackets To Remove_en.srt | 9.92 KB | ||
| 001 Leetcode-Question-Link.url | 95 B | ||
| 002 Thinking About Our Solution.mp4 | 14.36 MB | ||
| 002 Thinking About Our Solution_en.srt | 18.79 KB | ||
| 003 Code-Solution-Repl.url | 79 B | ||
| 003 Coding Our Solution.mp4 | 18.11 MB | ||
| 003 Coding Our Solution_en.srt | 14.64 KB | ||
| external-links.txt | 186 B | ||
| 14 - Queues - Question #12 - Implement Queue With Stacks (Easy) | |||
| 001 Leetcode-Question-Link.url | 83 B | ||
| 001 Question #12 - Implement Queue With Stacks.mp4 | 13.1 MB | ||
| 001 Question #12 - Implement Queue With Stacks_en.srt | 5.89 KB | ||
| 002 Figuring Out Our Solution.mp4 | 12.98 MB | ||
| 002 Figuring Out Our Solution_en.srt | 13.93 KB | ||
| 003 Code-Solution-Repl.url | 78 B | ||
| 003 Coding Our Solution.mp4 | 11.71 MB | ||
| 003 Coding Our Solution_en.srt | 10.57 KB | ||
| external-links.txt | 173 B | ||
| 15 - Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element | |||
| 001 Appendix-Chapter-Recursion.url | 138 B | ||
| 001 Introducing Recursion.mp4 | 9.73 MB | ||
| 001 Introducing Recursion_en.srt | 4.34 KB | ||
| 002 Optional Tail Recursion.mp4 | 61.77 MB | ||
| 002 Optional Tail Recursion_en.srt | 28.05 KB | ||
| 003 Appendix-Chapter-Sorting.url | 138 B | ||
| 003 Sorting.mp4 | 7.48 MB | ||
| 003 Sorting_en.srt | 3.18 KB | ||
| 004 Interview Question #13 - Kth Largest Element.mp4 | 16.61 MB | ||
| 004 Interview Question #13 - Kth Largest Element_en.srt | 9.77 KB | ||
| 004 Leetcode-Question-Link.url | 86 B | ||
| 005 Insights From Quick Sort.mp4 | 15.9 MB | ||
| 005 Insights From Quick Sort_en.srt | 17.51 KB | ||
| 006 Understanding Divide And Conquer.mp4 | 26.09 MB | ||
| 006 Understanding Divide And Conquer_en.srt | 10.81 KB | ||
| 007 Coding Quicksort Into Our Solution.mp4 | 41.57 MB | ||
| 007 Coding Quicksort Into Our Solution_en.srt | 18.77 KB | ||
| 007 Quicksort-Solution-Repl.url | 95 B | ||
| 008 What Is Hoare's Quickselect Algorithm.mp4 | 10.45 MB | ||
| 008 What Is Hoare's Quickselect Algorithm_en.srt | 10.19 KB | ||
| 009 Coding Our Solution With Quickselect.mp4 | 47.76 MB | ||
| 009 Coding Our Solution With Quickselect_en.srt | 16.07 KB | ||
| 009 Hoare-s-QuickSelect-Solution-Repl.url | 97 B | ||
| 010 Correction About Time Complexity.html | 1.24 KB | ||
| 011 Exercise Imposter Syndrome.mp4 | 26.51 MB | ||
| 011 Exercise Imposter Syndrome_en.srt | 4.54 KB | ||
| external-links.txt | 612 B | ||
| 16 - Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium) | |||
| 001 Understanding Binary Search.mp4 | 30.18 MB | ||
| 001 Understanding Binary Search_en.srt | 12.97 KB | ||
| 002 How To Code Binary Search.mp4 | 9.78 MB | ||
| 002 How To Code Binary Search_en.srt | 9.14 KB | ||
| 003 Leetcode-Question-Link.url | 110 B | ||
| 003 Question #14 - Start And End Of Target In A Sorted Array.mp4 | 21.5 MB | ||
| 004 Walking Through Our Solution.mp4 | 14.55 MB | ||
| 004 Walking Through Our Solution_en.srt | 15.42 KB | ||
| 005 Code-Solution-Repl.url | 95 B | ||
| 005 Coding Our Solution.mp4 | 48.68 MB | ||
| 005 Coding Our Solution_en.srt | 17.47 KB | ||
| external-links.txt | 217 B | ||
| 17 - Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy) | |||
| 001 Appendix-Chapter-Trees-Binary-Trees-Binary-Search-Trees-.url | 138 B | ||
| 001 Intro to Binary Trees.mp4 | 5.89 MB | ||
| 001 Intro to Binary Trees_en.srt | 2.51 KB | ||
| 002 Leetcode-Question-Link.url | 83 B | ||
| 002 Question #15 - Maximum Depth of Binary Tree.mp4 | 16.05 MB | ||
| 002 Question #15 - Maximum Depth of Binary Tree_en.srt | 9.25 KB | ||
| 003 Learning The Process For Solving Binary Tree Problems.mp4 | 32.58 MB | ||
| 003 Learning The Process For Solving Binary Tree Problems_en.srt | 27.43 KB | ||
| 004 Code-Solution-Repl.url | 74 B | ||
| 004 Coding Our Solution.mp4 | 13.45 MB | ||
| 004 Coding Our Solution_en.srt | 7.6 KB | ||
| external-links.txt | 349 B | ||
| 18 - Binary Trees - Question #16 - Level Order Of Binary Tree (Medium) | |||
| 001 Leetcode-Question-Link.url | 88 B | ||
| 001 Question #16 - Level Order Of Binary Tree.mp4 | 12.18 MB | ||
| 001 Question #16 - Level Order Of Binary Tree_en.srt | 7.23 KB | ||
| 002 Walking Through Our Solution.mp4 | 32 MB | ||
| 002 Walking Through Our Solution_en.srt | 24.93 KB | ||
| 003 Code-Solution-Repl.url | 64 B | ||
| 003 Coding Out Level Order Traversal.mp4 | 25.09 MB | ||
| 003 Coding Out Level Order Traversal_en.srt | 15.23 KB | ||
| external-links.txt | 164 B | ||
| 19 - Binary Trees - Question #17 - Right Side View of Tree (Medium) | |||
| 001 Leetcode-Question-Link.url | 82 B | ||
| 001 Question #17 - Right Side View of Tree.mp4 | 13.64 MB | ||
| 001 Question #17 - Right Side View of Tree_en.srt | 9.64 KB | ||
| 002 BFS-Solution-Code-Repl.url | 92 B | ||
| 002 Understanding The Breadth First Search Approach.mp4 | 12.56 MB | ||
| 002 Understanding The Breadth First Search Approach_en.srt | 12.88 KB | ||
| 003 Understanding The Depth First Search Approach.mp4 | 14.08 MB | ||
| 003 Understanding The Depth First Search Approach_en.srt | 12.21 KB | ||
| 005 Completing Our DFS Solution.mp4 | 14.45 MB | ||
| 005 Completing Our DFS Solution_en.srt | 11.68 KB | ||
| 006 Coding Our Final DFS Solution.mp4 | 24.88 MB | ||
| 006 Coding Our Final DFS Solution_en.srt | 16.56 KB | ||
| 006 DFS-Solution-Code-Repl.url | 92 B | ||
| external-links.txt | 290 B | ||
| 20 - Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree | |||
| 001 Leetcode-Question-Link.url | 80 B | ||
| 001 Question #18 - Number Of Nodes In Complete Tree.mp4 | 18.52 MB | ||
| 001 Question #18 - Number Of Nodes In Complete Tree_en.srt | 12.07 KB | ||
| 002 Thinking Deeply About A Full Binary Tree.mp4 | 18.13 MB | ||
| 002 Thinking Deeply About A Full Binary Tree_en.srt | 15.07 KB | ||
| 003 Figuring Out Number Of Nodes At Last Level.mp4 | 28.62 MB | ||
| 003 Figuring Out Number Of Nodes At Last Level_en.srt | 21 KB | ||
| 004 Code-Solution-Repl.url | 100 B | ||
| 004 Coding Out Our Full Solution.mp4 | 52.05 MB | ||
| 004 Coding Out Our Full Solution_en.srt | 29.85 KB | ||
| external-links.txt | 192 B | ||
| 21 - Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium) | |||
| 001 Leetcode-Question-Link.url | 82 B | ||
| 001 Question #19 - Validate Binary Search Tree.mp4 | 21.48 MB | ||
| 001 Question #19 - Validate Binary Search Tree_en.srt | 11.99 KB | ||
| 002 Thinking About Our Logical Solution.mp4 | 22.03 MB | ||
| 002 Thinking About Our Logical Solution_en.srt | 20.53 KB | ||
| 003 Figuring Out Our Boundaries.mp4 | 12.63 MB | ||
| 003 Figuring Out Our Boundaries_en.srt | 9.67 KB | ||
| 004 Code-Solution-Repl.url | 88 B | ||
| 004 Coding Our Our Full Solution.mp4 | 23.11 MB | ||
| 004 Coding Our Our Full Solution_en.srt | 10.61 KB | ||
| GetFreeCourses.Co.url | 116 B | ||
| external-links.txt | 182 B | ||
| 22 - Heaps & Priority Queues | |||
| 001 Introducing Heaps.mp4 | 19.28 MB | ||
| 001 Introducing Heaps_en.srt | 11.02 KB | ||
| 002 Insertion In Heaps - Understanding Sift Up.mp4 | 12.42 MB | ||
| 002 Insertion In Heaps - Understanding Sift Up_en.srt | 9.64 KB | ||
| 003 Deletion In Heaps - Understanding Sift Down.mp4 | 17.03 MB | ||
| 003 Deletion In Heaps - Understanding Sift Down_en.srt | 15.55 KB | ||
| 004 Max-Heap-Priority-Queue-Code-Repl.url | 88 B | ||
| 004 Starting To Code Our Priority Queue Class.mp4 | 12.47 MB | ||
| 004 Starting To Code Our Priority Queue Class_en.srt | 14.51 KB | ||
| 005 Coding Our Insertion And Sift Up Methods.mp4 | 9.92 MB | ||
| 005 Coding Our Insertion And Sift Up Methods_en.srt | 7.97 KB | ||
| 006 Coding Our Deletion And Sift Down Methods.mp4 | 21.1 MB | ||
| 006 Coding Our Deletion And Sift Down Methods_en.srt | 17.04 KB | ||
| external-links.txt | 107 B | ||
| 23 - Intro To 2D-Arrays - Basics & Traversal Algorithms | |||
| 001 Introducing 2D Arrays - What Are They.mp4 | 23.3 MB | ||
| 001 Introducing 2D Arrays - What Are They_en.srt | 9.59 KB | ||
| 002 Depth First Search In 2D-Arrays.mp4 | 23.36 MB | ||
| 002 Depth First Search In 2D-Arrays_en.srt | 12.67 KB | ||
| 003 2D-Array-DFS-Code-Repl.url | 81 B | ||
| 003 Coding DFS - Setting Up For DFS.mp4 | 15.54 MB | ||
| 003 Coding DFS - Setting Up For DFS_en.srt | 13.48 KB | ||
| 004 Coding DFS - Implementing Recursive DFS.mp4 | 31.66 MB | ||
| 004 Coding DFS - Implementing Recursive DFS_en.srt | 11.53 KB | ||
| 005 Breadth First Search In 2D-Arrays.mp4 | 24.44 MB | ||
| 005 Breadth First Search In 2D-Arrays_en.srt | 12.98 KB | ||
| 006 2D-Array-BFS-Code-Repl.url | 73 B | ||
| 006 Coding BFS.mp4 | 23.97 MB | ||
| 006 Coding BFS_en.srt | 13.83 KB | ||
| external-links.txt | 170 B | ||
| 24 - 2D-Arrays - Question #20 Number Of Islands (Medium) | |||
| 001 A General Approach To Thinking About Most Graph Questions.mp4 | 28.81 MB | ||
| 001 A General Approach To Thinking About Most Graph Questions_en.srt | 13.01 KB | ||
| 002 Leetcode-Question-Link.url | 72 B | ||
| 002 Question #20 Number Of Islands.mp4 | 17.47 MB | ||
| 002 Question #20 Number Of Islands_en.srt | 10.31 KB | ||
| 003 Approaching Our Problem - Thinking Deeply About The Values.mp4 | 28.01 MB | ||
| 003 Approaching Our Problem - Thinking Deeply About The Values_en.srt | 22.76 KB | ||
| 004 Approaching Our Problem - Thinking About Traversals.mp4 | 16.25 MB | ||
| 004 Approaching Our Problem - Thinking About Traversals_en.srt | 13.42 KB | ||
| 005 BFS-Solution-Code-Repl.url | 82 B | ||
| 005 Coding Our Solution.mp4 | 60.51 MB | ||
| 005 Coding Our Solution_en.srt | 26.99 KB | ||
| 005 DFS-Solution-Code-Repl.url | 82 B | ||
| 006 Thinking About Space And Time Complexity.mp4 | 30.59 MB | ||
| 006 Thinking About Space And Time Complexity_en.srt | 21.81 KB | ||
| external-links.txt | 260 B | ||
| 25 - 2D-Arrays - Question #21 Rotting Oranges (Medium) | |||
| 001 Leetcode-Question-Link.url | 70 B | ||
| 001 Question #21 Rotting Oranges.mp4 | 80.43 MB | ||
| 001 Question #21 Rotting Oranges_en.srt | 9.88 KB | ||
| 002 Figuring Out Our Initial Logic.mp4 | 16.24 MB | ||
| 002 Figuring Out Our Initial Logic_en.srt | 15.33 KB | ||
| 003 Figuring Out The Rest Of Our Solution.mp4 | 24.2 MB | ||
| 003 Figuring Out The Rest Of Our Solution_en.srt | 20.52 KB | ||
| 004 Code-Solution-Repl.url | 85 B | ||
| 004 Coding Out Our Solution.mp4 | 28.26 MB | ||
| 004 Coding Out Our Solution_en.srt | 20.29 KB | ||
| external-links.txt | 167 B | ||
| 26 - 2D-Arrays - Question #22 - Walls And Gates (Medium) | |||
| 001 Leetcode-Question-Link-Subscription-Required-.url | 70 B | ||
| 001 Question #22 - Walls And Gates.mp4 | 21.39 MB | ||
| 001 Question #22 - Walls And Gates_en.srt | 8.7 KB | ||
| 002 Figuring Out Our Logical Solution.mp4 | 17.71 MB | ||
| 002 Figuring Out Our Logical Solution_en.srt | 20.36 KB | ||
| 003 Code-Solution-Repl.url | 85 B | ||
| 003 Coding Out Our Solution.mp4 | 25.39 MB | ||
| 003 Coding Out Our Solution_en.srt | 16.83 KB | ||
| 003 Search-a-2D-Matrix.url | 73 B | ||
| 003 Set-Matrix-Zeroes.url | 72 B | ||
| 003 Transpose-a-matrix-easy-question-.url | 71 B | ||
| GetFreeCourses.Co.url | 116 B | ||
| external-links.txt | 432 B | ||
| 27 - Intro to Graphs - Representation & Traversal Algorithms | |||
| 001 Introduction To The Types Of Graphs.mp4 | 34.87 MB | ||
| 001 Introduction To The Types Of Graphs_en.srt | 15.53 KB | ||
| 002 Representing Our Graphs - Adjacency List & Adjacency Matrix.mp4 | 22.84 MB | ||
| 002 Representing Our Graphs - Adjacency List & Adjacency Matrix_en.srt | 10.83 KB | ||
| 003 Breadth First Search In Graphs.mp4 | 14.78 MB | ||
| 003 Breadth First Search In Graphs_en.srt | 7.57 KB | ||
| 004 Adjacency-List-BFS-Code-Repl.url | 79 B | ||
| 004 Adjacency-Matrix-BFS-Code-Repl.url | 81 B | ||
| 004 Coding BFS.mp4 | 15.06 MB | ||
| 004 Coding BFS_en.srt | 11.15 KB | ||
| 005 Depth First Search In Graphs.mp4 | 9.66 MB | ||
| 005 Depth First Search In Graphs_en.srt | 4.93 KB | ||
| 006 Adjacency-List-DFS-Code-Repl.url | 79 B | ||
| 006 Adjacency-Matrix-DFS-Code-Repl.url | 73 B | ||
| 006 Coding DFS.mp4 | 13.64 MB | ||
| 006 Coding DFS_en.srt | 10.09 KB | ||
| external-links.txt | 372 B | ||
| 28 - Graphs - Question #23 - Time Needed to Inform All Employees (Medium) | |||
| 001 Leetcode-Question-Link.url | 90 B | ||
| 001 Question #23 - Time Needed to Inform All Employees.mp4 | 57.19 MB | ||
| 001 Question #23 - Time Needed to Inform All Employees_en.srt | 18.28 KB | ||
| 002 Verifying Our Constraints And Thinking About Test Cases.mp4 | 18.24 MB | ||
| 002 Verifying Our Constraints And Thinking About Test Cases_en.srt | 11.88 KB | ||
| 003 How To Represent Our Graph As An Adjacency List.mp4 | 13.96 MB | ||
| 003 How To Represent Our Graph As An Adjacency List_en.srt | 13.45 KB | ||
| 004 Solving Our Problem Logically Using DFS Traversal.mp4 | 12.09 MB | ||
| 004 Solving Our Problem Logically Using DFS Traversal_en.srt | 12.06 KB | ||
| 005 Code-Solution-Repl.url | 96 B | ||
| 005 Coding Our DFS Solution.mp4 | 19.82 MB | ||
| 005 Coding Our DFS Solution_en.srt | 14.6 KB | ||
| external-links.txt | 198 B | ||
| 29 - Graphs - Question #24 - Course Scheduler (Medium) | |||
| 001 Leetcode-Question-Link.url | 70 B | ||
| 001 Question #24 - Course Scheduler.mp4 | 26.81 MB | ||
| 001 Question #24 - Course Scheduler_en.srt | 15.2 KB | ||
| 002 Thinking About Our Initial Solution - BFS.mp4 | 10.2 MB | ||
| 002 Thinking About Our Initial Solution - BFS_en.srt | 11.77 KB | ||
| 003 Coding Out Our Initial BFS Solution.mp4 | 28.71 MB | ||
| 003 Coding Out Our Initial BFS Solution_en.srt | 21.57 KB | ||
| 003 Naive-BFS-Solution-Code-Repl.url | 86 B | ||
| 004 What is Topological Sort.mp4 | 24.8 MB | ||
| 004 What is Topological Sort_en.srt | 10.87 KB | ||
| 005 Thinking About A Solution With Topological Sort.mp4 | 15.52 MB | ||
| 005 Thinking About A Solution With Topological Sort_en.srt | 7.22 KB | ||
| 006 Coding Our Final Solution.mp4 | 34.62 MB | ||
| 006 Coding Our Final Solution_en.srt | 23.33 KB | ||
| 006 Optimal-Topological-Sort-Solution-No-Adjacency-List-Code-Repl.url | 116 B | ||
| 006 Topological-Sort-Solution-With-Adjacency-List-Code-Repl.url | 113 B | ||
| external-links.txt | 495 B | ||
| 30 - Graphs - Question #25 - Network Time Delay (Medium) | |||
| 001 Leetcode-Question-Link.url | 73 B | ||
| 001 Question #25 - Network Time Delay.mp4 | 39.6 MB | ||
| 001 Question #25 - Network Time Delay_en.srt | 17.48 KB | ||
| 002 Thinking About How To Approach The Problem.mp4 | 13.6 MB | ||
| 002 Thinking About How To Approach The Problem_en.srt | 13.14 KB | ||
| 003 Greedy Method & What Is Dijkstra's Algorithm.mp4 | 48.41 MB | ||
| 003 Greedy Method & What Is Dijkstra's Algorithm_en.srt | 22.2 KB | ||
| 004 Thinking About A Solution With Dijkstra's Algorithm.mp4 | 28.1 MB | ||
| 004 Thinking About A Solution With Dijkstra's Algorithm_en.srt | 13.17 KB | ||
| 005 Coding Our Solution With Dijkstra.mp4 | 108.29 MB | ||
| 005 Coding Our Solution With Dijkstra_en.srt | 23.36 KB | ||
| 005 Dijkstra-s-Algorithm-Solution-Code-Repl.url | 100 B | ||
| 006 Time And Space Complexity Of Our Solution.mp4 | 32.92 MB | ||
| 006 Time And Space Complexity Of Our Solution_en.srt | 18.85 KB | ||
| 007 Thinking About Negative Weights.mp4 | 34.62 MB | ||
| 007 Thinking About Negative Weights_en.srt | 11.73 KB | ||
| 008 What is The Bellman-Ford Algorithm - Conceptualizing Dynamic Programming.mp4 | 29.58 MB | ||
| 008 What is The Bellman-Ford Algorithm - Conceptualizing Dynamic Programming_en.srt | 22.08 KB | ||
| 009 What is The Bellman-Ford Algorithm - The Algorithm Itself.mp4 | 23.33 MB | ||
| 009 What is The Bellman-Ford Algorithm - The Algorithm Itself_en.srt | 23.79 KB | ||
| 010 Bellman-Ford-Solution-Code-Repl.url | 111 B | ||
| 010 Coding Our Solution With Bellman-Ford.mp4 | 20.53 MB | ||
| 010 Coding Our Solution With Bellman-Ford_en.srt | 11.62 KB | ||
| external-links.txt | 334 B | ||
| 31 - Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy) | |||
| 001 Leetcode-Question-Link.url | 79 B | ||
| 002 Understanding & Identifying Recurrence Relation.mp4 | 36.43 MB | ||
| 002 Understanding & Identifying Recurrence Relation_en.srt | 21.42 KB | ||
| 003 First Step - Recursive Solution From Recurrence Relation.mp4 | 11.33 MB | ||
| 003 Top-Down-Recursive-Solution-Code-Repl.url | 96 B | ||
| 004 Note Correction to space complexity.html | 524 B | ||
| 005 Second Step - Memoizing Our Redundant Recursive Calls.mp4 | 23.12 MB | ||
| 005 Second Step - Memoizing Our Redundant Recursive Calls_en.srt | 10.44 KB | ||
| 006 Coding Our Memoization Optimization.mp4 | 19.88 MB | ||
| 006 Coding Our Memoization Optimization_en.srt | 11.04 KB | ||
| 007 Understanding The Bottom Up Approach (Tabulation).mp4 | 9.23 MB | ||
| 007 Understanding The Bottom Up Approach (Tabulation)_en.srt | 10.01 KB | ||
| 008 Bottom-Up-Iterative-Solution-Code-Repl.url | 97 B | ||
| 008 Third Step - Bottom Up Tabulation.mp4 | 18.21 MB | ||
| 008 Third Step - Bottom Up Tabulation_en.srt | 7.77 KB | ||
| 009 Bottom-Up-Optimized-Solution-Code-Repl.url | 115 B | ||
| 009 Fourth Step - Bottom Up Optimization.mp4 | 22.06 MB | ||
| 009 Fourth Step - Bottom Up Optimization_en.srt | 9.5 KB | ||
| external-links.txt | 466 B | ||
| 32 - Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium) | |||
| 001 Leetcode-Question-Link.url | 87 B | ||
| 001 Question #27 - Knight Probability In Chessboard.mp4 | 58.42 MB | ||
| 001 Question #27 - Knight Probability In Chessboard_en.srt | 15.71 KB | ||
| 002 Thinking About Test Cases To Help Us.mp4 | 3.95 MB | ||
| 002 Thinking About Test Cases To Help Us_en.srt | 5.85 KB | ||
| 003 Identifying The Recurrence Relation.mp4 | 20.56 MB | ||
| 003 Identifying The Recurrence Relation_en.srt | 23.22 KB | ||
| 004 Top-Down-Recursive-Solution-Code-Repl.url | 104 B | ||
| 005 Second Step - Memoizing Our Redundant Recursive Calls.mp4 | 46.39 MB | ||
| 005 Top-Down-With-Memoization-Solution-Code-Repl.url | 111 B | ||
| 006 Figuring Out The Logic For Our Bottom Up Solution.mp4 | 50.68 MB | ||
| 006 Figuring Out The Logic For Our Bottom Up Solution_en.srt | 20.08 KB | ||
| 007 Bottom-Up-Iterative-Solution-Code-Repl.url | 104 B | ||
| 007 Third Step - Bottom Up Tabulation.mp4 | 28.04 MB | ||
| 007 Third Step - Bottom Up Tabulation_en.srt | 11.28 KB | ||
| 008 Bottom-Up-Optimized-Solution-Code-Repl.url | 114 B | ||
| 008 Fourth Step - Bottom Up Optimization.mp4 | 28.38 MB | ||
| 008 Fourth Step - Bottom Up Optimization_en.srt | 8.84 KB | ||
| 009 Dynamic Programming List.html | 2.71 KB | ||
| GetFreeCourses.Co.url | 116 B | ||
| external-links.txt | 629 B | ||
| 33 - Backtracking - Question #28 - Sudoku Solver (Hard) | |||
| 001 Understanding The Basics Of Backtracking.mp4 | 22.28 MB | ||
| 001 Understanding The Basics Of Backtracking_en.srt | 10.49 KB | ||
| 002 Question #28 - Sudoku Solver.mp4 | 18.86 MB | ||
| 002 Question #28 - Sudoku Solver_en.srt | 6.72 KB | ||
| 002 Sudoku-Solver-Leetcode-Question.url | 68 B | ||
| 003 Learning The Backtracking Template.mp4 | 16.54 MB | ||
| 003 Learning The Backtracking Template_en.srt | 17.47 KB | ||
| 004 Applying Our Backtracking Template To Sudoku Solver Logic.mp4 | 10.14 MB | ||
| 004 Applying Our Backtracking Template To Sudoku Solver Logic_en.srt | 10.06 KB | ||
| 005 Backtracking-Solution-Code-Repl.url | 66 B | ||
| 005 Coding How To Get Box ID.mp4 | 14.24 MB | ||
| 005 Coding How To Get Box ID_en.srt | 11.07 KB | ||
| 006 Backtracking-Solution-Code-Repl.url | 66 B | ||
| 006 Setting Up Our Solution Code.mp4 | 15.72 MB | ||
| 006 Setting Up Our Solution Code_en.srt | 9.61 KB | ||
| 007 Coding The Recursive Backtracking Portion Of Our Solution.mp4 | 45.08 MB | ||
| 007 Coding The Recursive Backtracking Portion Of Our Solution_en.srt | 26.77 KB | ||
| 008 N-Queens-Problem-Solution-Walkthrough-Repl.url | 69 B | ||
| 008 Palindrome-Partitioning-Problem-Solution-Walkthrough-Repl.url | 85 B | ||
| 008 Thinking About The Space And Time Complexity.mp4 | 45.19 MB | ||
| 008 Thinking About The Space And Time Complexity_en.srt | 11.07 KB | ||
| external-links.txt | 476 B | ||
| 34 - Interface Design - Question #29 - Monarchy | |||
| 001 Understanding Interface Design & Question #29 - Monarchy.mp4 | 33.8 MB | ||
| 001 Understanding Interface Design & Question #29 - Monarchy_en.srt | 16.64 KB | ||
| 002 Figuring Out Our Test Cases.mp4 | 14.2 MB | ||
| 002 Figuring Out Our Test Cases_en.srt | 9.49 KB | ||
| 003 Thinking About The Logical Of The Monarchy.mp4 | 23.62 MB | ||
| 003 Thinking About The Logical Of The Monarchy_en.srt | 14.97 KB | ||
| 004 Coding Our Monarchy Solution.mp4 | 19.55 MB | ||
| 004 Coding Our Monarchy Solution_en.srt | 20.33 KB | ||
| 004 Monarchy-Code-Solution-REPL.url | 79 B | ||
| GetFreeCourses.Co.url | 116 B | ||
| external-links.txt | 92 B | ||
| 35 - Tries - Question #30 - Implement Prefix Trie (Medium) | |||
| 001 Introducing Tries.mp4 | 3.49 MB | ||
| 001 Introducing Tries_en.srt | 1.5 KB | ||
| 002 Implement-Prefix-Trie-Leetcode-Question.url | 81 B | ||
| 002 Question #30 - Implement Prefix Trie.mp4 | 29.31 MB | ||
| 002 Question #30 - Implement Prefix Trie_en.srt | 15.96 KB | ||
| 003 Understanding The Logic For Our Methods.mp4 | 7.45 MB | ||
| 003 Understanding The Logic For Our Methods_en.srt | 5.37 KB | ||
| 004 Implementing Our Prefix Trie Data Structure Solution.mp4 | 23.92 MB | ||
| 004 Implementing Our Prefix Trie Data Structure Solution_en.srt | 20.41 KB | ||
| 004 Trie-Class-Implementation-Code-Repl.url | 74 B | ||
| external-links.txt | 201 B | ||
| 36 - Where To Go From Here | |||
| 001 Thank You!.mp4 | 4.08 MB | ||
| 001 Thank You!_en.srt | 1.86 KB | ||
| 002 Learning Guideline.html | 336 B | ||
| 003 LinkedIn Endorsements.html | 1.37 KB | ||
| 004 Become An Alumni.html | 1.02 KB | ||
| 005 Coding Challenges.html | 860 B | ||
| 37 - Appendix Big O | |||
| 001 Section Overview.mp4 | 7.58 MB | ||
| 001 Section Overview_en.srt | 3.33 KB | ||
| 002 What Is Good Code.mp4 | 27.56 MB | ||
| 002 What Is Good Code_en.srt | 8.74 KB | ||
| 002 findNemo-Repl.url | 67 B | ||
| 003 Big O and Scalability.mp4 | 47.91 MB | ||
| 003 Big O and Scalability_en.srt | 14.72 KB | ||
| 003 findNemo2-Replt.url | 62 B | ||
| 004 BigO-cheat-sheet.pdf.zip | 26.57 KB | ||
| 004 O(n).mp4 | 44.77 MB | ||
| 004 O(n)_en.srt | 6.9 KB | ||
| 005 O(1).mp4 | 25.34 MB | ||
| 005 O(1)_en.srt | 7.35 KB | ||
| 006 Exercise Big O Calculation.html | 580 B | ||
| 007 Solution Big O Calculation.mp4 | 11.62 MB | ||
| 007 Solution Big O Calculation_en.srt | 7.36 KB | ||
| 008 Exercise Big O Calculation 2.html | 988 B | ||
| 009 Solution Big O Calculation 2.mp4 | 5.97 MB | ||
| 009 Solution Big O Calculation 2_en.srt | 2.99 KB | ||
| 010 Simplifying Big O.mp4 | 4.79 MB | ||
| 010 Simplifying Big O_en.srt | 2.43 KB | ||
| 011 Big O Rule 1.mp4 | 11.95 MB | ||
| 011 Big O Rule 1_en.srt | 5.31 KB | ||
| 011 findNemo.url | 59 B | ||
| 012 Big O Rule 2.mp4 | 17.07 MB | ||
| 012 Big O Rule 2_en.srt | 7.89 KB | ||
| 012 Code-Repl.url | 114 B | ||
| 013 Big O Rule 3.mp4 | 6.81 MB | ||
| 013 Big O Rule 3_en.srt | 3.69 KB | ||
| 014 Code-Repl.url | 96 B | ||
| 014 O(n^2).mp4 | 23.85 MB | ||
| 014 O(n^2)_en.srt | 8.03 KB | ||
| 015 Big O Rule 4.mp4 | 22.17 MB | ||
| 015 Big O Rule 4_en.srt | 8.42 KB | ||
| 015 Code-Repl.url | 100 B | ||
| 016 Big O Cheat Sheet.mp4 | 8.93 MB | ||
| 016 Big O Cheat Sheet_en.srt | 4.54 KB | ||
| 016 BigO-cheat-sheet.pdf.zip | 26.57 KB | ||
| 017 What Does This All Mean.mp4 | 46.69 MB | ||
| 017 What Does This All Mean_en.srt | 6.97 KB | ||
| 018 O(n!).mp4 | 3.84 MB | ||
| 018 O(n!)_en.srt | 1.84 KB | ||
| 018 O-n-Example.url | 81 B | ||
| 019 3 Pillars Of Programming.mp4 | 10.98 MB | ||
| 019 3 Pillars Of Programming_en.srt | 4.75 KB | ||
| 020 Space Complexity.mp4 | 6.89 MB | ||
| 020 Space Complexity_en.srt | 2.63 KB | ||
| 021 Code-Repl.url | 85 B | ||
| 021 Exercise Space Complexity.mp4 | 15.17 MB | ||
| 021 Exercise Space Complexity_en.srt | 7.21 KB | ||
| 022 Exercise Twitter.mp4 | 25.81 MB | ||
| 022 Exercise Twitter_en.srt | 8.17 KB | ||
| 023 Section Summary.mp4 | 14.64 MB | ||
| 023 Section Summary_en.srt | 5.72 KB | ||
| external-links.txt | 635 B | ||
| 38 - Appendix Arrays | |||
| 001 Arrays Introduction.mp4 | 29.73 MB | ||
| 001 Arrays Introduction_en.srt | 16.15 KB | ||
| 001 Code-Repl.url | 71 B | ||
| 002 Static vs Dynamic Arrays.mp4 | 15.76 MB | ||
| 002 Static vs Dynamic Arrays_en.srt | 7.58 KB | ||
| 003 Code-Repl.url | 84 B | ||
| 003 Optional Implementing An Array.mp4 | 54.88 MB | ||
| 003 Optional Implementing An Array_en.srt | 20.1 KB | ||
| external-links.txt | 145 B | ||
| 39 - Appendix Hash Tables | |||
| 001 Hash Tables Introduction.mp4 | 13.04 MB | ||
| 001 Hash Tables Introduction_en.srt | 5.1 KB | ||
| 002 Hash Function.mp4 | 26.76 MB | ||
| 002 Hash Function_en.srt | 6.73 KB | ||
| 002 MD5.url | 68 B | ||
| 003 Hash Collisions.mp4 | 61.46 MB | ||
| 003 Hash Collisions_en.srt | 11.38 KB | ||
| 003 Hash-Table-Animation.url | 84 B | ||
| 003 Hash-Table-Wiki.url | 64 B | ||
| 004 Hash Tables VS Arrays.mp4 | 6.1 MB | ||
| 004 Hash Tables VS Arrays_en.srt | 2.63 KB | ||
| external-links.txt | 212 B | ||
| 40 - Appendix Linked Lists | |||
| 001 Linked Lists Introduction.mp4 | 7.74 MB | ||
| 001 Linked Lists Introduction_en.srt | 3 KB | ||
| 002 Code-Repl.url | 78 B | ||
| 002 What Is A Linked List.mp4 | 11.17 MB | ||
| 002 What Is A Linked List_en.srt | 5.5 KB | ||
| 003 Exercise Why Linked Lists.mp4 | 2.95 MB | ||
| 003 Exercise Why Linked Lists_en.srt | 2.84 KB | ||
| 003 Linked-List-Visualized.url | 52 B | ||
| 004 Solution Why Linked Lists.mp4 | 17.5 MB | ||
| 004 Solution Why Linked Lists_en.srt | 7.12 KB | ||
| 005 What Is A Pointer.mp4 | 12.31 MB | ||
| 005 What Is A Pointer_en.srt | 6.37 KB | ||
| 006 Doubly Linked Lists.mp4 | 10.48 MB | ||
| 006 Doubly Linked Lists_en.srt | 4.11 KB | ||
| 007 Singly VS Doubly Linked Lists.mp4 | 8.54 MB | ||
| 007 Singly VS Doubly Linked Lists_en.srt | 3.49 KB | ||
| 008 Array-vs-Linked-Lists.url | 67 B | ||
| 008 Linked Lists Review.mp4 | 20.85 MB | ||
| 008 Linked Lists Review_en.srt | 5.76 KB | ||
| 008 Technical-Interview-Map.url | 89 B | ||
| external-links.txt | 305 B | ||
| 41 - Appendix Stacks + Queues | |||
| 001 Stacks + Queues Introduction.mp4 | 9.23 MB | ||
| 001 Stacks + Queues Introduction_en.srt | 3.86 KB | ||
| 002 Stacks.mp4 | 10.9 MB | ||
| 002 Stacks_en.srt | 4.47 KB | ||
| 003 Queues.mp4 | 11.05 MB | ||
| 003 Queues_en.srt | 4.57 KB | ||
| 004 Exercise Stacks VS Queues.mp4 | 4.99 MB | ||
| 004 Exercise Stacks VS Queues_en.srt | 3.5 KB | ||
| 005 Solution Stacks VS Queues.mp4 | 6.38 MB | ||
| 005 Solution Stacks VS Queues_en.srt | 4.51 KB | ||
| 006 Stacks + Queues Review.mp4 | 9.72 MB | ||
| 006 Stacks + Queues Review_en.srt | 2.85 KB | ||
| 006 Technical-Interview-Map.url | 116 B | ||
| GetFreeCourses.Co.url | 116 B | ||
| external-links.txt | 125 B | ||
| 42 - Appendix Trees | |||
| 001 Technical-Interview-Map.url | 116 B | ||
| 001 Trees Introduction.mp4 | 54.8 MB | ||
| 001 Trees Introduction_en.srt | 7.9 KB | ||
| 002 Binary Trees.mp4 | 22.66 MB | ||
| 002 Binary Trees_en.srt | 7.17 KB | ||
| 003 O(log n).mp4 | 20.15 MB | ||
| 003 O(log n)_en.srt | 8.6 KB | ||
| 004 BST-Visualized.url | 51 B | ||
| 004 Binary Search Trees.mp4 | 16.75 MB | ||
| 004 Binary Search Trees_en.srt | 7.55 KB | ||
| 005 Balanced VS Unbalanced BST.mp4 | 23.5 MB | ||
| 005 Balanced VS Unbalanced BST_en.srt | 4.49 KB | ||
| 005 https-www.bigocheatsheet.com-.url | 55 B | ||
| 006 BST Pros and Cons.mp4 | 7.6 MB | ||
| 006 BST Pros and Cons_en.srt | 2.97 KB | ||
| 007 Tries.mp4 | 10.14 MB | ||
| 007 Tries_en.srt | 4 KB | ||
| external-links.txt | 246 B | ||
| 43 - Appendix Searching + BFS + DFS | |||
| 001 Graph + Tree Traversals.mp4 | 11.53 MB | ||
| 001 Graph + Tree Traversals_en.srt | 4.63 KB | ||
| 001 Technical-Interview-Map.url | 116 B | ||
| 002 BFS Introduction.mp4 | 7.44 MB | ||
| 002 BFS Introduction_en.srt | 3.35 KB | ||
| 002 Code-Repl.url | 71 B | ||
| 003 Code-Repl.url | 71 B | ||
| 003 DFS Introduction.mp4 | 9.39 MB | ||
| 003 DFS Introduction_en.srt | 4.49 KB | ||
| 004 BFS vs DFS.mp4 | 9.98 MB | ||
| 004 BFS vs DFS_en.srt | 4.24 KB | ||
| 005 Exercise BFS vs DFS.mp4 | 1.65 MB | ||
| 005 Exercise BFS vs DFS_en.srt | 1.04 KB | ||
| 005 Exercise-Repl.url | 74 B | ||
| 006 Solution BFS vs DFS.mp4 | 7.67 MB | ||
| 006 Solution BFS vs DFS_en.srt | 4.32 KB | ||
| 006 Solution-Repl.url | 72 B | ||
| 007 breadthFirstSearch().mp4 | 36.21 MB | ||
| 007 breadthFirstSearch()_en.srt | 10.51 KB | ||
| 008 PreOrder, InOrder, PostOrder.mp4 | 14.06 MB | ||
| 008 PreOrder, InOrder, PostOrder_en.srt | 6.1 KB | ||
| 009 depthFirstSearch().mp4 | 38.54 MB | ||
| 009 depthFirstSearch()_en.srt | 13.47 KB | ||
| external-links.txt | 401 B | ||
| 44 - Appendix Recursion | |||
| 001 Recursion Introduction.mp4 | 32.86 MB | ||
| 001 Recursion Introduction_en.srt | 7.13 KB | ||
| 002 Stack Overflow.mp4 | 20.43 MB | ||
| 002 Stack Overflow_en.srt | 8.36 KB | ||
| 003 Anatomy Of Recursion.mp4 | 49.52 MB | ||
| 003 Anatomy Of Recursion_en.srt | 12.85 KB | ||
| 004 Recursive VS Iterative.mp4 | 12.42 MB | ||
| 004 Recursive VS Iterative_en.srt | 4.88 KB | ||
| 004 What-is-Tail-Call-Optimization.url | 78 B | ||
| 005 Code-Repl.url | 79 B | ||
| 005 When To Use Recursion.mp4 | 15.91 MB | ||
| 005 When To Use Recursion_en.srt | 4.83 KB | ||
| 006 Recursion Review.mp4 | 8.56 MB | ||
| 006 Recursion Review_en.srt | 3.16 KB | ||
| 006 Technical-Interview-Map.url | 116 B | ||
| external-links.txt | 293 B | ||
| 45 - Appendix Sorting | |||
| 001 Sorting Introduction.mp4 | 20.64 MB | ||
| 001 Sorting Introduction_en.srt | 9.53 KB | ||
| 002 The Issue With sort().mp4 | 29.53 MB | ||
| 002 The Issue With sort()_en.srt | 8.71 KB | ||
| 003 Sorting Algorithms.mp4 | 24.72 MB | ||
| 003 Sorting Algorithms_en.srt | 5.02 KB | ||
| 003 Technical-Interview-Map.url | 116 B | ||
| 003 https-www.toptal.com-developers-sorting-algorithms.url | 76 B | ||
| 004 Bubble Sort.mp4 | 18.79 MB | ||
| 004 Bubble Sort_en.srt | 5.09 KB | ||
| 004 https-www.bigocheatsheet.com-.url | 55 B | ||
| 005 Exercise Bubble Sort.html | 131 B | ||
| 005 Exercise-Repl.url | 77 B | ||
| 006 Solution Bubble Sort.mp4 | 13.21 MB | ||
| 006 Solution Bubble Sort_en.srt | 6.01 KB | ||
| 006 Solution-Repl.url | 68 B | ||
| 007 Selection Sort.mp4 | 23.23 MB | ||
| 007 Selection Sort_en.srt | 3.44 KB | ||
| 008 Exercise Selection Sort.html | 134 B | ||
| 008 Exercise-Repl.url | 72 B | ||
| 009 Solution Selection Sort.mp4 | 16.39 MB | ||
| 009 Solution Selection Sort_en.srt | 3 KB | ||
| 009 Solution-Repl.url | 63 B | ||
| 010 Dancing Algorithms.mp4 | 16.49 MB | ||
| 010 Dancing Algorithms_en.srt | 2.03 KB | ||
| 010 Dancing-Algorithms-Videos.url | 72 B | ||
| 011 Insertion Sort.mp4 | 7.27 MB | ||
| 011 Insertion Sort_en.srt | 3.6 KB | ||
| 012 Exercise Insertion Sort.html | 134 B | ||
| 012 Exercise-Repl.url | 72 B | ||
| 013 Solution Insertion Sort.mp4 | 12.47 MB | ||
| 013 Solution Insertion Sort_en.srt | 2.57 KB | ||
| 013 Solution-Repl.url | 71 B | ||
| 014 Merge Sort and O(n log n).mp4 | 62.95 MB | ||
| 014 Merge Sort and O(n log n)_en.srt | 11.1 KB | ||
| 015 Exercise Merge Sort.html | 134 B | ||
| 015 Exercise-Repl.url | 76 B | ||
| 016 Solution Merge Sort.mp4 | 19.27 MB | ||
| 016 Solution Merge Sort_en.srt | 5.29 KB | ||
| 016 Solution-Repl.url | 59 B | ||
| 017 Quick Sort.mp4 | 32.41 MB | ||
| 017 Quick Sort_en.srt | 10.46 KB | ||
| external-links.txt | 940 B | ||
| 46 - BONUS SECTION | |||
| 001 Special Bonus Lecture.html | 1.21 KB | ||
| Download Paid Udemy Courses For Free.url | 116 B | ||
| GetFreeCourses.Co.url | 116 B | ||
| ▲ 761 total files | |||
Master the Coding Interview: Big Tech (FAANG) Interviews
Ace the Google, Amazon, Meta, Microsoft, Netflix coding interviews. Step by step guide for their toughest questions!
Udemy link - https://www.udemy.com/course/master-the-coding-interview-big-tech-faang-interviews/
Please seed as much as you can!
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
| 1.4 GB | freecoursewb | 3 days | 0 | 0 | |
|
Udemy - The Essentials of Leadership - Master Core Leadership Skills Posted by
freecoursewb in Other
|
3.7 GB | freecoursewb | 1 month | 14 | 2 |
| 3 GB | freecoursewb | 1 month | 0 | 0 | |
| 974.9 MB | freecoursewb | 1 month | 0 | 0 | |
| 3.3 GB | freecoursewb | 3 months | 4 | 0 |
All Comments