ZeroToMastery - Master the Coding Interview Big Tech (FAANG) Interviews (4.2025)

File Name

Size

1. Introduction/2. Course Breakdown.mp4

84 MB

1. Introduction/1. Master The Coding Interview Big Tech (FAANG) Interview.mp4

31 MB

1. Introduction/2. Course Breakdown.en.srt

18 kB

1. Introduction/6. Set Your Learning Streak Goal.html

7.0 kB

1. Introduction/4. Download All Code + Solutions.html

6.6 kB

1. Introduction/5. ZTM Plugin + Understanding Your Video Player.html

6.1 kB

1. Introduction/3. Exercise Meet Your Classmates and Instructor.html

4.5 kB

1. Introduction/1. Master The Coding Interview Big Tech (FAANG) Interview.en.srt

4.0 kB

10. Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/1. Interview Question #8 - Merge Multi-Level Doubly Linked List.mp4

83 MB

10. Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/3. Thinking About Our Approach.mp4

44 MB

10. Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/4. Coding Out Our Solution.mp4

44 MB

10. Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/2. Figuring Out Our Test Cases.mp4

17 MB

10. Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/3. Thinking About Our Approach.en.srt

27 kB

10. Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/4. Coding Out Our Solution.en.srt

23 kB

10. Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/1. Interview Question #8 - Merge Multi-Level Doubly Linked List.en.srt

14 kB

10. Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/2. Figuring Out Our Test Cases.en.srt

13 kB

11. Linked List - Question #9 - Cycle Detection (Medium)/4. Optional Proof Of How Floyd's Algorithm Works.mp4

59 MB

11. Linked List - Question #9 - Cycle Detection (Medium)/1. Interview Question #9 - Cycle Detection.mp4

44 MB

11. Linked List - Question #9 - Cycle Detection (Medium)/2. Floyd's Tortoise And Hare.mp4

28 MB

11. Linked List - Question #9 - Cycle Detection (Medium)/3. Coding Floyd's Algorithm.mp4

20 MB

11. Linked List - Question #9 - Cycle Detection (Medium)/4. Optional Proof Of How Floyd's Algorithm Works.en.srt

38 kB

11. Linked List - Question #9 - Cycle Detection (Medium)/1. Interview Question #9 - Cycle Detection.en.srt

17 kB

11. Linked List - Question #9 - Cycle Detection (Medium)/3. Coding Floyd's Algorithm.en.srt

12 kB

11. Linked List - Question #9 - Cycle Detection (Medium)/2. Floyd's Tortoise And Hare.en.srt

4.9 kB

12. Stacks - Question #10 - Valid Parentheses (Easy)/2. Interview Question #10 - Valid Parentheses.mp4

59 MB

12. Stacks - Question #10 - Valid Parentheses (Easy)/1. Intro to Stacks and Queues.mp4

29 MB

12. Stacks - Question #10 - Valid Parentheses (Easy)/4. Coding Our Solution With A Stack.mp4

22 MB

12. Stacks - Question #10 - Valid Parentheses (Easy)/3. Walking Through Our Problem - Identifying The Need For A Stack.mp4

13 MB

12. Stacks - Question #10 - Valid Parentheses (Easy)/4. Coding Our Solution With A Stack.en.srt

14 kB

12. Stacks - Question #10 - Valid Parentheses (Easy)/3. Walking Through Our Problem - Identifying The Need For A Stack.en.srt

14 kB

12. Stacks - Question #10 - Valid Parentheses (Easy)/2. Interview Question #10 - Valid Parentheses.en.srt

13 kB

12. Stacks - Question #10 - Valid Parentheses (Easy)/1. Intro to Stacks and Queues.en.srt

4.4 kB

13. Stacks - Question #11 - Minimum Brackets To Remove (Medium)/1. Interview Question #11 - Minimum Brackets To Remove.mp4

54 MB

13. Stacks - Question #11 - Minimum Brackets To Remove (Medium)/3. Coding Our Solution.mp4

28 MB

13. Stacks - Question #11 - Minimum Brackets To Remove (Medium)/2. Thinking About Our Solution.mp4

21 MB

13. Stacks - Question #11 - Minimum Brackets To Remove (Medium)/2. Thinking About Our Solution.en.srt

21 kB

13. Stacks - Question #11 - Minimum Brackets To Remove (Medium)/3. Coding Our Solution.en.srt

16 kB

13. Stacks - Question #11 - Minimum Brackets To Remove (Medium)/1. Interview Question #11 - Minimum Brackets To Remove.en.srt

11 kB

14. Queues - Question #12 - Implement Queue With Stacks (Easy)/1. Question #12 - Implement Queue With Stacks.mp4

39 MB

14. Queues - Question #12 - Implement Queue With Stacks (Easy)/3. Coding Our Solution.mp4

19 MB

14. Queues - Question #12 - Implement Queue With Stacks (Easy)/2. Figuring Out Our Solution.mp4

18 MB

14. Queues - Question #12 - Implement Queue With Stacks (Easy)/2. Figuring Out Our Solution.en.srt

15 kB

14. Queues - Question #12 - Implement Queue With Stacks (Easy)/3. Coding Our Solution.en.srt

12 kB

14. Queues - Question #12 - Implement Queue With Stacks (Easy)/1. Question #12 - Implement Queue With Stacks.en.srt

6.4 kB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/2. Optional Tail Recursion.mp4

142 MB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/6. Understanding Divide And Conquer.mp4

74 MB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/4. Interview Question #13 - Kth Largest Element.mp4

43 MB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/9. Coding Our Solution With Quickselect.mp4

38 MB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/7. Coding Quicksort Into Our Solution.mp4

36 MB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/1. Introducing Recursion.mp4

28 MB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/5. Insights From Quick Sort.mp4

23 MB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/3. Sorting.mp4

21 MB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/8. Understanding Hoare's Quickselect Algorithm.mp4

14 MB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/10. Correction About Time Complexity!.html

90 kB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/2. Optional Tail Recursion.en.srt

32 kB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/7. Coding Quicksort Into Our Solution.en.srt

20 kB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/5. Insights From Quick Sort.en.srt

19 kB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/9. Coding Our Solution With Quickselect.en.srt

18 kB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/4. Interview Question #13 - Kth Largest Element.en.srt

11 kB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/8. Understanding Hoare's Quickselect Algorithm.en.srt

11 kB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/6. Understanding Divide And Conquer.en.srt

11 kB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/1. Introducing Recursion.en.srt

4.9 kB

15. Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/3. Sorting.en.srt

3.5 kB

16. Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/1. Understanding Binary Search.mp4

86 MB

16. Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/5. Coding Our Solution.mp4

37 MB

16. Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/3. Question #14 - Start And End Of Target In A Sorted Array.mp4

34 MB

16. Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/4. Walking Through Our Solution.mp4

20 MB

16. Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/2. How To Code Binary Search.mp4

