种子简介

种子名称： [FreeCourseSite.com] Udemy - Master the Coding Interview Big Tech (FAANG) Interviews
文件类型： 视频
文件数目： 269个文件
文件大小： 6.32 GB
收录时间： 2023-1-3 17:27
已经下载： 3次
资源热度： 294
最近下载： 2024-12-25 13:18

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:6b422b638043e49a60df620fcc2ccf4b6be7c4a0&dn=[FreeCourseSite.com] Udemy - Master the Coding Interview Big Tech (FAANG) Interviews 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[FreeCourseSite.com] Udemy - Master the Coding Interview Big Tech (FAANG) Interviews.torrent

01 - Introduction/001 Course Breakdown.mp4151.37MB

01 - Introduction/002 Join Our Online Classroom!.mp477.71MB

02 - Arrays - Question #1 Google Interview Question Two Sum (Easy)/001 Interview Question #1 Two Sum.mp422.74MB

02 - Arrays - Question #1 Google Interview Question Two Sum (Easy)/002 How To Approach Our Problem.mp417.19MB

02 - Arrays - Question #1 Google Interview Question Two Sum (Easy)/003 Writing Our Brute Force Solution.mp412.99MB

02 - Arrays - Question #1 Google Interview Question Two Sum (Easy)/004 Testing Our Brute Force Solution With Our Test Cases.mp415.06MB

02 - Arrays - Question #1 Google Interview Question Two Sum (Easy)/005 Submitting To Leetcode.mp45.72MB

02 - Arrays - Question #1 Google Interview Question Two Sum (Easy)/006 Analyzing Space and Time Complexity.mp434.04MB

02 - Arrays - Question #1 Google Interview Question Two Sum (Easy)/007 Optimizing Our Solution.mp414.02MB

02 - Arrays - Question #1 Google Interview Question Two Sum (Easy)/008 Coding Our Optimal Solution.mp48.3MB

02 - Arrays - Question #1 Google Interview Question Two Sum (Easy)/009 Testing Our Optimal Solution With Our Test Cases & Space and Time Complexity.mp414.2MB

02 - Arrays - Question #1 Google Interview Question Two Sum (Easy)/010 Checking Performance on Leetcode.mp413.61MB

03 - Arrays - Questions #2 - Container With Most Water (Medium)/001 Interview Question #2 - Container With Most Water.mp471.9MB

03 - Arrays - Questions #2 - Container With Most Water (Medium)/002 Coming Up With Test Cases.mp420.29MB

03 - Arrays - Questions #2 - Container With Most Water (Medium)/003 Thinking Through A Logical Brute Force Solution.mp437.33MB

03 - Arrays - Questions #2 - Container With Most Water (Medium)/004 Coding Out Our Brute Force Solution.mp416.97MB

03 - Arrays - Questions #2 - Container With Most Water (Medium)/005 Stepping Through Our Code.mp424.48MB

03 - Arrays - Questions #2 - Container With Most Water (Medium)/006 Thinking About Our Optimal Solution.mp464.66MB

03 - Arrays - Questions #2 - Container With Most Water (Medium)/007 Coding Our Optimal Solution And Testing On LeetCode.mp477.26MB

04 - Arrays - Questions #3 - Trapping Rainwater (Hard)/001 Interview Question #3 - Trapping Rainwater.mp486.99MB

04 - Arrays - Questions #3 - Trapping Rainwater (Hard)/002 Thinking About A Logical Solution.mp421.46MB

04 - Arrays - Questions #3 - Trapping Rainwater (Hard)/003 Coding Our Brute Force.mp422.08MB

04 - Arrays - Questions #3 - Trapping Rainwater (Hard)/004 Figuring Out Our Optimization Strategy.mp496.76MB

04 - Arrays - Questions #3 - Trapping Rainwater (Hard)/005 Coding Our Optimal Solution.mp451.72MB

