Torrent Info
| Title | Master ([Udemy] Master the Coding Interview 3a Big Tech (FAANG) Interviews [04.2021] [En]) |
| Category | Movies |
| Size | 16.53GB |
Movie Info
| Title | Master |
| Year | 2021 |
| Country | India |
| Category | Crime, Thriller |
| Director | Lokesh Kanagaraj |
| Actors | Malavika Mohanan, Joseph Vijay, Vijay Sethupathi, Andrea Jeremiah |
| Description | An alcoholic professor who is sent to a juvenile school, where he clashes with a gangster, who uses the children of the school for criminal activities. |
Files List
| Please note that this page does not hosts or makes available any of the listed filenames. You cannot download any of those files from here. | |
| 001 A General Approach To Thinking About Most Graph Questions.en.srt | 13.02KB |
| 001 A General Approach To Thinking About Most Graph Questions.mp4 | 130.85MB |
| 001 Arrays Introduction.en.srt | 14.85KB |
| 001 Arrays Introduction.mp4 | 80.84MB |
| 001 Bonus Lecture.html | 4.37KB |
| 001 Course Breakdown.en.srt | 16.19KB |
| 001 Course Breakdown.mp4 | 151.25MB |
| 001 Graph + Tree Traversals.en.srt | 4.52KB |
| 001 Graph + Tree Traversals.mp4 | 35.29MB |
| 001 Hash Tables Introduction.en.srt | 4.69KB |
| 001 Hash Tables Introduction.mp4 | 49.14MB |
| 001 Interview Question #11 - Minimum Brackets To Remove.en.srt | 9.94KB |
| 001 Interview Question #11 - Minimum Brackets To Remove.mp4 | 88.81MB |
| 001 Interview Question #1 Two Sum.en.srt | 11.01KB |
| 001 Interview Question #1 Two Sum.mp4 | 107.13MB |
| 001 Interview Question #2 - Container With Most Water.en.srt | 5.76KB |
| 001 Interview Question #2 - Container With Most Water.mp4 | 71.93MB |
| 001 Interview Question #3 - Trapping Rainwater.en.srt | 10.06KB |
| 001 Interview Question #3 - Trapping Rainwater.mp4 | 86.94MB |
| 001 Interview Question #4 -Typed Out Strings.en.srt | 10.59KB |
| 001 Interview Question #4 -Typed Out Strings.mp4 | 110.38MB |
| 001 Interview Question #5 - Longest Substring Without Repeating Characters.en.srt | 9.00KB |
| 001 Interview Question #5 - Longest Substring Without Repeating Characters.mp4 | 73.80MB |
| 001 Interview Question #7 - M, N Reversals.en.srt | 9.28KB |
| 001 Interview Question #7 - M, N Reversals.mp4 | 68.63MB |
| 001 Interview Question #8 - Merge Multi-Level Doubly Linked List.en.srt | 12.69KB |
| 001 Interview Question #8 - Merge Multi-Level Doubly Linked List.mp4 | 141.27MB |
| 001 Interview Question #9 - Cycle Detection.en.srt | 15.73KB |
| 001 Interview Question #9 - Cycle Detection.mp4 | 83.47MB |
| 001 Introducing 2D Arrays - What Are They_.en.srt | 9.41KB |
| 001 Introducing 2D Arrays - What Are They_.mp4 | 112.42MB |
| 001 Introducing Heaps.en.srt | 11.11KB |
| 001 Introducing Heaps.mp4 | 85.28MB |
| 001 Introducing Recursion.en.srt | 4.41KB |
| 001 Introducing Recursion.mp4 | 46.80MB |
| 001 Introducing Tries.en.srt | 1.50KB |
| 001 Introducing Tries.mp4 | 16.50MB |
| 001 Introduction To The Types Of Graphs.en.srt | 15.66KB |
| 001 Introduction To The Types Of Graphs.mp4 | 166.07MB |
| 001 Intro to Binary Trees.en.srt | 2.47KB |
| 001 Intro to Binary Trees.mp4 | 27.82MB |
| 001 Intro To Palindromes.en.srt | 12.74KB |
| 001 Intro To Palindromes.mp4 | 153.74MB |
| 001 Intro to Stacks and Queues.en.srt | 4.06KB |
| 001 Intro to Stacks and Queues.mp4 | 46.54MB |
| 001 Learning Guideline.html | 1.19KB |
| 001 Linked List Introduction.en.srt | 5.57KB |
| 001 Linked List Introduction.mp4 | 59.43MB |
| 001 Linked Lists Introduction.en.srt | 2.82KB |
| 001 Linked Lists Introduction.mp4 | 31.28MB |
| 001 Question #12 - Implement Queue With Stacks.en.srt | 5.96KB |
| 001 Question #12 - Implement Queue With Stacks.mp4 | 63.59MB |
| 001 Question #16 - Level Order Of Binary Tree.en.srt | 7.14KB |
| 001 Question #16 - Level Order Of Binary Tree.mp4 | 53.23MB |
| 001 Question #17 - Right Side View of Tree.en.srt | 9.75KB |
| 001 Question #17 - Right Side View of Tree.mp4 | 56.79MB |
| 001 Question #18 - Number Of Nodes In Complete Tree.en.srt | 11.86KB |
| 001 Question #18 - Number Of Nodes In Complete Tree.mp4 | 78.38MB |
| 001 Question #19 - Validate Binary Search Tree.en.srt | 11.74KB |
| 001 Question #19 - Validate Binary Search Tree.mp4 | 95.15MB |
| 001 Question #21 Rotting Oranges.en.srt | 9.79KB |
| 001 Question #21 Rotting Oranges.mp4 | 80.44MB |
| 001 Question #22 - Walls And Gates.en.srt | 8.81KB |
| 001 Question #22 - Walls And Gates.mp4 | 69.59MB |
| 001 Question #23 - Time Needed to Inform All Employees.en.srt | 18.28KB |
| 001 Question #23 - Time Needed to Inform All Employees.mp4 | 157.37MB |
| 001 Question #24 - Course Scheduler.en.srt | 14.97KB |
| 001 Question #24 - Course Scheduler.mp4 | 102.50MB |
| 001 Question #25 - Network Time Delay.en.srt | 17.59KB |
| 001 Question #25 - Network Time Delay.mp4 | 199.67MB |
| 001 Question #26 - Minimum Cost Of Climbing Stairs & How To Approach DP.en.srt | 13.25KB |
| 001 Question #26 - Minimum Cost Of Climbing Stairs & How To Approach DP.mp4 | 145.96MB |
| 001 Question #27 - Knight Probability In Chessboard.en.srt | 16.17KB |
| 001 Question #27 - Knight Probability In Chessboard.mp4 | 150.38MB |
| 001 Recursion Introduction.en.srt | 6.78KB |
| 001 Recursion Introduction.mp4 | 43.84MB |
| 001 Section Overview.en.srt | 3.15KB |
| 001 Section Overview.mp4 | 25.47MB |
| 001 Sorting Introduction.en.srt | 9.18KB |
| 001 Sorting Introduction.mp4 | 80.49MB |
| 001 Stacks + Queues Introduction.en.srt | 3.69KB |
| 001 Stacks + Queues Introduction.mp4 | 35.79MB |
| 001 Trees Introduction.en.srt | 7.52KB |
| 001 Trees Introduction.mp4 | 68.99MB |
| 001 Understanding Binary Search.en.srt | 13.00KB |
| 001 Understanding Binary Search.mp4 | 136.76MB |
| 001 Understanding Interface Design & Question #29 - Monarchy.en.srt | 16.21KB |
| 001 Understanding Interface Design & Question #29 - Monarchy.mp4 | 164.94MB |
| 001 Understanding The Basics Of Backtracking.en.srt | 10.45KB |
| 001 Understanding The Basics Of Backtracking.mp4 | 106.54MB |
| 002 Basic Algorithm_ Reverse a Linked List.en.srt | 12.04KB |
| 002 Basic Algorithm_ Reverse a Linked List.mp4 | 58.18MB |
| 002 BFS Introduction.en.srt | 3.17KB |
| 002 BFS Introduction.mp4 | 23.92MB |
| 002 Binary Trees.en.srt | 6.97KB |
| 002 Binary Trees.mp4 | 63.43MB |
| 002 Coming Up With A Brute Force Approach.en.srt | 10.56KB |
| 002 Coming Up With A Brute Force Approach.mp4 | 20.45MB |
| 002 Coming Up With A Logical Solution.en.srt | 22.51KB |
| 002 Coming Up With A Logical Solution.mp4 | 111.30MB |
| 002 Coming Up With Test Cases.en.srt | 5.34KB |
| 002 Coming Up With Test Cases.mp4 | 20.32MB |
| 002 Depth First Search In 2D-Arrays.en.srt | 12.45KB |
| 002 Depth First Search In 2D-Arrays.mp4 | 115.09MB |
| 002 Figuring Out Our Initial Logic.en.srt | 15.44KB |
| 002 Figuring Out Our Initial Logic.mp4 | 55.48MB |
| 002 Figuring Out Our Logical Solution.en.srt | 19.74KB |
| 002 Figuring Out Our Logical Solution.mp4 | 65.78MB |
| 002 Figuring Out Our Solution.en.srt | 13.80KB |
| 002 Figuring Out Our Solution.mp4 | 45.48MB |
| 002 Figuring Out Our Test Cases.en.srt | 11.69KB |
| 002 Figuring Out Our Test Cases.en.srt | 9.19KB |
| 002 Figuring Out Our Test Cases.mp4 | 42.37MB |
| 002 Figuring Out Our Test Cases.mp4 | 47.81MB |
| 002 Hash Function.en.srt | 6.35KB |
| 002 Hash Function.mp4 | 88.01MB |
| 002 How To Approach Our Problem.en.srt | 16.56KB |
| 002 How To Approach Our Problem.mp4 | 68.15MB |
| 002 How To Code Binary Search.en.srt | 8.88KB |
| 002 How To Code Binary Search.mp4 | 32.58MB |
| 002 Insertion In Heaps - Understanding Sift Up.en.srt | 9.68KB |
| 002 Insertion In Heaps - Understanding Sift Up.mp4 | 43.08MB |
| 002 Interview Question #10 - Valid Parentheses.en.srt | 11.79KB |
| 002 Interview Question #10 - Valid Parentheses.mp4 | 102.01MB |
| 002 Interview Question #6 - Valid Palindrome.en.srt | 11.33KB |
| 002 Interview Question #6 - Valid Palindrome.mp4 | 56.24MB |
| 002 Join Our Online Classroom!.html | 3.55KB |
| 002 LinkedIn Endorsements.html | 2.93KB |
| 002 Logic Of Our Brute Force.en.srt | 11.41KB |
| 002 Logic Of Our Brute Force.mp4 | 39.88MB |
| 002 Optional_ Tail Recursion.en.srt | 28.13KB |
| 002 Optional_ Tail Recursion.mp4 | 231.88MB |
| 002 Question #15 - Maximum Depth of Binary Tree.en.srt | 9.40KB |
| 002 Question #15 - Maximum Depth of Binary Tree.mp4 | 72.26MB |
| 002 Question #20 Number Of Islands.en.srt | 10.40KB |
| 002 Question #20 Number Of Islands.mp4 | 75.93MB |
| 002 Question #28 - Sudoku Solver.en.srt | 6.71KB |
| 002 Question #28 - Sudoku Solver.mp4 | 65.46MB |
| 002 Question #30 - Implement Prefix Trie.en.srt | 15.60KB |
| 002 Question #30 - Implement Prefix Trie.mp4 | 135.27MB |
| 002 Representing Our Graphs - Adjacency List & Adjacency Matrix.en.srt | 10.82KB |
| 002 Representing Our Graphs - Adjacency List & Adjacency Matrix.mp4 | 109.30MB |
| 002 Stack Overflow.en.srt | 7.92KB |
| 002 Stack Overflow.mp4 | 42.70MB |
| 002 Stacks.en.srt | 4.33KB |
| 002 Stacks.mp4 | 38.37MB |
| 002 Static vs Dynamic Arrays.en.srt | 7.19KB |
| 002 Static vs Dynamic Arrays.mp4 | 43.51MB |
| 002 The Issue With sort().en.srt | 8.35KB |
| 002 The Issue With sort().mp4 | 40.68MB |
| 002 Thinking About A Logical Solution.en.srt | 18.29KB |
| 002 Thinking About A Logical Solution.mp4 | 74.88MB |
| 002 Thinking About How To Approach The Problem.en.srt | 13.15KB |
| 002 Thinking About How To Approach The Problem.mp4 | 45.05MB |
| 002 Thinking About Our Initial Solution - BFS.en.srt | 11.57KB |
| 002 Thinking About Our Initial Solution - BFS.mp4 | 33.02MB |
| 002 Thinking About Our Logical Solution.en.srt | 20.16KB |
| 002 Thinking About Our Logical Solution.mp4 | 75.67MB |
| 002 Thinking About Our Solution.en.srt | 18.66KB |
| 002 Thinking About Our Solution.mp4 | 57.33MB |
| 002 Thinking About Test Cases To Help Us.en.srt | 5.82KB |
| 002 Thinking About Test Cases To Help Us.mp4 | 14.34MB |
| 002 Thinking Deeply About A Full Binary Tree.en.srt | 15.16KB |
| 002 Thinking Deeply About A Full Binary Tree.mp4 | 61.64MB |
| 002 Understanding & Identifying Recurrence Relation.en.srt | 21.08KB |
| 002 Understanding & Identifying Recurrence Relation.mp4 | 96.23MB |
| 002 Understanding The Breadth First Search Approach.en.srt | 12.34KB |
| 002 Understanding The Breadth First Search Approach.mp4 | 44.06MB |
| 002 Verifying Our Constraints And Thinking About Test Cases.en.srt | 11.81KB |
| 002 Verifying Our Constraints And Thinking About Test Cases.mp4 | 68.80MB |
| 002 Walking Through Our Solution.en.srt | 24.17KB |
| 002 Walking Through Our Solution.mp4 | 110.65MB |
| 002 What Is A Linked List_.en.srt | 5.36KB |
| 002 What Is A Linked List_.mp4 | 42.84MB |
| 002 What Is Floyd's Tortoise And Hare Algorithm_.en.srt | 4.32KB |
| 002 What Is Floyd's Tortoise And Hare Algorithm_.mp4 | 48.22MB |
| 002 What Is Good Code_.en.srt | 7.95KB |
| 002 What Is Good Code_.mp4 | 53.40MB |
| 003 Almost A Palindrome.en.srt | 14.72KB |
| 003 Almost A Palindrome.mp4 | 95.98MB |
| 003 Anatomy Of Recursion.en.srt | 11.40KB |
| 003 Anatomy Of Recursion.mp4 | 56.66MB |
| 003 Approaching Our Problem - Thinking Deeply About The Values.en.srt | 22.68KB |
| 003 Approaching Our Problem - Thinking Deeply About The Values.mp4 | 97.89MB |
| 003 Become An Alumni.html | 1.89KB |
| 003 Big O and Scalability.en.srt | 13.85KB |
| 003 Big O and Scalability.mp4 | 85.94MB |
| 003 Breadth First Search In Graphs.en.srt | 7.43KB |
| 003 Breadth First Search In Graphs.mp4 | 69.18MB |
| 003 Coding DFS - Setting Up For DFS.en.srt | 12.99KB |
| 003 Coding DFS - Setting Up For DFS.mp4 | 52.77MB |
| 003 Coding Floyd's Algorithm.en.srt | 11.81KB |
| 003 Coding Floyd's Algorithm.mp4 | 44.58MB |
| 003 Coding Our Brute Force.en.srt | 11.31KB |
| 003 Coding Our Brute Force.en.srt | 11.74KB |
| 003 Coding Our Brute Force.en.srt | 12.66KB |
| 003 Coding Our Brute Force.mp4 | 58.53MB |
| 003 Coding Our Brute Force.mp4 | 45.62MB |
| 003 Coding Our Brute Force.mp4 | 58.34MB |
| 003 Coding Our Solution.en.srt | 21.19KB |
| 003 Coding Our Solution.en.srt | 14.47KB |
| 003 Coding Our Solution.en.srt | 10.43KB |
| 003 Coding Our Solution.mp4 | 92.25MB |
| 003 Coding Our Solution.mp4 | 67.03MB |
| 003 Coding Our Solution.mp4 | 43.70MB |
| 003 Coding Out Level Order Traversal.en.srt | 14.44KB |
| 003 Coding Out Level Order Traversal.mp4 | 73.05MB |
| 003 Coding Out Our Initial BFS Solution.en.srt | 20.43KB |
| 003 Coding Out Our Initial BFS Solution.mp4 | 86.69MB |
| 003 Coding Out Our Solution.en.srt | 16.29KB |
| 003 Coding Out Our Solution.mp4 | 66.42MB |
| 003 Deletion In Heaps - Understanding Sift Down.en.srt | 15.55KB |
| 003 Deletion In Heaps - Understanding Sift Down.mp4 | 57.80MB |
| 003 DFS Introduction.en.srt | 4.23KB |
| 003 DFS Introduction.mp4 | 30.30MB |
| 003 Exercise_ Meet The Community.html | 3.29KB |
| 003 Exercise_ Why Linked Lists_.en.srt | 2.61KB |
| 003 Exercise_ Why Linked Lists_.mp4 | 6.19MB |
| 003 Figuring Out Number Of Nodes At Last Level.en.srt | 21.29KB |
| 003 Figuring Out Number Of Nodes At Last Level.mp4 | 97.40MB |
| 003 Figuring Out Our Boundaries.en.srt | 9.90KB |
| 003 Figuring Out Our Boundaries.mp4 | 43.52MB |
| 003 Figuring Out The Rest Of Our Solution.en.srt | 19.69KB |
| 003 Figuring Out The Rest Of Our Solution.mp4 | 83.61MB |
| 003 First Step - Recursive Solution From Recurrence Relation.en.srt | 7.32KB |
| 003 First Step - Recursive Solution From Recurrence Relation.mp4 | 33.87MB |
| 003 Greedy Method & What Is Dijkstra's Algorithm_.en.srt | 21.94KB |
| 003 Greedy Method & What Is Dijkstra's Algorithm_.mp4 | 233.71MB |
| 003 Hash Collisions.en.srt | 10.35KB |
| 003 Hash Collisions.mp4 | 69.33MB |
| 003 How To Represent Our Graph As An Adjacency List.en.srt | 13.20KB |
| 003 How To Represent Our Graph As An Adjacency List.mp4 | 48.57MB |
| 003 Identifying The Recurrence Relation.en.srt | 22.64KB |
| 003 Identifying The Recurrence Relation.mp4 | 77.25MB |
| 003 Learning The Backtracking Template.en.srt | 16.52KB |
| 003 Learning The Backtracking Template.mp4 | 61.31MB |
| 003 Learning The Process For Solving Binary Tree Problems.en.srt | 27.05KB |
| 003 Learning The Process For Solving Binary Tree Problems.mp4 | 112.96MB |
| 003 Note_ A great visualization helper written in Python by Karen Fisher.html | 2.53KB |
| 003 O(log n).en.srt | 8.30KB |
| 003 O(log n).mp4 | 47.24MB |
| 003 Optional_ Implementing An Array.en.srt | 18.02KB |
| 003 Optional_ Implementing An Array.mp4 | 99.32MB |
| 003 Question #14 - Start And End Of Target In A Sorted Array.en.srt | 6.98KB |
| 003 Question #14 - Start And End Of Target In A Sorted Array.mp4 | 57.03MB |
| 003 Queues.en.srt | 4.25KB |
| 003 Queues.mp4 | 40.40MB |
| 003 Sorting.en.srt | 3.18KB |
| 003 Sorting.mp4 | 34.09MB |
| 003 Sorting Algorithms.en.srt | 4.69KB |
| 003 Sorting Algorithms.mp4 | 27.82MB |
| 003 Thinking About Our Solution.en.srt | 14.41KB |
| 003 Thinking About Our Solution.mp4 | 65.02MB |
| 003 Thinking About The Logical Of The Monarchy.en.srt | 14.76KB |
| 003 Thinking About The Logical Of The Monarchy.mp4 | 79.27MB |
| 003 Thinking Through A Logical Brute Force Solution.en.srt | 15.51KB |
| 003 Thinking Through A Logical Brute Force Solution.mp4 | 102.42MB |
| 003 Understanding The Depth First Search Approach.en.srt | 12.08KB |
| 003 Understanding The Depth First Search Approach.mp4 | 49.61MB |
| 003 Understanding The Logic For Our Methods.en.srt | 5.27KB |
| 003 Understanding The Logic For Our Methods.mp4 | 24.50MB |
| 003 Walking Through Our Problem - Identifying The Need For A Stack.en.srt | 12.25KB |
| 003 Walking Through Our Problem - Identifying The Need For A Stack.mp4 | 32.02MB |
| 003 Writing Our Brute Force Solution.en.srt | 9.07KB |
| 003 Writing Our Brute Force Solution.mp4 | 41.28MB |
| 004 Applying Our Backtracking Template To Sudoku Solver Logic.en.srt | 9.90KB |
| 004 Applying Our Backtracking Template To Sudoku Solver Logic.mp4 | 39.88MB |
| 004 Approaching Our Problem - Thinking About Traversals.en.srt | 13.46KB |
| 004 Approaching Our Problem - Thinking About Traversals.mp4 | 56.06MB |
| 004 BFS vs DFS.en.srt | 4.26KB |
| 004 BFS vs DFS.mp4 | 39.58MB |
| 004 Binary Search Trees.en.srt | 7.17KB |
| 004 Binary Search Trees.mp4 | 57.04MB |
| 004 Bubble Sort.en.srt | 4.86KB |
| 004 Bubble Sort.mp4 | 34.08MB |
| 004 Coding BFS.en.srt | 10.82KB |
| 004 Coding BFS.mp4 | 48.91MB |
| 004 Coding Challenges.html | 1.71KB |
| 004 Coding DFS - Implementing Recursive DFS.en.srt | 11.20KB |
| 004 Coding DFS - Implementing Recursive DFS.mp4 | 55.08MB |
| 004 Coding Our Monarchy Solution.en.srt | 19.38KB |
| 004 Coding Our Monarchy Solution.mp4 | 64.49MB |
| 004 Coding Our Our Full Solution.en.srt | 10.42KB |
| 004 Coding Our Our Full Solution.mp4 | 40.99MB |
| 004 Coding Our Solution.en.srt | 7.70KB |
| 004 Coding Our Solution.mp4 | 44.73MB |
| 004 Coding Our Solution With A Stack.en.srt | 12.26KB |
| 004 Coding Our Solution With A Stack.mp4 | 55.28MB |
| 004 Coding Out Our Brute Force Solution.en.srt | 9.86KB |
| 004 Coding Out Our Brute Force Solution.mp4 | 50.70MB |
| 004 Coding Out Our Full Solution.en.srt | 28.97KB |
| 004 Coding Out Our Full Solution.mp4 | 125.81MB |
| 004 Coding Out Our Solution.en.srt | 19.65KB |
| 004 Coding Out Our Solution.mp4 | 87.19MB |
| 004 Coding Reverse A Linked List Solution.en.srt | 9.48KB |
| 004 Coding Reverse A Linked List Solution.mp4 | 34.93MB |
| 004 Download All Code + Solutions.html | 1.34KB |
| 004 Exercise_ Stacks VS Queues.en.srt | 3.33KB |
| 004 Exercise_ Stacks VS Queues.mp4 | 10.56MB |
| 004 Figuring Out Our Optimization Strategy.en.srt | 34.96KB |
| 004 Figuring Out Our Optimization Strategy.mp4 | 170.94MB |
| 004 Figuring Out Our Solution.en.srt | 9.52KB |
| 004 Figuring Out Our Solution.mp4 | 22.96MB |
| 004 First Step - Recursive Solution From Recurrence Relation.en.srt | 6.92KB |
| 004 First Step - Recursive Solution From Recurrence Relation.mp4 | 26.53MB |
| 004 Hash Tables VS Arrays.en.srt | 2.41KB |
| 004 Hash Tables VS Arrays.mp4 | 21.42MB |
| 004 Implementing Our Prefix Trie Data Structure Solution.en.srt | 19.78KB |
| 004 Implementing Our Prefix Trie Data Structure Solution.mp4 | 60.85MB |
| 004 Interview Question #13 - Kth Largest Element.en.srt | 9.63KB |
| 004 Interview Question #13 - Kth Largest Element.mp4 | 74.84MB |
| 004 Mastering the Coding Interview (FAANG) - Course Outline.pdf | 65.42KB |
| 004 Note_ Correction to space complexity.html | 1.40KB |
| 004 O(n).en.srt | 6.16KB |
| 004 O(n).mp4 | 54.82MB |
| 004 Optional_ Proof Of How And Why Floyd's Algorithm Works.en.srt | 33.58KB |
| 004 Optional_ Proof Of How And Why Floyd's Algorithm Works.mp4 | 142.55MB |
| 004 Recursive VS Iterative.en.srt | 4.78KB |
| 004 Recursive VS Iterative.mp4 | 46.07MB |
| 004 Solution_ Why Linked Lists_.en.srt | 6.77KB |
| 004 Solution_ Why Linked Lists_.mp4 | 69.72MB |
| 004 Solving Our Problem Logically Using DFS Traversal.en.srt | 11.90KB |
| 004 Solving Our Problem Logically Using DFS Traversal.mp4 | 39.92MB |
| 004 Space And Time Complexity.en.srt | 10.03KB |
| 004 Space And Time Complexity.en.srt | 4.43KB |
| 004 Space And Time Complexity.mp4 | 75.60MB |
| 004 Space And Time Complexity.mp4 | 23.51MB |
| 004 Starting To Code Our Priority Queue Class.en.srt | 14.23KB |
| 004 Starting To Code Our Priority Queue Class.mp4 | 38.70MB |
| 004 Testing Our Optimal Solution With Our Test Cases.en.srt | 13.82KB |
| 004 Testing Our Optimal Solution With Our Test Cases.mp4 | 49.94MB |
| 004 Thinking About A Solution With Dijkstra's Algorithm.en.srt | 12.93KB |
| 004 Thinking About A Solution With Dijkstra's Algorithm.mp4 | 132.54MB |
| 004 Thinking About Our Approach.en.srt | 24.14KB |
| 004 Thinking About Our Approach.mp4 | 100.74MB |
| 004 Thinking About Pre-Order, In-Order, and Post-Order Traversals For Our Solution.en.srt | 16.90KB |
| 004 Thinking About Pre-Order, In-Order, and Post-Order Traversals For Our Solution.mp4 | 74.38MB |
| 004 Walking Through Our Solution.en.srt | 15.25KB |
| 004 Walking Through Our Solution.mp4 | 49.48MB |
| 004 What is Topological Sort_.en.srt | 10.78KB |
| 004 What is Topological Sort_.mp4 | 115.71MB |
| 005 Balanced VS Unbalanced BST.en.srt | 4.20KB |
| 005 Balanced VS Unbalanced BST.mp4 | 30.73MB |
| 005 Breadth First Search In 2D-Arrays.en.srt | 13.56KB |
| 005 Breadth First Search In 2D-Arrays.mp4 | 117.34MB |
| 005 Coding How To Get Box ID.en.srt | 10.74KB |
| 005 Coding How To Get Box ID.mp4 | 56.06MB |
| 005 Coding Our DFS Solution.en.srt | 14.13KB |
| 005 Coding Our DFS Solution.mp4 | 56.17MB |
| 005 Coding Our Insertion And Sift Up Methods.en.srt | 7.46KB |
| 005 Coding Our Insertion And Sift Up Methods.mp4 | 28.86MB |
| 005 Coding Our Optimal Solution.en.srt | 16.78KB |
| 005 Coding Our Optimal Solution.mp4 | 87.83MB |
| 005 Coding Our Solution.en.srt | 12.45KB |
| 005 Coding Our Solution.en.srt | 17.13KB |
| 005 Coding Our Solution.en.srt | 25.85KB |
| 005 Coding Our Solution.mp4 | 55.80MB |
| 005 Coding Our Solution.mp4 | 85.83MB |
| 005 Coding Our Solution.mp4 | 105.21MB |
| 005 Coding Our Solution With Dijkstra.en.srt | 22.34KB |
| 005 Coding Our Solution With Dijkstra.mp4 | 111.36MB |
| 005 Coding Out Our Solution.en.srt | 20.48KB |
| 005 Coding Out Our Solution.mp4 | 95.82MB |
| 005 Coming Up With Optimal Solution.en.srt | 15.20KB |
| 005 Coming Up With Optimal Solution.mp4 | 64.62MB |
| 005 Completing Our DFS Solution.en.srt | 11.64KB |
| 005 Completing Our DFS Solution.mp4 | 49.28MB |
| 005 Depth First Search In Graphs.en.srt | 4.98KB |
| 005 Depth First Search In Graphs.mp4 | 37.23MB |
| 005 Exercise_ BFS vs DFS.en.srt | 1.04KB |
| 005 Exercise_ BFS vs DFS.mp4 | 3.50MB |
| 005 Exercise_ Bubble Sort.html | 1.00KB |
| 005 Insights From Quick Sort.en.srt | 17.39KB |
| 005 Insights From Quick Sort.mp4 | 55.92MB |
| 005 Monthly Coding Challenges, Free Resources and Guides.html | 2.55KB |
| 005 O(1).en.srt | 6.52KB |
| 005 O(1).mp4 | 60.19MB |
| 005 Second Step - Memoizing Our Redundant Recursive Calls.en.srt | 10.33KB |
| 005 Second Step - Memoizing Our Redundant Recursive Calls.en.srt | 19.44KB |
| 005 Second Step - Memoizing Our Redundant Recursive Calls.mp4 | 41.42MB |
| 005 Second Step - Memoizing Our Redundant Recursive Calls.mp4 | 83.50MB |
| 005 Sliding Window Technique.en.srt | 7.78KB |
| 005 Sliding Window Technique.mp4 | 78.61MB |
| 005 Solution_ Stacks VS Queues.en.srt | 4.47KB |
| 005 Solution_ Stacks VS Queues.mp4 | 12.44MB |
| 005 Stepping Through Our Code.en.srt | 6.75KB |
| 005 Stepping Through Our Code.mp4 | 33.15MB |
| 005 Submitting To Leetcode.en.srt | 3.17KB |
| 005 Submitting To Leetcode.mp4 | 11.17MB |
| 005 Thinking About A Solution With Topological Sort.en.srt | 7.15KB |
| 005 Thinking About A Solution With Topological Sort.mp4 | 72.23MB |
| 005 What Is A Pointer_.en.srt | 5.72KB |
| 005 What Is A Pointer_.mp4 | 26.67MB |
| 005 When To Use Recursion.en.srt | 4.83KB |
| 005 When To Use Recursion.mp4 | 53.37MB |
| 006 Analyzing Space and Time Complexity.en.srt | 14.57KB |
| 006 Analyzing Space and Time Complexity.mp4 | 102.24MB |
| 006 BST Pros and Cons.en.srt | 2.91KB |
| 006 BST Pros and Cons.mp4 | 32.14MB |
| 006 Coding BFS.en.srt | 13.52KB |
| 006 Coding BFS.mp4 | 62.60MB |
| 006 Coding DFS.en.srt | 9.87KB |
| 006 Coding DFS.mp4 | 42.23MB |
| 006 Coding Our Deletion And Sift Down Methods.en.srt | 16.54KB |
| 006 Coding Our Deletion And Sift Down Methods.mp4 | 73.78MB |
| 006 Coding Our Final DFS Solution.en.srt | 16.26KB |
| 006 Coding Our Final DFS Solution.mp4 | 72.71MB |
| 006 Coding Our Final Solution.en.srt | 22.28KB |
| 006 Coding Our Final Solution.mp4 | 92.23MB |
| 006 Coding Our Memoization Optimization.en.srt | 10.71KB |
| 006 Coding Our Memoization Optimization.mp4 | 52.54MB |
| 006 Coding Our Optimal Solution.en.srt | 15.25KB |
| 006 Coding Our Optimal Solution.mp4 | 64.16MB |
| 006 Doubly Linked Lists.en.srt | 3.79KB |
| 006 Doubly Linked Lists.mp4 | 41.27MB |
| 006 Exercise_ Big O Calculation.html | 1.45KB |
| 006 Figuring Out The Logic For Our Bottom Up Solution.en.srt | 19.61KB |
| 006 Figuring Out The Logic For Our Bottom Up Solution.mp4 | 94.02MB |
| 006 Hints For Optimizing Our Solution.en.srt | 3.15KB |
| 006 Hints For Optimizing Our Solution.mp4 | 27.05MB |
| 006 Optimal Code And LeetCode.en.srt | 3.13KB |
| 006 Optimal Code And LeetCode.mp4 | 17.56MB |
| 006 Recursion Review.en.srt | 3.00KB |
| 006 Recursion Review.mp4 | 33.65MB |
| 006 Setting Up Our Solution Code.en.srt | 9.19KB |
| 006 Setting Up Our Solution Code.mp4 | 41.48MB |
| 006 Solution_ BFS vs DFS.en.srt | 3.89KB |
| 006 Solution_ BFS vs DFS.mp4 | 18.40MB |
| 006 Solution_ Bubble Sort.en.srt | 5.37KB |
| 006 Solution_ Bubble Sort.mp4 | 27.00MB |
| 006 Stacks + Queues Review.en.srt | 2.69KB |
| 006 Stacks + Queues Review.mp4 | 28.22MB |
| 006 Thinking About Our Optimal Solution.en.srt | 18.81KB |
| 006 Thinking About Our Optimal Solution.mp4 | 64.70MB |
| 006 Thinking About Space And Time Complexity.en.srt | 21.46KB |
| 006 Thinking About Space And Time Complexity.mp4 | 98.11MB |
| 006 Time And Space Complexity Of Our Solution.en.srt | 18.59KB |
| 006 Time And Space Complexity Of Our Solution.mp4 | 94.68MB |
| 006 Understanding Divide And Conquer.en.srt | 10.84KB |
| 006 Understanding Divide And Conquer.mp4 | 120.82MB |
| 007 breadthFirstSearch().en.srt | 10.24KB |
| 007 breadthFirstSearch().mp4 | 70.15MB |
| 007 Coding Our Optimal Solution And Testing On LeetCode.en.srt | 13.19KB |
| 007 Coding Our Optimal Solution And Testing On LeetCode.mp4 | 77.28MB |
| 007 Coding Quicksort Into Our Solution.en.srt | 18.01KB |
| 007 Coding Quicksort Into Our Solution.mp4 | 73.15MB |
| 007 Coding The Recursive Backtracking Portion Of Our Solution.en.srt | 25.68KB |
| 007 Coding The Recursive Backtracking Portion Of Our Solution.mp4 | 123.84MB |
| 007 Optimizing Our Solution.en.srt | 11.52KB |
| 007 Optimizing Our Solution.mp4 | 47.61MB |
| 007 Selection Sort.en.srt | 3.09KB |
| 007 Selection Sort.mp4 | 27.56MB |
| 007 Singly VS Doubly Linked Lists.en.srt | 3.40KB |
| 007 Singly VS Doubly Linked Lists.mp4 | 32.44MB |
| 007 Solution_ Big O Calculation.en.srt | 7.11KB |
| 007 Solution_ Big O Calculation.mp4 | 24.66MB |
| 007 Submitting To LeetCode.en.srt | 8.34KB |
| 007 Submitting To LeetCode.mp4 | 43.05MB |
| 007 Thinking About Negative Weights.en.srt | 11.21KB |
| 007 Thinking About Negative Weights.mp4 | 58.69MB |
| 007 Thinking About Optimal Solution.en.srt | 12.37KB |
| 007 Thinking About Optimal Solution.mp4 | 27.16MB |
| 007 Third Step - Bottom Up Tabulation.en.srt | 10.33KB |
| 007 Third Step - Bottom Up Tabulation.mp4 | 50.09MB |
| 007 Tries.en.srt | 3.79KB |
| 007 Tries.mp4 | 40.32MB |
| 007 Understanding The Bottom Up Approach (Tabulation).en.srt | 10.00KB |
| 007 Understanding The Bottom Up Approach (Tabulation).mp4 | 30.70MB |
| 008 Coding Our Optimal Solution.en.srt | 7.41KB |
| 008 Coding Our Optimal Solution.en.srt | 10.29KB |
| 008 Coding Our Optimal Solution.mp4 | 28.69MB |
| 008 Coding Our Optimal Solution.mp4 | 52.05MB |
| 008 Exercise_ Big O Calculation 2.html | 1.85KB |
| 008 Exercise_ Selection Sort.html | 1.01KB |
| 008 Fourth Step - Bottom Up Optimization.en.srt | 8.50KB |
| 008 Fourth Step - Bottom Up Optimization.mp4 | 49.91MB |
| 008 Linked Lists Review.en.srt | 5.80KB |
| 008 Linked Lists Review.mp4 | 58.96MB |
| 008 PreOrder, InOrder, PostOrder.en.srt | 5.86KB |
| 008 PreOrder, InOrder, PostOrder.mp4 | 43.29MB |
| 008 Thinking About The Space And Time Complexity.en.srt | 11.08KB |
| 008 Thinking About The Space And Time Complexity.mp4 | 58.99MB |
| 008 Third Step - Bottom Up Tabulation.en.srt | 7.56KB |
| 008 Third Step - Bottom Up Tabulation.mp4 | 32.10MB |
| 008 What Is Hoare's Quickselect Algorithm_.en.srt | 10.13KB |
| 008 What Is Hoare's Quickselect Algorithm_.mp4 | 34.63MB |
| 008 What is The Bellman-Ford Algorithm_ - Conceptualizing Dynamic Programming.en.srt | 21.60KB |
| 008 What is The Bellman-Ford Algorithm_ - Conceptualizing Dynamic Programming.mp4 | 98.86MB |
| 009 Coding Our Solution With Quickselect.en.srt | 15.69KB |
| 009 Coding Our Solution With Quickselect.mp4 | 81.43MB |
| 009 depthFirstSearch().en.srt | 12.50KB |
| 009 depthFirstSearch().mp4 | 90.44MB |
| 009 Dynamic Programming List.html | 3.59KB |
| 009 Fourth Step - Bottom Up Optimization.en.srt | 9.23KB |
| 009 Fourth Step - Bottom Up Optimization.mp4 | 39.57MB |
| 009 Note_ Correction for explanation of +1.html | 2.94KB |
| 009 Solution_ Big O Calculation 2.en.srt | 2.73KB |
| 009 Solution_ Big O Calculation 2.mp4 | 13.40MB |
| 009 Solution_ Selection Sort.en.srt | 3.04KB |
| 009 Solution_ Selection Sort.mp4 | 19.17MB |
| 009 Testing Our Optimal Solution With Our Test Cases & Space and Time Complexity.en.srt | 12.48KB |
| 009 Testing Our Optimal Solution With Our Test Cases & Space and Time Complexity.mp4 | 47.77MB |
| 009 What is The Bellman-Ford Algorithm_ - The Algorithm Itself.en.srt | 22.68KB |
| 009 What is The Bellman-Ford Algorithm_ - The Algorithm Itself.mp4 | 70.50MB |
| 010 Checking Performance on Leetcode.en.srt | 5.44KB |
| 010 Checking Performance on Leetcode.mp4 | 24.26MB |
| 010 Coding Our Solution With Bellman-Ford.en.srt | 11.18KB |
| 010 Coding Our Solution With Bellman-Ford.mp4 | 50.34MB |
| 010 Correction About Time Complexity.html | 2.13KB |
| 010 Dancing Algorithms.en.srt | 1.95KB |
| 010 Dancing Algorithms.mp4 | 30.46MB |
| 010 Optimal Code And LeetCode.en.srt | 4.87KB |
| 010 Optimal Code And LeetCode.mp4 | 22.82MB |
| 010 Simplifying Big O.en.srt | 2.35KB |
| 010 Simplifying Big O.mp4 | 15.34MB |
| 011 Big O Rule 1.en.srt | 4.82KB |
| 011 Big O Rule 1.mp4 | 35.07MB |
| 011 Insertion Sort.en.srt | 3.41KB |
| 011 Insertion Sort.mp4 | 19.18MB |
| 011 Solutions In Other Languages.html | 1.14KB |
| 012 Big O Rule 2.en.srt | 7.08KB |
| 012 Big O Rule 2.mp4 | 48.88MB |
| 012 Exercise_ Insertion Sort.html | 1.01KB |
| 013 Big O Rule 3.en.srt | 3.51KB |
| 013 Big O Rule 3.mp4 | 17.31MB |
| 013 Solution_ Insertion Sort.en.srt | 2.46KB |
| 013 Solution_ Insertion Sort.mp4 | 13.36MB |
| 014 Merge Sort and O(n log n).en.srt | 10.50KB |
| 014 Merge Sort and O(n log n).mp4 | 75.14MB |
| 014 O(n^2).en.srt | 7.27KB |
| 014 O(n^2).mp4 | 42.17MB |
| 015 Big O Rule 4.en.srt | 7.94KB |
| 015 Big O Rule 4.mp4 | 48.23MB |
| 015 Exercise_ Merge Sort.html | 1.00KB |
| 016 Big O Cheat Sheet.en.srt | 4.28KB |
| 016 Big O Cheat Sheet.mp4 | 16.97MB |
| 016 Solution_ Merge Sort.en.srt | 5.18KB |
| 016 Solution_ Merge Sort.mp4 | 37.45MB |
| 017 Quick Sort.en.srt | 9.64KB |
| 017 Quick Sort.mp4 | 98.78MB |
| 017 What Does This All Mean_.en.srt | 6.88KB |
| 017 What Does This All Mean_.mp4 | 58.05MB |
| 018 O(n!).en.srt | 1.87KB |
| 018 O(n!).mp4 | 14.06MB |
| 019 3 Pillars Of Programming.en.srt | 4.45KB |
| 019 3 Pillars Of Programming.mp4 | 43.85MB |
| 020 Space Complexity.en.srt | 2.59KB |
| 020 Space Complexity.mp4 | 25.59MB |
| 021 Exercise_ Space Complexity.en.srt | 6.79KB |
| 021 Exercise_ Space Complexity.mp4 | 28.73MB |
| 022 Exercise_ Twitter.en.srt | 7.60KB |
| 022 Exercise_ Twitter.mp4 | 34.90MB |
| 023 Section Summary.en.srt | 5.71KB |
| 023 Section Summary.mp4 | 53.03MB |
| 207 BigO-cheat-sheet.pdf.zip | 26.57KB |
| 219 BigO-cheat-sheet.pdf.zip | 26.57KB |
| external-assets-links.txt | 154B |
| external-assets-links.txt | 447B |
| external-assets-links.txt | 377B |
| external-assets-links.txt | 284B |
| external-assets-links.txt | 353B |
| external-assets-links.txt | 441B |
| external-assets-links.txt | 596B |
| external-assets-links.txt | 231B |
| external-assets-links.txt | 149B |
| external-assets-links.txt | 197B |
| external-assets-links.txt | 370B |
| external-assets-links.txt | 307B |
| external-assets-links.txt | 180B |
| external-assets-links.txt | 167B |
| external-assets-links.txt | 597B |
| external-assets-links.txt | 211B |
| external-assets-links.txt | 340B |
| external-assets-links.txt | 158B |
| external-assets-links.txt | 281B |
| external-assets-links.txt | 186B |
| external-assets-links.txt | 176B |
| external-assets-links.txt | 104B |
| external-assets-links.txt | 164B |
| external-assets-links.txt | 251B |
| external-assets-links.txt | 161B |
| external-assets-links.txt | 417B |
| external-assets-links.txt | 360B |
| external-assets-links.txt | 192B |
| external-assets-links.txt | 483B |
| external-assets-links.txt | 325B |
| external-assets-links.txt | 454B |
| external-assets-links.txt | 614B |
| external-assets-links.txt | 461B |
| external-assets-links.txt | 89B |
| external-assets-links.txt | 195B |
| external-assets-links.txt | 611B |
| external-assets-links.txt | 139B |
| external-assets-links.txt | 203B |
| external-assets-links.txt | 293B |
| external-assets-links.txt | 122B |
| external-assets-links.txt | 237B |
| external-assets-links.txt | 386B |
| external-assets-links.txt | 284B |
| external-assets-links.txt | 904B |
Similar Torrents
Distribution statistics by country
| Belarus (BY) | 2 |
| Russia (RU) | 2 |
| France (FR) | 1 |
| Egypt (EG) | 1 |
| Belgium (BE) | 1 |
| Israel (IL) | 1 |
| Total | 8 |
| IP List | List of IP addresses which were distributed this torrent |