14 MB

16. Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/5. Coding Our Solution.en.srt

19 kB

16. Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/4. Walking Through Our Solution.en.srt

17 kB

16. Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/1. Understanding Binary Search.en.srt

14 kB

16. Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/2. How To Code Binary Search.en.srt

9.9 kB

16. Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/3. Question #14 - Start And End Of Target In A Sorted Array.en.srt

7.4 kB

17. Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/3. Learning The Process For Solving Binary Tree Problems.mp4

44 MB

17. Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/2. Question #15 - Maximum Depth of Binary Tree.mp4

42 MB

17. Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/4. Coding Our Solution.mp4

19 MB

17. Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/1. Intro to Binary Trees.mp4

16 MB

17. Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/3. Learning The Process For Solving Binary Tree Problems.en.srt

30 kB

17. Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/2. Question #15 - Maximum Depth of Binary Tree.en.srt

10 kB

17. Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/4. Coding Our Solution.en.srt

8.4 kB

17. Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/1. Intro to Binary Trees.en.srt

2.6 kB

18. Binary Trees - Question #16 - Level Order Of Binary Tree (Medium)/2. Walking Through Our Solution.mp4

44 MB

18. Binary Trees - Question #16 - Level Order Of Binary Tree (Medium)/3. Coding Out Level Order Traversal.mp4

31 MB

18. Binary Trees - Question #16 - Level Order Of Binary Tree (Medium)/1. Question #16 - Level Order Of Binary Tree.mp4

30 MB

18. Binary Trees - Question #16 - Level Order Of Binary Tree (Medium)/2. Walking Through Our Solution.en.srt

28 kB

18. Binary Trees - Question #16 - Level Order Of Binary Tree (Medium)/3. Coding Out Level Order Traversal.en.srt

16 kB

18. Binary Trees - Question #16 - Level Order Of Binary Tree (Medium)/1. Question #16 - Level Order Of Binary Tree.en.srt

8.2 kB

19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/1. Question #17 - Right Side View of Tree.mp4

32 MB

19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/6. Coding Our Final DFS Solution.mp4

30 MB

19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/4. Thinking About Pre-Order, In-Order, and Post-Order Traversals For Our Solution.mp4

30 MB

19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/5. Completing Our DFS Solution.mp4

20 MB

19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/3. Understanding The Depth First Search Approach.mp4

19 MB

19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/2. Understanding The Breadth First Search Approach.mp4

17 MB

19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/6. Coding Our Final DFS Solution.en.srt

18 kB

19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/4. Thinking About Pre-Order, In-Order, and Post-Order Traversals For Our Solution.en.srt

18 kB

19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/3. Understanding The Depth First Search Approach.en.srt

14 kB

19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/2. Understanding The Breadth First Search Approach.en.srt

13 kB

19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/5. Completing Our DFS Solution.en.srt

13 kB

19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/1. Question #17 - Right Side View of Tree.en.srt

10 kB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/1. Interview Question #1 Two Sum.mp4

68 MB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/6. Analyzing Space and Time Complexity.mp4

55 MB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/2. How To Approach Our Problem.mp4

27 MB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/4. Testing Our Solution With Our Test Cases.mp4

21 MB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/9. Testing Our Optimal Solution With Our Test Cases.mp4

19 MB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/7. Optimizing Our Solution.mp4

19 MB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/3. Writing Our Brute Force Solution.mp4

18 MB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/8. Coding Our Optimal Solution.mp4

12 MB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/10. Checking Performance On LeetCode.mp4

8.9 MB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/5. Submitting To Leetcode.mp4

6.6 MB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/12. Let's Have Some Fun (+ Free Resources).html

19 kB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/2. How To Approach Our Problem.en.srt

18 kB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/11. Solution In Other Languages.html

18 kB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/6. Analyzing Space and Time Complexity.en.srt

16 kB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/4. Testing Our Solution With Our Test Cases.en.srt

15 kB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/9. Testing Our Optimal Solution With Our Test Cases.en.srt

14 kB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/7. Optimizing Our Solution.en.srt

13 kB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/1. Interview Question #1 Two Sum.en.srt

12 kB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/3. Writing Our Brute Force Solution.en.srt

10 kB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/8. Coding Our Optimal Solution.en.srt

7.8 kB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/10. Checking Performance On LeetCode.en.srt

5.9 kB

2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/5. Submitting To Leetcode.en.srt

3.5 kB

20. Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/4. Coding Out Our Full Solution.mp4

57 MB

20. Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/1. Question #18 - Number Of Nodes In Complete Tree.mp4

42 MB

20. Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/3. Figuring Out Number Of Nodes At Last Level.mp4

41 MB

20. Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/2. Thinking Deeply About A Full Binary Tree.mp4

27 MB

20. Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/4. Coding Out Our Full Solution.en.srt

32 kB

20. Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/3. Figuring Out Number Of Nodes At Last Level.en.srt

24 kB

20. Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/2. Thinking Deeply About A Full Binary Tree.en.srt

17 kB

20. Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/1. Question #18 - Number Of Nodes In Complete Tree.en.srt

13 kB

21. Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/1. Question #19 - Validate Binary Search Tree.mp4

52 MB

21. Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/2. Thinking About Our Logical Solution.mp4

31 MB

21. Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/4. Coding Our Our Full Solution.mp4

18 MB

21. Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/3. Figuring Out Our Boundaries.mp4

18 MB

21. Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/2. Thinking About Our Logical Solution.en.srt

23 kB

21. Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/1. Question #19 - Validate Binary Search Tree.en.srt

13 kB

21. Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/4. Coding Our Our Full Solution.en.srt

11 kB

21. Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/3. Figuring Out Our Boundaries.en.srt

11 kB

22. Heaps & Priority Queues/1. Introducing Heaps.mp4

48 MB

22. Heaps & Priority Queues/6. Coding Our Deletion And Sift Down Methods.mp4

32 MB

22. Heaps & Priority Queues/3. Deletion In Heaps - Understanding Sift Down.mp4

24 MB

22. Heaps & Priority Queues/4. Starting To Code Our Priority Queue Class.mp4

19 MB

22. Heaps & Priority Queues/2. Insertion In Heaps - Understanding Sift Up.mp4

17 MB

22. Heaps & Priority Queues/5. Coding Our Insertion And Sift Up Methods.mp4

13 MB

22. Heaps & Priority Queues/3. Deletion In Heaps - Understanding Sift Down.en.srt

18 kB

22. Heaps & Priority Queues/6. Coding Our Deletion And Sift Down Methods.en.srt

18 kB

22. Heaps & Priority Queues/4. Starting To Code Our Priority Queue Class.en.srt

16 kB

22. Heaps & Priority Queues/1. Introducing Heaps.en.srt

12 kB

22. Heaps & Priority Queues/2. Insertion In Heaps - Understanding Sift Up.en.srt

11 kB