04 - Arrays - Questions #3 - Trapping Rainwater (Hard)/006 Optimal Code And LeetCode.mp416.93MB

05 - Strings - Question #4 - Typed Out Strings (Easy)/001 Interview Question #4 -Typed Out Strings.mp4110.39MB

05 - Strings - Question #4 - Typed Out Strings (Easy)/002 Logic Of Our Brute Force.mp412.32MB

05 - Strings - Question #4 - Typed Out Strings (Easy)/003 Coding Our Brute Force.mp413.78MB

05 - Strings - Question #4 - Typed Out Strings (Easy)/004 Space And Time Complexity.mp428.75MB

05 - Strings - Question #4 - Typed Out Strings (Easy)/005 Coming Up With Optimal Solution.mp417.42MB

05 - Strings - Question #4 - Typed Out Strings (Easy)/006 Coding Our Optimal Solution.mp417.87MB

05 - Strings - Question #4 - Typed Out Strings (Easy)/007 Submitting To LeetCode.mp436.77MB

06 - Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/001 Interview Question #5 - Longest Substring Without Repeating Characters.mp473.82MB

06 - Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/002 Coming Up With A Brute Force Approach.mp46.96MB

06 - Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/003 Coding Our Brute Force.mp415.83MB

06 - Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/004 Space And Time Complexity.mp422.22MB

06 - Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/005 Sliding Window Technique.mp416.81MB

06 - Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/006 Hints For Optimizing Our Solution.mp46.9MB

06 - Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/007 Thinking About Optimal Solution.mp49.57MB

06 - Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/008 Coding Our Optimal Solution.mp414.25MB

06 - Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/010 Optimal Code And LeetCode.mp49.8MB

07 - Strings - Question #6 - Valid Palindrome & Almost Palindrome/001 Intro To Palindromes.mp442.81MB

07 - Strings - Question #6 - Valid Palindrome & Almost Palindrome/002 Interview Question #6 - Valid Palindrome.mp413.62MB

07 - Strings - Question #6 - Valid Palindrome & Almost Palindrome/003 Almost A Palindrome.mp440.85MB

07 - Strings - Question #6 - Valid Palindrome & Almost Palindrome/004 Figuring Out Our Solution.mp47.2MB

07 - Strings - Question #6 - Valid Palindrome & Almost Palindrome/005 Coding Our Solution.mp419.08MB

08 - Introducing Linked Lists - Basics and Reverse A Linked List/001 Linked List Introduction.mp412.49MB

08 - Introducing Linked Lists - Basics and Reverse A Linked List/002 Basic Algorithm Reverse a Linked List.mp415.27MB

08 - Introducing Linked Lists - Basics and Reverse A Linked List/003 Thinking About Our Solution.mp418.84MB

08 - Introducing Linked Lists - Basics and Reverse A Linked List/004 Coding Reverse A Linked List Solution.mp411.08MB

09 - Linked List - Question #7 - M, N Reversals (Medium)/001 Interview Question #7 - M, N Reversals.mp415.84MB

09 - Linked List - Question #7 - M, N Reversals (Medium)/002 Coming Up With A Logical Solution.mp433.77MB

09 - Linked List - Question #7 - M, N Reversals (Medium)/003 Coding Our Solution.mp431.34MB

10 - Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/001 Interview Question #8 - Merge Multi-Level Doubly Linked List.mp427.78MB

10 - Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/002 Figuring Out Our Test Cases.mp412.14MB

10 - Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/004 Thinking About Our Approach.mp431.11MB

10 - Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/005 Coding Out Our Solution.mp454.28MB

11 - Linked List - Question #9 - Cycle Detection (Medium)/001 Interview Question #9 - Cycle Detection.mp421.58MB

11 - Linked List - Question #9 - Cycle Detection (Medium)/002 What Is Floyd's Tortoise And Hare Algorithm.mp49.55MB

11 - Linked List - Question #9 - Cycle Detection (Medium)/003 Coding Floyd's Algorithm.mp413.14MB

11 - Linked List - Question #9 - Cycle Detection (Medium)/004 Optional Proof Of How And Why Floyd's Algorithm Works.mp442.6MB

12 - Stacks - Question #10 - Valid Parentheses (Easy)/001 Intro to Stacks and Queues.mp410.19MB

12 - Stacks - Question #10 - Valid Parentheses (Easy)/002 Interview Question #10 - Valid Parentheses.mp422.49MB

12 - Stacks - Question #10 - Valid Parentheses (Easy)/003 Walking Through Our Problem - Identifying The Need For A Stack.mp48.99MB

12 - Stacks - Question #10 - Valid Parentheses (Easy)/004 Coding Our Solution With A Stack.mp414.83MB

13 - Stacks - Question #11 - Minimum Brackets To Remove (Medium)/001 Interview Question #11 - Minimum Brackets To Remove.mp426.79MB

13 - Stacks - Question #11 - Minimum Brackets To Remove (Medium)/002 Thinking About Our Solution.mp414.36MB

13 - Stacks - Question #11 - Minimum Brackets To Remove (Medium)/003 Coding Our Solution.mp418.11MB

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

14 - Queues - Question #12 - Implement Queue With Stacks (Easy)/002 Figuring Out Our Solution.mp412.98MB

14 - Queues - Question #12 - Implement Queue With Stacks (Easy)/003 Coding Our Solution.mp411.71MB

15 - Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/001 Introducing Recursion.mp49.73MB

15 - Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/002 Optional Tail Recursion.mp461.77MB

15 - Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/003 Sorting.mp47.48MB

15 - Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/004 Interview Question #13 - Kth Largest Element.mp416.61MB

15 - Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/005 Insights From Quick Sort.mp415.9MB

15 - Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/006 Understanding Divide And Conquer.mp426.09MB

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

15 - Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/008 What Is Hoare's Quickselect Algorithm.mp410.45MB

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

15 - Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element/011 Exercise Imposter Syndrome.mp426.51MB

16 - Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/001 Understanding Binary Search.mp430.18MB

16 - Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/002 How To Code Binary Search.mp49.78MB

16 - Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/003 Question #14 - Start And End Of Target In A Sorted Array.mp421.5MB

16 - Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/004 Walking Through Our Solution.mp414.55MB

16 - Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/005 Coding Our Solution.mp448.68MB

17 - Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/001 Intro to Binary Trees.mp45.89MB

17 - Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/002 Question #15 - Maximum Depth of Binary Tree.mp416.05MB

17 - Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/003 Learning The Process For Solving Binary Tree Problems.mp432.58MB

17 - Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/004 Coding Our Solution.mp413.45MB

18 - Binary Trees - Question #16 - Level Order Of Binary Tree (Medium)/001 Question #16 - Level Order Of Binary Tree.mp412.18MB

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

18 - Binary Trees - Question #16 - Level Order Of Binary Tree (Medium)/003 Coding Out Level Order Traversal.mp425.09MB

19 - Binary Trees - Question #17 - Right Side View of Tree (Medium)/001 Question #17 - Right Side View of Tree.mp413.64MB

19 - Binary Trees - Question #17 - Right Side View of Tree (Medium)/002 Understanding The Breadth First Search Approach.mp412.56MB

19 - Binary Trees - Question #17 - Right Side View of Tree (Medium)/003 Understanding The Depth First Search Approach.mp414.08MB

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

19 - Binary Trees - Question #17 - Right Side View of Tree (Medium)/005 Completing Our DFS Solution.mp414.45MB

19 - Binary Trees - Question #17 - Right Side View of Tree (Medium)/006 Coding Our Final DFS Solution.mp424.88MB

20 - Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/001 Question #18 - Number Of Nodes In Complete Tree.mp418.52MB

20 - Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/002 Thinking Deeply About A Full Binary Tree.mp418.13MB