22. Heaps & Priority Queues/5. Coding Our Insertion And Sift Up Methods.en.srt

8.3 kB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/5. Breadth First Search In 2D-Arrays.mp4

69 MB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/1. Introducing 2D Arrays - What Are They.mp4

66 MB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/2. Depth First Search In 2D-Arrays.mp4

66 MB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/6. Coding BFS.mp4

28 MB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/4. Coding DFS - Implementing Recursive DFS.mp4

25 MB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/3. Coding DFS - Setting Up For DFS.mp4

22 MB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/7. Exercise Imposter Syndrome.mp4

20 MB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/5. Breadth First Search In 2D-Arrays.en.srt

16 kB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/6. Coding BFS.en.srt

15 kB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/3. Coding DFS - Setting Up For DFS.en.srt

14 kB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/4. Coding DFS - Implementing Recursive DFS.en.srt

12 kB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/2. Depth First Search In 2D-Arrays.en.srt

12 kB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/1. Introducing 2D Arrays - What Are They.en.srt

11 kB

23. Intro To 2D-Arrays - Basics & Traversal Algorithms/7. Exercise Imposter Syndrome.en.srt

4.8 kB

24. 2D-Arrays - Question #20 Number Of Islands (Medium)/1. A General Approach To Thinking About Most Graph Questions.mp4

77 MB

24. 2D-Arrays - Question #20 Number Of Islands (Medium)/5. Coding Our Solution.mp4

49 MB

24. 2D-Arrays - Question #20 Number Of Islands (Medium)/2. Question #20 Number Of Islands.mp4

44 MB

24. 2D-Arrays - Question #20 Number Of Islands (Medium)/6. Thinking About Space And Time Complexity.mp4

42 MB

24. 2D-Arrays - Question #20 Number Of Islands (Medium)/3. Approaching Our Problem - Thinking Deeply About The Values.mp4

38 MB

24. 2D-Arrays - Question #20 Number Of Islands (Medium)/4. Approaching Our Problem - Thinking About Traversals.mp4

21 MB

24. 2D-Arrays - Question #20 Number Of Islands (Medium)/5. Coding Our Solution.en.srt

28 kB

24. 2D-Arrays - Question #20 Number Of Islands (Medium)/3. Approaching Our Problem - Thinking Deeply About The Values.en.srt

26 kB

24. 2D-Arrays - Question #20 Number Of Islands (Medium)/6. Thinking About Space And Time Complexity.en.srt

24 kB

24. 2D-Arrays - Question #20 Number Of Islands (Medium)/4. Approaching Our Problem - Thinking About Traversals.en.srt

15 kB

24. 2D-Arrays - Question #20 Number Of Islands (Medium)/1. A General Approach To Thinking About Most Graph Questions.en.srt

14 kB

24. 2D-Arrays - Question #20 Number Of Islands (Medium)/2. Question #20 Number Of Islands.en.srt

11 kB

25. 2D-Arrays - Question #21 Rotting Oranges (Medium)/1. Question #21 Rotting Oranges.mp4

45 MB

25. 2D-Arrays - Question #21 Rotting Oranges (Medium)/4. Coding Out Our Solution.mp4

39 MB

25. 2D-Arrays - Question #21 Rotting Oranges (Medium)/3. Figuring Out The Rest Of Our Solution.mp4

32 MB

25. 2D-Arrays - Question #21 Rotting Oranges (Medium)/2. Figuring Out Our Initial Logic.mp4

22 MB

25. 2D-Arrays - Question #21 Rotting Oranges (Medium)/3. Figuring Out The Rest Of Our Solution.en.srt

23 kB

25. 2D-Arrays - Question #21 Rotting Oranges (Medium)/4. Coding Out Our Solution.en.srt

21 kB

25. 2D-Arrays - Question #21 Rotting Oranges (Medium)/2. Figuring Out Our Initial Logic.en.srt

17 kB

25. 2D-Arrays - Question #21 Rotting Oranges (Medium)/1. Question #21 Rotting Oranges.en.srt

11 kB

26. 2D-Arrays - Question #22 - Walls And Gates (Medium)/1. Question #22 - Walls And Gates.mp4

38 MB

26. 2D-Arrays - Question #22 - Walls And Gates (Medium)/3. Coding Out Our Solution.mp4

28 MB

26. 2D-Arrays - Question #22 - Walls And Gates (Medium)/2. Figuring Out Our Logical Solution.mp4

24 MB

26. 2D-Arrays - Question #22 - Walls And Gates (Medium)/2. Figuring Out Our Logical Solution.en.srt

20 kB

26. 2D-Arrays - Question #22 - Walls And Gates (Medium)/3. Coding Out Our Solution.en.srt

18 kB

26. 2D-Arrays - Question #22 - Walls And Gates (Medium)/1. Question #22 - Walls And Gates.en.srt

9.9 kB

27. Intro to Graphs - Representation & Traversal Algorithms/1. Introduction To The Types Of Graphs.mp4

100 MB

27. Intro to Graphs - Representation & Traversal Algorithms/2. Representing Our Graphs - Adjacency List & Adjacency Matrix.mp4

65 MB

27. Intro to Graphs - Representation & Traversal Algorithms/3. Breadth First Search In Graphs.mp4

45 MB

27. Intro to Graphs - Representation & Traversal Algorithms/5. Depth First Search In Graphs.mp4

24 MB

27. Intro to Graphs - Representation & Traversal Algorithms/4. Coding BFS.mp4

21 MB

27. Intro to Graphs - Representation & Traversal Algorithms/6. Coding DFS.mp4

19 MB

27. Intro to Graphs - Representation & Traversal Algorithms/1. Introduction To The Types Of Graphs.en.srt

18 kB

27. Intro to Graphs - Representation & Traversal Algorithms/4. Coding BFS.en.srt

12 kB

27. Intro to Graphs - Representation & Traversal Algorithms/2. Representing Our Graphs - Adjacency List & Adjacency Matrix.en.srt

12 kB

27. Intro to Graphs - Representation & Traversal Algorithms/6. Coding DFS.en.srt

11 kB

27. Intro to Graphs - Representation & Traversal Algorithms/3. Breadth First Search In Graphs.en.srt

8.5 kB

27. Intro to Graphs - Representation & Traversal Algorithms/5. Depth First Search In Graphs.en.srt

5.5 kB

28. Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/1. Question #23 - Time Needed to Inform All Employees.mp4

106 MB

28. Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/2. Verifying Our Constraints And Thinking About Test Cases.mp4

41 MB

28. Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/5. Coding Our DFS Solution.mp4

25 MB

28. Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/3. How To Represent Our Graph As An Adjacency List.mp4

20 MB

28. Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/4. Solving Our Problem Logically Using DFS Traversal.mp4

17 MB

28. Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/1. Question #23 - Time Needed to Inform All Employees.en.srt

20 kB

28. Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/5. Coding Our DFS Solution.en.srt

16 kB

28. Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/3. How To Represent Our Graph As An Adjacency List.en.srt

15 kB

28. Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/4. Solving Our Problem Logically Using DFS Traversal.en.srt

13 kB

28. Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/2. Verifying Our Constraints And Thinking About Test Cases.en.srt

13 kB

29. Graphs - Question #24 - Course Scheduler (Medium)/4. What is Topological Sort.mp4

71 MB

29. Graphs - Question #24 - Course Scheduler (Medium)/1. Question #24 - Course Scheduler.mp4

65 MB

29. Graphs - Question #24 - Course Scheduler (Medium)/5. Thinking About A Solution With Topological Sort.mp4

46 MB

29. Graphs - Question #24 - Course Scheduler (Medium)/6. Coding Our Final Solution.mp4

42 MB

29. Graphs - Question #24 - Course Scheduler (Medium)/3. Coding Out Our Initial BFS Solution.mp4

38 MB

29. Graphs - Question #24 - Course Scheduler (Medium)/2. Thinking About Our Initial Solution - BFS.mp4

11 MB

29. Graphs - Question #24 - Course Scheduler (Medium)/6. Coding Our Final Solution.en.srt

24 kB

29. Graphs - Question #24 - Course Scheduler (Medium)/3. Coding Out Our Initial BFS Solution.en.srt

23 kB

29. Graphs - Question #24 - Course Scheduler (Medium)/1. Question #24 - Course Scheduler.en.srt

16 kB

29. Graphs - Question #24 - Course Scheduler (Medium)/2. Thinking About Our Initial Solution - BFS.en.srt

12 kB

29. Graphs - Question #24 - Course Scheduler (Medium)/4. What is Topological Sort.en.srt

12 kB

29. Graphs - Question #24 - Course Scheduler (Medium)/5. Thinking About A Solution With Topological Sort.en.srt

7.8 kB

3. Arrays - Questions #2 - Container With Most Water (Medium)/3. Thinking Through A Logical Brute Force Solution.mp4

51 MB

3. Arrays - Questions #2 - Container With Most Water (Medium)/1. Interview Question #2 - Container With Most Water.mp4

44 MB

3. Arrays - Questions #2 - Container With Most Water (Medium)/7. Coding Our Optimal Solution And Testing On LeetCode.mp4

40 MB

3. Arrays - Questions #2 - Container With Most Water (Medium)/6. Thinking About Our Optimal Solution.mp4

28 MB

3. Arrays - Questions #2 - Container With Most Water (Medium)/4. Coding Out Our Brute Force Solution.mp4

20 MB

3. Arrays - Questions #2 - Container With Most Water (Medium)/5. Stepping Through Our Code.mp4

18 MB

3. Arrays - Questions #2 - Container With Most Water (Medium)/2. Coming Up With Test Cases.mp4

9.4 MB

3. Arrays - Questions #2 - Container With Most Water (Medium)/8. Unlimited Updates.html

26 kB

3. Arrays - Questions #2 - Container With Most Water (Medium)/6. Thinking About Our Optimal Solution.en.srt

21 kB

3. Arrays - Questions #2 - Container With Most Water (Medium)/3. Thinking Through A Logical Brute Force Solution.en.srt

17 kB

3. Arrays - Questions #2 - Container With Most Water (Medium)/7. Coding Our Optimal Solution And Testing On LeetCode.en.srt

14 kB

3. Arrays - Questions #2 - Container With Most Water (Medium)/4. Coding Out Our Brute Force Solution.en.srt

11 kB

3. Arrays - Questions #2 - Container With Most Water (Medium)/5. Stepping Through Our Code.en.srt

7.1 kB

3. Arrays - Questions #2 - Container With Most Water (Medium)/1. Interview Question #2 - Container With Most Water.en.srt

6.4 kB

3. Arrays - Questions #2 - Container With Most Water (Medium)/2. Coming Up With Test Cases.en.srt

5.8 kB

30. Graphs - Question #25 - Network Time Delay (Medium)/3. Greedy Method & What Is Dijkstra's Algorithm.mp4

141 MB

30. Graphs - Question #25 - Network Time Delay (Medium)/1. Question #25 - Network Time Delay.mp4

119 MB

30. Graphs - Question #25 - Network Time Delay (Medium)/4. Thinking About A Solution With Dijkstra's Algorithm.mp4

81 MB

30. Graphs - Question #25 - Network Time Delay (Medium)/5. Coding Our Solution With Dijkstra.mp4

52 MB

30. Graphs - Question #25 - Network Time Delay (Medium)/6. Time And Space Complexity Of Our Solution.mp4

44 MB

30. Graphs - Question #25 - Network Time Delay (Medium)/8. What is The Bellman-Ford Algorithm - Conceptualizing Dynamic Programming.mp4

40 MB

30. Graphs - Question #25 - Network Time Delay (Medium)/9. What is The Bellman-Ford Algorithm - The Algorithm Itself.mp4

32 MB

30. Graphs - Question #25 - Network Time Delay (Medium)/7. Thinking About Negative Weights.mp4

29 MB

30. Graphs - Question #25 - Network Time Delay (Medium)/10. Coding Our Solution With Bellman-Ford.mp4

23 MB

30. Graphs - Question #25 - Network Time Delay (Medium)/2. Thinking About How To Approach The Problem.mp4

18 MB

30. Graphs - Question #25 - Network Time Delay (Medium)/9. What is The Bellman-Ford Algorithm - The Algorithm Itself.en.srt

28 kB

30. Graphs - Question #25 - Network Time Delay (Medium)/3. Greedy Method & What Is Dijkstra's Algorithm.en.srt

25 kB

30. Graphs - Question #25 - Network Time Delay (Medium)/5. Coding Our Solution With Dijkstra.en.srt

25 kB

30. Graphs - Question #25 - Network Time Delay (Medium)/8. What is The Bellman-Ford Algorithm - Conceptualizing Dynamic Programming.en.srt

24 kB

30. Graphs - Question #25 - Network Time Delay (Medium)/6. Time And Space Complexity Of Our Solution.en.srt

21 kB

30. Graphs - Question #25 - Network Time Delay (Medium)/1. Question #25 - Network Time Delay.en.srt

19 kB

30. Graphs - Question #25 - Network Time Delay (Medium)/2. Thinking About How To Approach The Problem.en.srt

15 kB

30. Graphs - Question #25 - Network Time Delay (Medium)/4. Thinking About A Solution With Dijkstra's Algorithm.en.srt

15 kB

30. Graphs - Question #25 - Network Time Delay (Medium)/7. Thinking About Negative Weights.en.srt

13 kB

30. Graphs - Question #25 - Network Time Delay (Medium)/10. Coding Our Solution With Bellman-Ford.en.srt