20 - Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/003 Figuring Out Number Of Nodes At Last Level.mp428.62MB

20 - Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/004 Coding Out Our Full Solution.mp452.05MB

21 - Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/001 Question #19 - Validate Binary Search Tree.mp421.48MB

21 - Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/002 Thinking About Our Logical Solution.mp422.03MB

21 - Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/003 Figuring Out Our Boundaries.mp412.63MB

21 - Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/004 Coding Our Our Full Solution.mp423.11MB

22 - Heaps & Priority Queues/001 Introducing Heaps.mp419.28MB

22 - Heaps & Priority Queues/002 Insertion In Heaps - Understanding Sift Up.mp412.42MB

22 - Heaps & Priority Queues/003 Deletion In Heaps - Understanding Sift Down.mp417.03MB

22 - Heaps & Priority Queues/004 Starting To Code Our Priority Queue Class.mp412.47MB

22 - Heaps & Priority Queues/005 Coding Our Insertion And Sift Up Methods.mp49.92MB

22 - Heaps & Priority Queues/006 Coding Our Deletion And Sift Down Methods.mp421.1MB

23 - Intro To 2D-Arrays - Basics & Traversal Algorithms/001 Introducing 2D Arrays - What Are They.mp423.3MB

23 - Intro To 2D-Arrays - Basics & Traversal Algorithms/002 Depth First Search In 2D-Arrays.mp423.36MB

23 - Intro To 2D-Arrays - Basics & Traversal Algorithms/003 Coding DFS - Setting Up For DFS.mp415.54MB

23 - Intro To 2D-Arrays - Basics & Traversal Algorithms/004 Coding DFS - Implementing Recursive DFS.mp431.66MB

23 - Intro To 2D-Arrays - Basics & Traversal Algorithms/005 Breadth First Search In 2D-Arrays.mp424.44MB

23 - Intro To 2D-Arrays - Basics & Traversal Algorithms/006 Coding BFS.mp423.97MB

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

24 - 2D-Arrays - Question #20 Number Of Islands (Medium)/002 Question #20 Number Of Islands.mp417.47MB

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

24 - 2D-Arrays - Question #20 Number Of Islands (Medium)/004 Approaching Our Problem - Thinking About Traversals.mp416.25MB

24 - 2D-Arrays - Question #20 Number Of Islands (Medium)/005 Coding Our Solution.mp460.51MB

24 - 2D-Arrays - Question #20 Number Of Islands (Medium)/006 Thinking About Space And Time Complexity.mp430.59MB

25 - 2D-Arrays - Question #21 Rotting Oranges (Medium)/001 Question #21 Rotting Oranges.mp480.43MB

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

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

25 - 2D-Arrays - Question #21 Rotting Oranges (Medium)/004 Coding Out Our Solution.mp428.26MB

26 - 2D-Arrays - Question #22 - Walls And Gates (Medium)/001 Question #22 - Walls And Gates.mp421.39MB

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

26 - 2D-Arrays - Question #22 - Walls And Gates (Medium)/003 Coding Out Our Solution.mp425.39MB

27 - Intro to Graphs - Representation & Traversal Algorithms/001 Introduction To The Types Of Graphs.mp434.87MB

27 - Intro to Graphs - Representation & Traversal Algorithms/002 Representing Our Graphs - Adjacency List & Adjacency Matrix.mp422.84MB

27 - Intro to Graphs - Representation & Traversal Algorithms/003 Breadth First Search In Graphs.mp414.78MB

27 - Intro to Graphs - Representation & Traversal Algorithms/004 Coding BFS.mp415.06MB

27 - Intro to Graphs - Representation & Traversal Algorithms/005 Depth First Search In Graphs.mp49.66MB

27 - Intro to Graphs - Representation & Traversal Algorithms/006 Coding DFS.mp413.64MB

28 - Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/001 Question #23 - Time Needed to Inform All Employees.mp457.19MB

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

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

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