13 kB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/1. Question #26 - Minimum Cost Of Climbing Stairs & How To Approach DP.mp4

89 MB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/2. Understanding & Identifying Recurrence Relation.mp4

41 MB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/5. Coding Our Memoization Optimization.mp4

23 MB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/4. Second Step - Memoizing Our Redundant Recursive Calls.mp4

18 MB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/8. Fourth Step - Bottom Up Optimization.mp4

18 MB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/7. Third Step - Bottom Up Tabulation.mp4

15 MB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/3. First Step - Recursive Solution From Recurrence Relation.mp4

14 MB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/6. Understanding The Bottom Up Approach (Tabulation).mp4

12 MB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/2. Understanding & Identifying Recurrence Relation.en.srt

23 kB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/1. Question #26 - Minimum Cost Of Climbing Stairs & How To Approach DP.en.srt

15 kB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/5. Coding Our Memoization Optimization.en.srt

12 kB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/4. Second Step - Memoizing Our Redundant Recursive Calls.en.srt

11 kB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/6. Understanding The Bottom Up Approach (Tabulation).en.srt

11 kB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/8. Fourth Step - Bottom Up Optimization.en.srt

10 kB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/7. Third Step - Bottom Up Tabulation.en.srt

8.3 kB

31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/3. First Step - Recursive Solution From Recurrence Relation.en.srt

8.1 kB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/1. Question #27 - Knight Probability In Chessboard.mp4

91 MB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/5. Second Step - Memoizing Our Redundant Recursive Calls.mp4

37 MB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/6. Figuring Out The Logic For Our Bottom Up Solution.mp4

35 MB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/3. Identifying The Recurrence Relation.mp4

28 MB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/8. Fourth Step - Bottom Up Optimization.mp4

22 MB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/7. Third Step - Bottom Up Tabulation.mp4

22 MB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/4. First Step - Recursive Solution From Recurrence Relation.mp4

11 MB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/2. Thinking About Test Cases To Help Us.mp4

5.8 MB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/9. Dynamic Programming Question List.html

185 kB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/3. Identifying The Recurrence Relation.en.srt

26 kB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/5. Second Step - Memoizing Our Redundant Recursive Calls.en.srt

22 kB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/6. Figuring Out The Logic For Our Bottom Up Solution.en.srt

22 kB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/1. Question #27 - Knight Probability In Chessboard.en.srt

18 kB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/7. Third Step - Bottom Up Tabulation.en.srt

11 kB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/8. Fourth Step - Bottom Up Optimization.en.srt

9.2 kB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/4. First Step - Recursive Solution From Recurrence Relation.en.srt

7.6 kB

32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/2. Thinking About Test Cases To Help Us.en.srt

6.4 kB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/1. Understanding The Basics Of Backtracking.mp4

65 MB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/7. Coding The Recursive Backtracking Portion Of Our Solution.mp4

52 MB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/2. Question #28 - Sudoku Solver.mp4

39 MB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/8. Thinking About The Space And Time Complexity.mp4

26 MB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/3. Learning The Backtracking Template.mp4

22 MB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/5. Coding How To Get Box ID.mp4

20 MB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/6. Setting Up Our Solution Code.mp4

18 MB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/4. Applying Our Backtracking Template To Sudoku Solver Logic.mp4

14 MB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/7. Coding The Recursive Backtracking Portion Of Our Solution.en.srt

28 kB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/3. Learning The Backtracking Template.en.srt

18 kB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/8. Thinking About The Space And Time Complexity.en.srt

12 kB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/1. Understanding The Basics Of Backtracking.en.srt

12 kB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/5. Coding How To Get Box ID.en.srt

11 kB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/4. Applying Our Backtracking Template To Sudoku Solver Logic.en.srt

11 kB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/6. Setting Up Our Solution Code.en.srt

10 kB

33. Backtracking - Question #28 - Sudoku Solver (Hard)/2. Question #28 - Sudoku Solver.en.srt

7.3 kB

34. Interface Design - Question #29 - Monarchy/1. Understanding Interface Design & Question #29 - Monarchy.mp4

100 MB

34. Interface Design - Question #29 - Monarchy/3. Thinking About The Logical Of The Monarchy.mp4

32 MB

34. Interface Design - Question #29 - Monarchy/4. Coding Our Monarchy Solution.mp4

30 MB

34. Interface Design - Question #29 - Monarchy/2. Figuring Out Our Test Cases.mp4

19 MB

34. Interface Design - Question #29 - Monarchy/4. Coding Our Monarchy Solution.en.srt

22 kB

34. Interface Design - Question #29 - Monarchy/1. Understanding Interface Design & Question #29 - Monarchy.en.srt

18 kB

34. Interface Design - Question #29 - Monarchy/3. Thinking About The Logical Of The Monarchy.en.srt

17 kB

34. Interface Design - Question #29 - Monarchy/2. Figuring Out Our Test Cases.en.srt

10 kB

35. Tries - Question #30 - Implement Prefix Trie (Medium)/2. Question #30 - Implement Prefix Trie.mp4

81 MB

35. Tries - Question #30 - Implement Prefix Trie (Medium)/4. Implementing Our Prefix Trie Data Structure Solution.mp4

29 MB

35. Tries - Question #30 - Implement Prefix Trie (Medium)/1. Introducing Tries.mp4

10 MB

35. Tries - Question #30 - Implement Prefix Trie (Medium)/3. Understanding The Logic For Our Methods.mp4

10 MB

35. Tries - Question #30 - Implement Prefix Trie (Medium)/4. Implementing Our Prefix Trie Data Structure Solution.en.srt

21 kB

35. Tries - Question #30 - Implement Prefix Trie (Medium)/2. Question #30 - Implement Prefix Trie.en.srt

18 kB

35. Tries - Question #30 - Implement Prefix Trie (Medium)/3. Understanding The Logic For Our Methods.en.srt

5.8 kB

35. Tries - Question #30 - Implement Prefix Trie (Medium)/1. Introducing Tries.en.srt

1.8 kB

36. Where To Go From Here/1. Thank You!.mp4

10 MB

36. Where To Go From Here/6. LinkedIn Endorsements.html

205 kB

36. Where To Go From Here/5. ZTM Events Every Month.html

202 kB

36. Where To Go From Here/4. Learning Guideline.html

201 kB

36. Where To Go From Here/3. Become An Alumni.html

200 kB

36. Where To Go From Here/2. Review This Course!.html

200 kB

36. Where To Go From Here/1. Thank You!.en.srt

2.0 kB

37. Appendix Big O/4. Big O and Scalability.mp4

52 MB

37. Appendix Big O/6. O(1).mp4

39 MB

37. Appendix Big O/18. What Does This All Mean.mp4

38 MB

37. Appendix Big O/24. Section Summary.mp4

37 MB

37. Appendix Big O/3. What Is Good Code.mp4

35 MB