28 - Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/005 Coding Our DFS Solution.mp419.82MB

29 - Graphs - Question #24 - Course Scheduler (Medium)/001 Question #24 - Course Scheduler.mp426.81MB

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

29 - Graphs - Question #24 - Course Scheduler (Medium)/003 Coding Out Our Initial BFS Solution.mp428.71MB

29 - Graphs - Question #24 - Course Scheduler (Medium)/004 What is Topological Sort.mp424.8MB

29 - Graphs - Question #24 - Course Scheduler (Medium)/005 Thinking About A Solution With Topological Sort.mp415.52MB

29 - Graphs - Question #24 - Course Scheduler (Medium)/006 Coding Our Final Solution.mp434.62MB

30 - Graphs - Question #25 - Network Time Delay (Medium)/001 Question #25 - Network Time Delay.mp439.6MB

30 - Graphs - Question #25 - Network Time Delay (Medium)/002 Thinking About How To Approach The Problem.mp413.6MB

30 - Graphs - Question #25 - Network Time Delay (Medium)/003 Greedy Method & What Is Dijkstra's Algorithm.mp448.41MB

30 - Graphs - Question #25 - Network Time Delay (Medium)/004 Thinking About A Solution With Dijkstra's Algorithm.mp428.1MB

30 - Graphs - Question #25 - Network Time Delay (Medium)/005 Coding Our Solution With Dijkstra.mp4108.29MB

30 - Graphs - Question #25 - Network Time Delay (Medium)/006 Time And Space Complexity Of Our Solution.mp432.92MB

30 - Graphs - Question #25 - Network Time Delay (Medium)/007 Thinking About Negative Weights.mp434.62MB

30 - Graphs - Question #25 - Network Time Delay (Medium)/008 What is The Bellman-Ford Algorithm - Conceptualizing Dynamic Programming.mp429.58MB

30 - Graphs - Question #25 - Network Time Delay (Medium)/009 What is The Bellman-Ford Algorithm - The Algorithm Itself.mp423.33MB

30 - Graphs - Question #25 - Network Time Delay (Medium)/010 Coding Our Solution With Bellman-Ford.mp420.53MB

31 - Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/001 Question #26 - Minimum Cost Of Climbing Stairs & How To Approach DP.mp430.13MB

31 - Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/002 Understanding & Identifying Recurrence Relation.mp436.43MB

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

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

31 - Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/006 Coding Our Memoization Optimization.mp419.88MB

31 - Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/007 Understanding The Bottom Up Approach (Tabulation).mp49.23MB

31 - Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/008 Third Step - Bottom Up Tabulation.mp418.21MB

31 - Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/009 Fourth Step - Bottom Up Optimization.mp422.06MB

32 - Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/001 Question #27 - Knight Probability In Chessboard.mp458.42MB

32 - Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/002 Thinking About Test Cases To Help Us.mp43.95MB

32 - Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/003 Identifying The Recurrence Relation.mp420.56MB

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

32 - Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/005 Second Step - Memoizing Our Redundant Recursive Calls.mp446.39MB

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

32 - Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/007 Third Step - Bottom Up Tabulation.mp428.04MB

32 - Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/008 Fourth Step - Bottom Up Optimization.mp428.38MB

33 - Backtracking - Question #28 - Sudoku Solver (Hard)/001 Understanding The Basics Of Backtracking.mp422.28MB

33 - Backtracking - Question #28 - Sudoku Solver (Hard)/002 Question #28 - Sudoku Solver.mp418.86MB

33 - Backtracking - Question #28 - Sudoku Solver (Hard)/003 Learning The Backtracking Template.mp416.54MB

33 - Backtracking - Question #28 - Sudoku Solver (Hard)/004 Applying Our Backtracking Template To Sudoku Solver Logic.mp410.14MB

33 - Backtracking - Question #28 - Sudoku Solver (Hard)/005 Coding How To Get Box ID.mp414.24MB

33 - Backtracking - Question #28 - Sudoku Solver (Hard)/006 Setting Up Our Solution Code.mp415.72MB

33 - Backtracking - Question #28 - Sudoku Solver (Hard)/007 Coding The Recursive Backtracking Portion Of Our Solution.mp445.08MB

33 - Backtracking - Question #28 - Sudoku Solver (Hard)/008 Thinking About The Space And Time Complexity.mp445.19MB

34 - Interface Design - Question #29 - Monarchy/001 Understanding Interface Design & Question #29 - Monarchy.mp433.8MB

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

34 - Interface Design - Question #29 - Monarchy/003 Thinking About The Logical Of The Monarchy.mp423.62MB

34 - Interface Design - Question #29 - Monarchy/004 Coding Our Monarchy Solution.mp419.55MB

35 - Tries - Question #30 - Implement Prefix Trie (Medium)/001 Introducing Tries.mp43.49MB

35 - Tries - Question #30 - Implement Prefix Trie (Medium)/002 Question #30 - Implement Prefix Trie.mp429.31MB

35 - Tries - Question #30 - Implement Prefix Trie (Medium)/003 Understanding The Logic For Our Methods.mp47.45MB

35 - Tries - Question #30 - Implement Prefix Trie (Medium)/004 Implementing Our Prefix Trie Data Structure Solution.mp423.92MB

36 - Where To Go From Here/001 Thank You!.mp44.08MB

37 - Appendix Big O/001 Section Overview.mp47.58MB

37 - Appendix Big O/002 What Is Good Code.mp427.56MB

37 - Appendix Big O/003 Big O and Scalability.mp447.91MB

37 - Appendix Big O/004 O(n).mp444.77MB

37 - Appendix Big O/005 O(1).mp425.34MB

37 - Appendix Big O/007 Solution Big O Calculation.mp411.62MB

37 - Appendix Big O/009 Solution Big O Calculation 2.mp45.97MB

37 - Appendix Big O/010 Simplifying Big O.mp44.79MB

37 - Appendix Big O/011 Big O Rule 1.mp411.95MB

37 - Appendix Big O/012 Big O Rule 2.mp417.07MB

37 - Appendix Big O/013 Big O Rule 3.mp46.81MB

37 - Appendix Big O/014 O(n^2).mp423.85MB

37 - Appendix Big O/015 Big O Rule 4.mp422.17MB

37 - Appendix Big O/016 Big O Cheat Sheet.mp48.93MB

37 - Appendix Big O/017 What Does This All Mean.mp446.69MB

37 - Appendix Big O/018 O(n!).mp43.84MB

37 - Appendix Big O/019 3 Pillars Of Programming.mp410.98MB

37 - Appendix Big O/020 Space Complexity.mp46.89MB

37 - Appendix Big O/021 Exercise Space Complexity.mp415.17MB

37 - Appendix Big O/022 Exercise Twitter.mp425.81MB

37 - Appendix Big O/023 Section Summary.mp414.64MB

38 - Appendix Arrays/001 Arrays Introduction.mp429.73MB

38 - Appendix Arrays/002 Static vs Dynamic Arrays.mp415.76MB

38 - Appendix Arrays/003 Optional Implementing An Array.mp454.88MB

39 - Appendix Hash Tables/001 Hash Tables Introduction.mp413.04MB

39 - Appendix Hash Tables/002 Hash Function.mp426.76MB

39 - Appendix Hash Tables/003 Hash Collisions.mp461.46MB

39 - Appendix Hash Tables/004 Hash Tables VS Arrays.mp46.1MB

40 - Appendix Linked Lists/001 Linked Lists Introduction.mp47.74MB

40 - Appendix Linked Lists/002 What Is A Linked List.mp411.17MB

40 - Appendix Linked Lists/003 Exercise Why Linked Lists.mp42.95MB