37. Appendix Big O/5. O(n).mp4

33 MB

37. Appendix Big O/20. 3 Pillars Of Programming.mp4

30 MB

37. Appendix Big O/13. Big O Rule 2.mp4

30 MB

37. Appendix Big O/16. Big O Rule 4.mp4

28 MB

37. Appendix Big O/15. O(n^2).mp4

26 MB

37. Appendix Big O/12. Big O Rule 1.mp4

21 MB

37. Appendix Big O/23. Exercise Twitter.mp4

20 MB

37. Appendix Big O/22. Exercise Space Complexity.mp4

18 MB

37. Appendix Big O/2. Section Overview.mp4

17 MB

37. Appendix Big O/21. Space Complexity.mp4

16 MB

37. Appendix Big O/8. Solution Big O Calculation.mp4

15 MB

37. Appendix Big O/14. Big O Rule 3.mp4

10 MB

37. Appendix Big O/17. Big O Cheat Sheet.mp4

10 MB

37. Appendix Big O/19. O(n!).mp4

9.7 MB

37. Appendix Big O/11. Simplifying Big O.mp4

9.1 MB

37. Appendix Big O/10. Solution Big O Calculation 2.mp4

7.8 MB

37. Appendix Big O/9. Exercise Big O Calculation 2.html

213 kB

37. Appendix Big O/7. Exercise Big O Calculation.html

210 kB

37. Appendix Big O/1. Note About Appendix Videos.html

205 kB

37. Appendix Big O/4. Big O and Scalability.en.srt

15 kB

37. Appendix Big O/3. What Is Good Code.en.srt

8.9 kB

37. Appendix Big O/23. Exercise Twitter.en.srt

8.6 kB

37. Appendix Big O/16. Big O Rule 4.en.srt

8.5 kB

37. Appendix Big O/18. What Does This All Mean.en.srt

7.8 kB

37. Appendix Big O/8. Solution Big O Calculation.en.srt

7.7 kB

37. Appendix Big O/15. O(n^2).en.srt

7.6 kB

37. Appendix Big O/22. Exercise Space Complexity.en.srt

7.5 kB

37. Appendix Big O/5. O(n).en.srt

7.3 kB

37. Appendix Big O/6. O(1).en.srt

7.1 kB

37. Appendix Big O/13. Big O Rule 2.en.srt

6.8 kB

37. Appendix Big O/24. Section Summary.en.srt

6.7 kB

37. Appendix Big O/12. Big O Rule 1.en.srt

5.5 kB

37. Appendix Big O/20. 3 Pillars Of Programming.en.srt

5.2 kB

37. Appendix Big O/17. Big O Cheat Sheet.en.srt

4.8 kB

37. Appendix Big O/14. Big O Rule 3.en.srt

4.1 kB

37. Appendix Big O/2. Section Overview.en.srt

3.5 kB

37. Appendix Big O/21. Space Complexity.en.srt

3.0 kB

37. Appendix Big O/10. Solution Big O Calculation 2.en.srt

2.8 kB

37. Appendix Big O/11. Simplifying Big O.en.srt

2.7 kB

37. Appendix Big O/19. O(n!).en.srt

1.8 kB

38. Appendix Arrays/3. Optional Implementing An Array.mp4

59 MB

38. Appendix Arrays/1. Arrays Introduction.mp4

50 MB

38. Appendix Arrays/2. Static vs Dynamic Arrays.mp4

28 MB

38. Appendix Arrays/3. Optional Implementing An Array.en.srt

21 kB

38. Appendix Arrays/1. Arrays Introduction.en.srt

16 kB

38. Appendix Arrays/2. Static vs Dynamic Arrays.en.srt

7.8 kB

39. Appendix Hash Tables/2. Hash Function.mp4

54 MB

39. Appendix Hash Tables/3. Hash Collisions.mp4

48 MB

39. Appendix Hash Tables/1. Hash Tables Introduction.mp4

34 MB

39. Appendix Hash Tables/4. Hash Tables VS Arrays.mp4

13 MB

39. Appendix Hash Tables/3. Hash Collisions.en.srt

12 kB

39. Appendix Hash Tables/2. Hash Function.en.srt

7.0 kB

39. Appendix Hash Tables/1. Hash Tables Introduction.en.srt

5.3 kB

39. Appendix Hash Tables/4. Hash Tables VS Arrays.en.srt

2.8 kB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/4. Figuring Out Our Optimization Strategy.mp4

66 MB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/1. Interview Question #3 - Trapping Rainwater.mp4

46 MB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/5. Coding Our Optimal Solution.mp4

42 MB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/2. Thinking About A Logical Solution.mp4

28 MB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/3. Coding Our Brute Force Solution.mp4

27 MB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/6. Optimal Code And Testing On LeetCode.mp4

9.8 MB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/4. Figuring Out Our Optimization Strategy.en.srt

38 kB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/7. Course Check-In.html

33 kB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/2. Thinking About A Logical Solution.en.srt

20 kB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/5. Coding Our Optimal Solution.en.srt

18 kB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/3. Coding Our Brute Force Solution.en.srt

13 kB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/1. Interview Question #3 - Trapping Rainwater.en.srt

11 kB

4. Arrays - Questions #3 - Trapping Rainwater (Hard)/6. Optimal Code And Testing On LeetCode.en.srt

3.4 kB

40. Appendix Linked Lists/4. Solution Why Linked Lists.mp4

46 MB

40. Appendix Linked Lists/8. Linked Lists Review.mp4

36 MB

40. Appendix Linked Lists/6. Doubly Linked Lists.mp4

26 MB

40. Appendix Linked Lists/2. What Is A Linked List.mp4

25 MB

40. Appendix Linked Lists/7. Singly VS Doubly Linked Lists.mp4

23 MB

40. Appendix Linked Lists/1. Linked Lists Introduction.mp4

21 MB

40. Appendix Linked Lists/5. What Is A Pointer.mp4

16 MB

40. Appendix Linked Lists/3. Exercise Why Linked Lists.mp4

4.1 MB

40. Appendix Linked Lists/4. Solution Why Linked Lists.en.srt

7.6 kB

40. Appendix Linked Lists/8. Linked Lists Review.en.srt

6.8 kB

40. Appendix Linked Lists/5. What Is A Pointer.en.srt

6.2 kB

40. Appendix Linked Lists/2. What Is A Linked List.en.srt

6.2 kB

40. Appendix Linked Lists/6. Doubly Linked Lists.en.srt

4.4 kB

40. Appendix Linked Lists/7. Singly VS Doubly Linked Lists.en.srt

3.9 kB

40. Appendix Linked Lists/1. Linked Lists Introduction.en.srt

3.3 kB

40. Appendix Linked Lists/3. Exercise Why Linked Lists.en.srt

2.9 kB

41. Appendix Stacks + Queues/3. Queues.mp4

26 MB