40 - Appendix Linked Lists/004 Solution Why Linked Lists.mp417.5MB

40 - Appendix Linked Lists/005 What Is A Pointer.mp412.31MB

40 - Appendix Linked Lists/006 Doubly Linked Lists.mp410.48MB

40 - Appendix Linked Lists/007 Singly VS Doubly Linked Lists.mp48.54MB

40 - Appendix Linked Lists/008 Linked Lists Review.mp420.85MB

41 - Appendix Stacks + Queues/001 Stacks + Queues Introduction.mp49.23MB

41 - Appendix Stacks + Queues/002 Stacks.mp410.9MB

41 - Appendix Stacks + Queues/003 Queues.mp411.05MB

41 - Appendix Stacks + Queues/004 Exercise Stacks VS Queues.mp44.99MB

41 - Appendix Stacks + Queues/005 Solution Stacks VS Queues.mp46.38MB

41 - Appendix Stacks + Queues/006 Stacks + Queues Review.mp49.72MB

42 - Appendix Trees/001 Trees Introduction.mp454.8MB

42 - Appendix Trees/002 Binary Trees.mp422.66MB

42 - Appendix Trees/003 O(log n).mp420.15MB

42 - Appendix Trees/004 Binary Search Trees.mp416.75MB

42 - Appendix Trees/005 Balanced VS Unbalanced BST.mp423.5MB

42 - Appendix Trees/006 BST Pros and Cons.mp47.6MB

42 - Appendix Trees/007 Tries.mp410.14MB

43 - Appendix Searching + BFS + DFS/001 Graph + Tree Traversals.mp411.53MB

43 - Appendix Searching + BFS + DFS/002 BFS Introduction.mp47.44MB

43 - Appendix Searching + BFS + DFS/003 DFS Introduction.mp49.39MB

43 - Appendix Searching + BFS + DFS/004 BFS vs DFS.mp49.98MB

43 - Appendix Searching + BFS + DFS/005 Exercise BFS vs DFS.mp41.65MB

43 - Appendix Searching + BFS + DFS/006 Solution BFS vs DFS.mp47.67MB

43 - Appendix Searching + BFS + DFS/007 breadthFirstSearch().mp436.21MB

43 - Appendix Searching + BFS + DFS/008 PreOrder, InOrder, PostOrder.mp414.06MB

43 - Appendix Searching + BFS + DFS/009 depthFirstSearch().mp438.54MB

44 - Appendix Recursion/001 Recursion Introduction.mp432.86MB

44 - Appendix Recursion/002 Stack Overflow.mp420.43MB

44 - Appendix Recursion/003 Anatomy Of Recursion.mp449.52MB

44 - Appendix Recursion/004 Recursive VS Iterative.mp412.42MB

44 - Appendix Recursion/005 When To Use Recursion.mp415.91MB

44 - Appendix Recursion/006 Recursion Review.mp48.56MB

45 - Appendix Sorting/001 Sorting Introduction.mp420.64MB

45 - Appendix Sorting/002 The Issue With sort().mp429.53MB

45 - Appendix Sorting/003 Sorting Algorithms.mp424.72MB

45 - Appendix Sorting/004 Bubble Sort.mp418.79MB

45 - Appendix Sorting/006 Solution Bubble Sort.mp413.21MB

45 - Appendix Sorting/007 Selection Sort.mp423.23MB

45 - Appendix Sorting/009 Solution Selection Sort.mp416.39MB

45 - Appendix Sorting/010 Dancing Algorithms.mp416.49MB

45 - Appendix Sorting/011 Insertion Sort.mp47.27MB

45 - Appendix Sorting/013 Solution Insertion Sort.mp412.47MB

45 - Appendix Sorting/014 Merge Sort and O(n log n).mp462.95MB

45 - Appendix Sorting/016 Solution Merge Sort.mp419.27MB

45 - Appendix Sorting/017 Quick Sort.mp432.41MB