41. Appendix Stacks + Queues/2. Stacks.mp4

26 MB

41. Appendix Stacks + Queues/1. Stacks + Queues Introduction.mp4

25 MB

41. Appendix Stacks + Queues/6. Stacks + Queues Review.mp4

17 MB

41. Appendix Stacks + Queues/5. Solution Stacks VS Queues.mp4

8.1 MB

41. Appendix Stacks + Queues/4. Exercise Stacks VS Queues.mp4

6.9 MB

41. Appendix Stacks + Queues/5. Solution Stacks VS Queues.en.srt

5.1 kB

41. Appendix Stacks + Queues/2. Stacks.en.srt

5.1 kB

41. Appendix Stacks + Queues/3. Queues.en.srt

5.0 kB

41. Appendix Stacks + Queues/1. Stacks + Queues Introduction.en.srt

4.4 kB

41. Appendix Stacks + Queues/4. Exercise Stacks VS Queues.en.srt

3.8 kB

41. Appendix Stacks + Queues/6. Stacks + Queues Review.en.srt

3.3 kB

42. Appendix Trees/1. Trees Introduction.mp4

44 MB

42. Appendix Trees/2. Binary Trees.mp4

42 MB

42. Appendix Trees/4. Binary Search Tree.mp4

38 MB

42. Appendix Trees/3. O(log n).mp4

31 MB

42. Appendix Trees/7. Trie.mp4

26 MB

42. Appendix Trees/6. BST Pros and Cons.mp4

21 MB

42. Appendix Trees/5. Balanced VS Unbalanced BST.mp4

18 MB

42. Appendix Trees/3. O(log n).en.srt

9.3 kB

42. Appendix Trees/1. Trees Introduction.en.srt

8.3 kB

42. Appendix Trees/4. Binary Search Tree.en.srt

8.0 kB

42. Appendix Trees/2. Binary Trees.en.srt

7.8 kB

42. Appendix Trees/5. Balanced VS Unbalanced BST.en.srt

4.9 kB

42. Appendix Trees/7. Trie.en.srt

4.4 kB

42. Appendix Trees/6. BST Pros and Cons.en.srt

3.4 kB

43. Appendix Searching + BFS + DFS/9. depthFirstSearch().mp4

51 MB

43. Appendix Searching + BFS + DFS/7. breadthFirstSearch().mp4

41 MB

43. Appendix Searching + BFS + DFS/4. BFS vs DFS.mp4

27 MB

43. Appendix Searching + BFS + DFS/8. PreOrder, InOrder, PostOrder.mp4

25 MB

43. Appendix Searching + BFS + DFS/1. Graph + Tree Traversals.mp4

22 MB

43. Appendix Searching + BFS + DFS/3. DFS Introduction.mp4

20 MB

43. Appendix Searching + BFS + DFS/2. BFS Introduction.mp4

15 MB

43. Appendix Searching + BFS + DFS/6. Solution BFS vs DFS.mp4

11 MB

43. Appendix Searching + BFS + DFS/5. Exercise BFS vs DFS.mp4

2.1 MB

43. Appendix Searching + BFS + DFS/7. breadthFirstSearch().en.srt

10 kB

43. Appendix Searching + BFS + DFS/8. PreOrder, InOrder, PostOrder.en.srt

6.3 kB

43. Appendix Searching + BFS + DFS/6. Solution BFS vs DFS.en.srt

4.9 kB

43. Appendix Searching + BFS + DFS/4. BFS vs DFS.en.srt

4.9 kB

43. Appendix Searching + BFS + DFS/3. DFS Introduction.en.srt

4.6 kB

43. Appendix Searching + BFS + DFS/1. Graph + Tree Traversals.en.srt

4.6 kB

43. Appendix Searching + BFS + DFS/2. BFS Introduction.en.srt

3.4 kB

43. Appendix Searching + BFS + DFS/5. Exercise BFS vs DFS.en.srt

1.2 kB

43. Appendix Searching + BFS + DFS/9. depthFirstSearch().en.srt

44 B

44. Appendix Recursion/5. When To Use Recursion.mp4

32 MB

44. Appendix Recursion/4. Recursive VS Iterative.mp4

31 MB

44. Appendix Recursion/1. Recursion Introduction.mp4

27 MB

44. Appendix Recursion/2. Stack Overflow.mp4

26 MB

44. Appendix Recursion/3. Anatomy Of Recursion.mp4

24 MB

44. Appendix Recursion/6. Recursion Review.mp4

21 MB

44. Appendix Recursion/3. Anatomy Of Recursion.en.srt

13 kB

44. Appendix Recursion/2. Stack Overflow.en.srt

8.9 kB

44. Appendix Recursion/1. Recursion Introduction.en.srt

7.5 kB

44. Appendix Recursion/4. Recursive VS Iterative.en.srt

5.6 kB

44. Appendix Recursion/5. When To Use Recursion.en.srt

5.5 kB

44. Appendix Recursion/6. Recursion Review.en.srt

3.4 kB

45. Appendix Sorting/17. Quick Sort.mp4

58 MB

45. Appendix Sorting/1. Sorting Introduction.mp4

54 MB

45. Appendix Sorting/14. Merge Sort and O(n log n).mp4

48 MB

45. Appendix Sorting/2. The Issue With sort().mp4

25 MB

45. Appendix Sorting/4. Bubble Sort.mp4

22 MB

45. Appendix Sorting/10. Dancing Algorithms.mp4

21 MB

45. Appendix Sorting/16. Solution Merge Sort.mp4

21 MB

45. Appendix Sorting/7. Selection Sort.mp4

19 MB

45. Appendix Sorting/3. Sorting Algorithms.mp4

16 MB

45. Appendix Sorting/6. Solution Bubble Sort.mp4

16 MB

45. Appendix Sorting/12. Insertion Sort.mp4

12 MB

45. Appendix Sorting/9. Solution Selection Sort.mp4

12 MB

45. Appendix Sorting/13. Solution Insertion Sort.mp4

7.7 MB

45. Appendix Sorting/15. Exercise Merge Sort.html

282 kB

45. Appendix Sorting/11. Exercise Insertion Sort.html

278 kB

45. Appendix Sorting/8. Exercise Selection Sort.html

275 kB

45. Appendix Sorting/5. Exercise Bubble Sort.html

272 kB

45. Appendix Sorting/17. Quick Sort.en.srt

11 kB

45. Appendix Sorting/1. Sorting Introduction.en.srt

10 kB

45. Appendix Sorting/2. The Issue With sort().en.srt

9.0 kB

45. Appendix Sorting/3. Sorting Algorithms.en.srt

5.5 kB

45. Appendix Sorting/16. Solution Merge Sort.en.srt

5.5 kB

45. Appendix Sorting/4. Bubble Sort.en.srt

5.5 kB

45. Appendix Sorting/6. Solution Bubble Sort.en.srt

4.9 kB

45. Appendix Sorting/12. Insertion Sort.en.srt

3.6 kB

45. Appendix Sorting/7. Selection Sort.en.srt

3.4 kB

45. Appendix Sorting/9. Solution Selection Sort.en.srt

3.3 kB

45. Appendix Sorting/13. Solution Insertion Sort.en.srt

2.5 kB

45. Appendix Sorting/10. Dancing Algorithms.en.srt

1.8 kB

5. Strings - Question #4 - Typed Out Strings (Easy)/1. Interview Question #4 -Typed Out Strings.mp4

67 MB

5. Strings - Question #4 - Typed Out Strings (Easy)/4. Space And Time Complexity.mp4

42 MB

5. Strings - Question #4 - Typed Out Strings (Easy)/6. Coding Our Optimal Solution.mp4

30 MB

5. Strings - Question #4 - Typed Out Strings (Easy)/5. Coming Up With Optimal Solution.mp4

24 MB

5. Strings - Question #4 - Typed Out Strings (Easy)/7. Submitting To LeetCode.mp4

23 MB

5. Strings - Question #4 - Typed Out Strings (Easy)/3. Coding Our Brute Force Solution.mp4

21 MB

5. Strings - Question #4 - Typed Out Strings (Easy)/2. Logic Of Our Brute Force Solution.mp4

17 MB

5. Strings - Question #4 - Typed Out Strings (Easy)/8. Implement a New Life System.html

41 kB

5. Strings - Question #4 - Typed Out Strings (Easy)/5. Coming Up With Optimal Solution.en.srt

18 kB

5. Strings - Question #4 - Typed Out Strings (Easy)/6. Coding Our Optimal Solution.en.srt

16 kB

5. Strings - Question #4 - Typed Out Strings (Easy)/2. Logic Of Our Brute Force Solution.en.srt

12 kB

5. Strings - Question #4 - Typed Out Strings (Easy)/3. Coding Our Brute Force Solution.en.srt

12 kB

5. Strings - Question #4 - Typed Out Strings (Easy)/1. Interview Question #4 -Typed Out Strings.en.srt

12 kB

5. Strings - Question #4 - Typed Out Strings (Easy)/4. Space And Time Complexity.en.srt

11 kB

5. Strings - Question #4 - Typed Out Strings (Easy)/7. Submitting To LeetCode.en.srt

9.4 kB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/5. Sliding Window Technique.mp4

49 MB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/1. Interview Question #5 - Longest Substring Without Repeating Characters.mp4

46 MB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/3. Coding Our Brute Force Solution.mp4

23 MB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/8. Coding Our Optimal Solution.mp4

20 MB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/6. Hints For Optimizing Our Solution.mp4

17 MB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/7. Thinking About Optimal Solution.mp4

14 MB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/10. Optimal Code And Testing On LeetCode.mp4

14 MB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/4. Space And Time Complexity.mp4

13 MB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/2. Coming Up With A Brute Force Approach.mp4

11 MB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/9. Note Correction for explanation of +1.html

51 kB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/3. Coding Our Brute Force Solution.en.srt

14 kB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/7. Thinking About Optimal Solution.en.srt

14 kB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/2. Coming Up With A Brute Force Approach.en.srt

13 kB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/8. Coding Our Optimal Solution.en.srt

11 kB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/1. Interview Question #5 - Longest Substring Without Repeating Characters.en.srt

9.9 kB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/5. Sliding Window Technique.en.srt

8.3 kB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/10. Optimal Code And Testing On LeetCode.en.srt

5.5 kB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/4. Space And Time Complexity.en.srt

5.2 kB

6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/6. Hints For Optimizing Our Solution.en.srt

3.1 kB

7. Strings - Question #6 - Valid Palindrome & Almost Palindrome/1. Intro To Palindromes.mp4

91 MB

7. Strings - Question #6 - Valid Palindrome & Almost Palindrome/3. Almost A Palindrome.mp4

60 MB

7. Strings - Question #6 - Valid Palindrome & Almost Palindrome/2. Interview Question #6 - Valid Palindrome.mp4

26 MB

7. Strings - Question #6 - Valid Palindrome & Almost Palindrome/5. Coding Our Solution.mp4

24 MB

7. Strings - Question #6 - Valid Palindrome & Almost Palindrome/4. Figuring Out Our Solution.mp4

11 MB

7. Strings - Question #6 - Valid Palindrome & Almost Palindrome/3. Almost A Palindrome.en.srt

16 kB

7. Strings - Question #6 - Valid Palindrome & Almost Palindrome/1. Intro To Palindromes.en.srt

14 kB

7. Strings - Question #6 - Valid Palindrome & Almost Palindrome/5. Coding Our Solution.en.srt

14 kB

7. Strings - Question #6 - Valid Palindrome & Almost Palindrome/2. Interview Question #6 - Valid Palindrome.en.srt

13 kB

7. Strings - Question #6 - Valid Palindrome & Almost Palindrome/4. Figuring Out Our Solution.en.srt

10 kB

8. Introducing Linked Lists - Basics and Reverse A Linked List/1. Linked List Introduction.mp4

37 MB

8. Introducing Linked Lists - Basics and Reverse A Linked List/2. Basic Algorithm Reverse a Linked List.mp4

30 MB

8. Introducing Linked Lists - Basics and Reverse A Linked List/3. Thinking About Our Solution.mp4

27 MB

8. Introducing Linked Lists - Basics and Reverse A Linked List/4. Coding Reverse A Linked List Solution.mp4

15 MB

8. Introducing Linked Lists - Basics and Reverse A Linked List/3. Thinking About Our Solution.en.srt

16 kB

8. Introducing Linked Lists - Basics and Reverse A Linked List/2. Basic Algorithm Reverse a Linked List.en.srt

13 kB

8. Introducing Linked Lists - Basics and Reverse A Linked List/4. Coding Reverse A Linked List Solution.en.srt

11 kB

8. Introducing Linked Lists - Basics and Reverse A Linked List/1. Linked List Introduction.en.srt

6.2 kB

9. Linked List - Question #7 - M, N Reversals (Medium)/2. Coming Up With A Logical Solution.mp4

48 MB

9. Linked List - Question #7 - M, N Reversals (Medium)/3. Coding Our Solution.mp4

41 MB

9. Linked List - Question #7 - M, N Reversals (Medium)/1. Interview Question #7 - M, N Reversals.mp4

40 MB

9. Linked List - Question #7 - M, N Reversals (Medium)/2. Coming Up With A Logical Solution.en.srt

26 kB

9. Linked List - Question #7 - M, N Reversals (Medium)/3. Coding Our Solution.en.srt

24 kB

9. Linked List - Question #7 - M, N Reversals (Medium)/1. Interview Question #7 - M, N Reversals.en.srt

10 kB