种子简介

种子名称： GetFreeCourses.Co-Udemy-The Complete Data Structures and Algorithms Course in Python
文件类型： 视频
文件数目： 358个文件
文件大小： 10.35 GB
收录时间： 2023-12-29 14:36
已经下载： 3次
资源热度： 69
最近下载： 2024-6-1 05:15

下载BT种子文件

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

磁力链接下载

magnet:?xt=urn:btih:65ce9289d00c780203f9ea4d4d8cf53501357464&dn=GetFreeCourses.Co-Udemy-The Complete Data Structures and Algorithms Course in Python 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

GetFreeCourses.Co-Udemy-The Complete Data Structures and Algorithms Course in Python.torrent

1. Introduction/1. Curriculum Walkthrough.mp434.08MB

1. Introduction/2. What are Data Structures.mp418.23MB

1. Introduction/3. What is an algorithm.mp421.08MB

1. Introduction/4. Why are Data Structures and Algorithms important.mp425.75MB

1. Introduction/5. Types of Data Structures.mp48.42MB

1. Introduction/6. Types of Algorithms.mp412.12MB

10. Cracking ArrayList Interview Questions (Amazon, Facebook, Apple and Microsoft)/1. Question 1 - Missing Number.mp420.12MB

10. Cracking ArrayList Interview Questions (Amazon, Facebook, Apple and Microsoft)/2. Question 2 - Pairs Two Sum - LeetCode 1.mp426.29MB

10. Cracking ArrayList Interview Questions (Amazon, Facebook, Apple and Microsoft)/3. Question 3 - Finding a number in an Array.mp415.73MB

10. Cracking ArrayList Interview Questions (Amazon, Facebook, Apple and Microsoft)/4. Question 4 - Max product of two int.mp428.28MB

10. Cracking ArrayList Interview Questions (Amazon, Facebook, Apple and Microsoft)/5. Question 5 - Is Unique Contains Duplicate - LeetCode 217.mp40B

10. Cracking ArrayList Interview Questions (Amazon, Facebook, Apple and Microsoft)/6. Question 6 - Permutation.mp426.05MB

10. Cracking ArrayList Interview Questions (Amazon, Facebook, Apple and Microsoft)/7. Question 7 - Rotate Matrix Image - LeetCode 48.mp451.22MB

12. Dictionaries/1. What is a Dictionary.mp412.02MB

12. Dictionaries/10. Dictionary vs List.mp46.71MB

12. Dictionaries/11. Time and Space Complexity of a Dictionary.mp415.38MB

12. Dictionaries/2. Create a Dictionary.mp426.39MB

12. Dictionaries/3. Dictionaries in memory.mp411.71MB

12. Dictionaries/4. Insert Update an element in a Dictionary.mp419.33MB

12. Dictionaries/5. Traverse through a Dictionary.mp419.79MB

12. Dictionaries/6. Search for an element in a Dictionary.mp422.92MB

12. Dictionaries/7. Delete Remove an element from a Dictionary.mp428.24MB

12. Dictionaries/8. Dictionary Methods.mp487.77MB

12. Dictionaries/9. Dictionary operations built in functions.mp477.7MB

13. Tuples/1. What is a Tuple How to create it.mp424MB

13. Tuples/2. Tuples in Memory Accessing an element of Tuple.mp424.31MB

13. Tuples/3. Traversing a Tuple.mp411.61MB

13. Tuples/4. Search for an element in Tuple.mp428.06MB

13. Tuples/5. Tuple OperationsFunctions.mp423.06MB

13. Tuples/6. Tuple vs List.mp444.27MB

13. Tuples/7. Time and Space complexity of Tuples.mp46.26MB

14. Linked List/1. What is a Linked List.mp438.64MB

14. Linked List/10. Search for a value in Single Linked List.mp433.92MB

14. Linked List/11. Deletion of node from Singly Linked List.mp434.13MB

14. Linked List/12. Deletion Method in Singly Linked List.mp455.99MB

14. Linked List/13. Deletion of entire Singly Linked List.mp423.78MB

14. Linked List/14. Time and Space Complexity of Singly Linked List.mp411.51MB

14. Linked List/15. Time Complexity of Linked List vs Arrays.mp427.39MB

14. Linked List/2. Linked List vs Arrays.mp413.81MB

14. Linked List/3. Types of Linked List.mp439.99MB

14. Linked List/4. Linked List in the Memory.mp49.26MB

14. Linked List/5. Creation of Singly Linked List.mp430.77MB

14. Linked List/6. Insertion in Singly Linked List in Memory.mp412.53MB

14. Linked List/7. Insertion in Singly Linked List Algorithm.mp431.52MB

14. Linked List/8. Insertion Method in Singly Linked List.mp461.66MB

14. Linked List/9. Traversal of Singly Linked List.mp428.15MB

15. Circular Singly Linked List/1. Creation of Circular Singly Linked List.mp430.6MB

15. Circular Singly Linked List/10. Deletion of entire Circular Singly Linked List.mp425.4MB

15. Circular Singly Linked List/11. Time and Space Complexity of Circular Singly Linked List.mp417.55MB

15. Circular Singly Linked List/2. Insertion in Circular Singly Linked List.mp421.78MB

15. Circular Singly Linked List/3. Insertion Algorithm in Circular Singly Linked List.mp411.2MB

15. Circular Singly Linked List/4. Insertion method in Circular Singly Linked List.mp451.85MB

15. Circular Singly Linked List/5. Traversal of Circular Singly Linked List.mp429.21MB

15. Circular Singly Linked List/6. Searching a node in Circular Singly Linked List.mp438.91MB

15. Circular Singly Linked List/7. Deletion of a node from Circular Singly Linked List.mp425.97MB

15. Circular Singly Linked List/8. Deletion Algorithm in Circular Singly Linked List.mp413.23MB

15. Circular Singly Linked List/9. Delete Method in Circular Singlu Linked List.mp471.94MB

16. Doubly Linked List/1. Creation of Doubly Linked List.mp439.57MB

16. Doubly Linked List/10. Deletion Method in Doubly Linked List.mp454.02MB

16. Doubly Linked List/11. Deletion of entire Doubly Linked List.mp433.45MB

16. Doubly Linked List/12. Time and Space Complexity of Doubly Linked List.mp416.96MB

16. Doubly Linked List/2. Insertion in Doubly Linked List.mp421.3MB

16. Doubly Linked List/3. Insertion Algorithm in Doubly Linked List.mp416.58MB

16. Doubly Linked List/4. Insertion Method in Doubly Linked List.mp456.32MB

16. Doubly Linked List/5. Traversal of Doubly Linked List.mp424.13MB

16. Doubly Linked List/6. Reverse Traversal of Doubly Linked List.mp422.33MB

16. Doubly Linked List/7. Searching for a node in Doubly Linked List.mp428MB

16. Doubly Linked List/8. Deletion of a node in Doubly Linked List.mp427.16MB

16. Doubly Linked List/9. Deletion Algorithm in Doubly Linked List.mp411.01MB

17. Circular Doubly Linked List/1. Creation of Circular Doubly Linked List.mp440.08MB

17. Circular Doubly Linked List/10. Deletion Method in Circular Doubly Linked List.mp467.31MB

17. Circular Doubly Linked List/11. Delete Entire Circular Doubly Linked List.mp445.28MB

17. Circular Doubly Linked List/12. Time and Space Complexity of Circular Doubly Linked List.mp413.75MB

17. Circular Doubly Linked List/2. Insertion in Circular Doubly Linked List.mp433.53MB

17. Circular Doubly Linked List/3. Insertion Algorithm in Circular Doubly Linked List.mp416.49MB

17. Circular Doubly Linked List/4. Insertion Method in Circular Doubly Linked List.mp462MB

17. Circular Doubly Linked List/5. Traversal of Circular Doubly Linked List.mp434.45MB

17. Circular Doubly Linked List/6. Reverse Traversal of Circular Doubly Linked List.mp431.37MB

17. Circular Doubly Linked List/7. Search for a node in Circular Doubly Linked List.mp438.42MB

17. Circular Doubly Linked List/8. Delete a node from Circular Doubly Linked List.mp436.3MB

17. Circular Doubly Linked List/9. Deletion Algorithm in Circular Doubly Linked List.mp416.81MB

18. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/1. Linked List Class.mp459.2MB

18. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/2. Question 1 - Remove Dups.mp462.54MB

18. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/3. Question 2 - Return Kth to Last.mp431.04MB

18. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/4. Question 3 - Partition.mp439.41MB

18. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/5. Question 4 - Sum Linked Lists.mp435.4MB

18. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/6. Question 5 - Intersection.mp457.1MB

18. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/7.3 Q4_SumLists.py677B

19. Stack/1. What is a Stack.mp417.02MB

19. Stack/2. Stack Operations.mp414.88MB

19. Stack/3. Create Stack using List without size limit.mp411.71MB

19. Stack/4. Operations on Stack using List (push, pop, peek, isEmpty, Delete).mp449.25MB

19. Stack/5. Create Stack with limit (pop, push, peek, isFull, isEmpty, delete).mp444.21MB

19. Stack/6. Create Stack using Linked List.mp414.58MB

19. Stack/7. Operation on Stack using Linked List (pop, push, peek, isEmpty, delete).mp452.07MB

19. Stack/8. Time and Space Complexity of Stack using Linked List.mp410.75MB

19. Stack/9. When to useavoid Stack.mp44.61MB

2. Recursion/1. What is Recursion.mp445.2MB

2. Recursion/2. Why do we need recursion.mp411.29MB

2. Recursion/3. How Recursion works.mp434.68MB

2. Recursion/4. Recursive vs Iterative Solutions.mp414.26MB

2. Recursion/5. When to useavoid Recursion.mp424.34MB

2. Recursion/6. How to write Recursion in 3 steps.mp465.96MB

2. Recursion/7. How to find Fibonacci numbers using Recursion.mp456.39MB

20. Queue/1. What is Queue.mp419.02MB

20. Queue/10. List vs Linked List Implementation.mp416.05MB

20. Queue/11. Collections Module.mp421.4MB

20. Queue/12. Queue Module.mp422.4MB

20. Queue/13. Multiprocessing module.mp49.16MB

20. Queue/2. Queue using Python List - no size limit.mp420.17MB

20. Queue/3. Queue using Python List - no size limit , operations (enqueue, dequeue, peek).mp471.55MB

20. Queue/4. Circular Queue - Python List.mp417.52MB

20. Queue/5. Circular Queue - Python List, Operations (enqueue, dequeue, peek, delete).mp493.66MB

20. Queue/6. Queue - Linked List.mp425.13MB

20. Queue/7. Queue - Linked List, Operations (Create, Enqueue).mp439.99MB

20. Queue/8. Queue - Linked List, Operations (Dequeue(), isEmpty, Peek).mp442.75MB

20. Queue/9. Time and Space complexity of Queue using Linked List.mp48.66MB

21. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/1. Question 1 - Three in One.mp462.25MB

21. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/2. Question 2 - Stack Minimum.mp445.66MB

21. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/3. Question 3 - Stack of Plates.mp445.32MB

21. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/4. Question 4 - Queue via Stacks.mp429.52MB

21. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/5. Question 5 - Animal Shelter.mp441.49MB

22. Tree Binary Tree/1. What is a Tree.mp427.24MB

22. Tree Binary Tree/10. InOrder Traversal Binary Tree (Linked List).mp436.14MB

22. Tree Binary Tree/11. PostOrder Traversal Binary Tree (Linked List).mp435.18MB

22. Tree Binary Tree/12. LevelOrder Traversal Binary Tree (Linked List).mp456.78MB

22. Tree Binary Tree/13. Searching for a node in Binary Tree (Linked List).mp437.62MB

22. Tree Binary Tree/14. Inserting a node in Binary Tree (Linked List).mp446.36MB

22. Tree Binary Tree/15. Delete a node from Binary Tree (Linked List).mp494.15MB

22. Tree Binary Tree/16. Delete entire Binary Tree (Linked List).mp418.29MB

22. Tree Binary Tree/17. Create Binary Tree (Python List).mp420.42MB

22. Tree Binary Tree/18. Insert a value Binary Tree (Python List).mp426.05MB

22. Tree Binary Tree/19. Search for a node in Binary Tree (Python List).mp422.46MB

22. Tree Binary Tree/2. Why Tree.mp47.61MB

22. Tree Binary Tree/20. PreOrder Traversal Binary Tree (Python List).mp427.61MB

22. Tree Binary Tree/21. InOrder Traversal Binary Tree (Python List).mp422.07MB

22. Tree Binary Tree/22. PostOrder Traversal Binary Tree (Python List).mp418.95MB

22. Tree Binary Tree/23. Level Order Traversal Binary Tree (Python List).mp417.95MB

22. Tree Binary Tree/24. Delete a node from Binary Tree (Python List).mp431.23MB

22. Tree Binary Tree/25. Delete Entire Binary Tree (Python List).mp412.65MB

22. Tree Binary Tree/26. Linked List vs Python List Binary Tree.mp419.8MB

22. Tree Binary Tree/3. Tree Terminology.mp418.8MB

22. Tree Binary Tree/4. How to create basic tree in Python.mp431.02MB

22. Tree Binary Tree/5. Binary Tree.mp46.35MB

22. Tree Binary Tree/6. Types of Binary Tree.mp49.17MB

22. Tree Binary Tree/7. Binary Tree Representation.mp414.98MB

22. Tree Binary Tree/8. Create Binary Tree (Linked List).mp414.68MB

22. Tree Binary Tree/9. PreOrder Traversal Binary Tree (Linked List).mp447.11MB

23. Binary Search Tree/1. What is a Binary Search Tree Why do we need it.mp410.87MB

23. Binary Search Tree/2. Create a Binary Search Tree.mp412.55MB

23. Binary Search Tree/3. Insert a node to BST.mp441.43MB

23. Binary Search Tree/4. Traverse BST.mp475.29MB

23. Binary Search Tree/5. Search in BST.mp432.22MB

23. Binary Search Tree/6. Delete a node from BST.mp464.57MB

23. Binary Search Tree/7. Delete entire BST.mp416.71MB

23. Binary Search Tree/8. Time and Space complexity of BST.mp412.23MB

24. AVL Tree/1. What is an AVL Tree.mp420.87MB

24. AVL Tree/10. Delete a node from AVL (LL, LR, RR, RL).mp422.55MB

24. AVL Tree/11. Delete a node from AVL (all together).mp418.23MB

24. AVL Tree/12. Delete a node from AVL (method).mp468.19MB

24. AVL Tree/13. Delete entire AVL.mp418.88MB

24. AVL Tree/14. Time and Space complexity of AVL Tree.mp414.54MB

24. AVL Tree/2. Why AVL Tree.mp413.11MB

24. AVL Tree/3. Common Operations on AVL Trees.mp464.38MB

24. AVL Tree/4. Insert a node in AVL (Left Left Condition).mp442.07MB

24. AVL Tree/5. Insert a node in AVL (Left Right Condition).mp436.44MB

24. AVL Tree/6. Insert a node in AVL (Right Right Condition).mp424.99MB

24. AVL Tree/7. Insert a node in AVL (Right Left Condition).mp427.53MB

24. AVL Tree/8. Insert a node in AVL (all together).mp457.55MB

24. AVL Tree/9. Insert a node in AVL (method).mp496.45MB

25. Binary Heap/1. What is Binary Heap Why do we need it.mp432.3MB

25. Binary Heap/2. Common operations (Creation, Peek, sizeofheap) on Binary Heap.mp454.03MB

25. Binary Heap/3. Insert a node in Binary Heap.mp475.01MB

25. Binary Heap/4. Extract a node from Binary Heap.mp490.84MB

25. Binary Heap/5. Delete entire Binary Heap.mp411.16MB

25. Binary Heap/6. Time and space complexity of Binary Heap.mp414.3MB

26. Trie/1. What is a Trie Why we need it.mp429.12MB

26. Trie/2. Common Operations on Trie (Creation).mp412.81MB

26. Trie/3. Insert a string in Trie.mp430.9MB

26. Trie/4. Search for a string in Trie.mp424.48MB

26. Trie/5. Delete a string from Trie.mp457.57MB

26. Trie/6. Practical use of Trie.mp46.73MB

27. Hashing/1. What is Hashing Why we need it.mp416.78MB

27. Hashing/2. Hashing Terminology.mp414.88MB

27. Hashing/3. Hash Functions.mp424.28MB

27. Hashing/4. Types of Collision Resolution Techniques.mp437.48MB

27. Hashing/5. Hash Table is Full.mp410.05MB

27. Hashing/6. Pros and Cons of Resolution Techniques.mp415.22MB

27. Hashing/7. Practical Use of Hashing.mp416.46MB

27. Hashing/8. Hashing vs Other DS.mp48.36MB

28. Sort Algorithms/1. What is Sorting.mp410.89MB

28. Sort Algorithms/10. Heap Sort.mp460.64MB

28. Sort Algorithms/11. Comparison of Sorting Algorithms.mp44.8MB

28. Sort Algorithms/2. Types of Sorting.mp422.91MB

28. Sort Algorithms/3. Sorting Terminologies.mp416.96MB

28. Sort Algorithms/4. Bubble Sort.mp442.17MB

28. Sort Algorithms/5. Selection Sort.mp450.81MB

28. Sort Algorithms/6. Insertion Sort.mp445.43MB

28. Sort Algorithms/7. Bucket Sort.mp455.71MB

28. Sort Algorithms/8. Merge Sort.mp456.13MB

28. Sort Algorithms/9. Quick Sort.mp484.97MB

29. Searching Algorithms/1. Introduction to Searching Algorithms.mp46.03MB

29. Searching Algorithms/2. Linear Search.mp47.74MB

29. Searching Algorithms/3. Linear Search in Python.mp425.42MB

29. Searching Algorithms/4. Binary Search.mp47.65MB

29. Searching Algorithms/5. Binary Search in Python.mp455.62MB

29. Searching Algorithms/6. Time Complexity of Binary Search.mp422.05MB

3. Cracking Recursion Interview Questions/1. Question 1 - Sum of Digits.mp444.43MB

3. Cracking Recursion Interview Questions/2. Question 2 - Power.mp440.37MB

3. Cracking Recursion Interview Questions/3. Question 3 - Greatest Common Divisor.mp442.71MB

3. Cracking Recursion Interview Questions/4. Question 4 - Decimal To Binary.mp441.9MB

30. Graph Algorithms/1. What is a Graph Why Graph.mp430.81MB

30. Graph Algorithms/2. Graph Terminology.mp424.26MB

30. Graph Algorithms/3. Types of Graph.mp418.64MB

30. Graph Algorithms/4. Graph Representation.mp431.47MB

30. Graph Algorithms/5. Create a graph using Python.mp424.52MB

31. Graph Traversal - Breadth First Search and Depth First Search/1. Graph traversal - BFS.mp429.9MB

31. Graph Traversal - Breadth First Search and Depth First Search/2. BFS Traversal in Python.mp429.7MB

31. Graph Traversal - Breadth First Search and Depth First Search/3. Graph Traversal - DFS.mp427.59MB

31. Graph Traversal - Breadth First Search and Depth First Search/4. DFS Traversal in Python.mp429.17MB

31. Graph Traversal - Breadth First Search and Depth First Search/5. BFS Traversal vs DFS Traversal.mp412.69MB

32. Topological Sort Algorithm/1. Topological Sort.mp410.88MB

32. Topological Sort Algorithm/2. Topological Sort Algorithm.mp423.86MB

32. Topological Sort Algorithm/3. Topological Sort in Python.mp440.53MB

33. Single Source Shortest Path/1. Single Source Shortest Path Problem (SSSPP).mp426.08MB

33. Single Source Shortest Path/2. BFS for SSSPP.mp425.35MB

33. Single Source Shortest Path/3. BFS for SSSPP in Python.mp433.82MB

33. Single Source Shortest Path/4. Why does BFS not work with weighted Graph.mp47.97MB

33. Single Source Shortest Path/5. Why does DFS not work for SSSP.mp46.19MB

34. Graph Algorithms - Dijsktra's Algorithm/1. Dijkstra's Algorithm for SSSP.mp418.9MB

34. Graph Algorithms - Dijsktra's Algorithm/2. Dijkstra's Algorithm in Python.mp447.95MB

34. Graph Algorithms - Dijsktra's Algorithm/3. Dijkstra Algorithm with negative cycle.mp412.2MB

35. Graph Algorithms -Bellman Ford Algorithm/1. Bellman Ford Algorithm.mp447.21MB

35. Graph Algorithms -Bellman Ford Algorithm/2. Bellman Ford Algorithm with negative cycle.mp428.69MB

35. Graph Algorithms -Bellman Ford Algorithm/3. Why Bellman Ford runs V-1 times.mp414.96MB

35. Graph Algorithms -Bellman Ford Algorithm/4. Bellman Ford in Python.mp436.72MB

35. Graph Algorithms -Bellman Ford Algorithm/5. BFS vs Dijkstra vs Bellman Ford.mp419.67MB

36. All Pairs Shortest Path/1. All pairs shortest path problem.mp432.57MB

36. All Pairs Shortest Path/2. Dry run for All pair shortest path.mp414.04MB

37. Graph Algorithms - Floyd Warshall Algorithm/1. Floyd Warshall Algorithm.mp426.87MB

37. Graph Algorithms - Floyd Warshall Algorithm/2. Why Floyd Warshall.mp427.31MB

37. Graph Algorithms - Floyd Warshall Algorithm/3. Floyd Warshall with negative cycle.mp46.48MB

37. Graph Algorithms - Floyd Warshall Algorithm/4. Floyd Warshall in Python.mp426.42MB

37. Graph Algorithms - Floyd Warshall Algorithm/5. BFS vs Dijkstra vs Bellman Ford vs Floyd Warshall.mp416.23MB

38. Minimum Spanning Tree (Disjoint Set)/1. Minimum Spanning Tree.mp439.58MB

38. Minimum Spanning Tree (Disjoint Set)/2. Disjoint Set.mp49.75MB

38. Minimum Spanning Tree (Disjoint Set)/3. Disjoint Set in Python.mp437.07MB

39. Graph Algorithms - Kruskal and Prim's Algorithms/1. Kruskal Algorithm.mp423.19MB

39. Graph Algorithms - Kruskal and Prim's Algorithms/2. Kruskal Algorithm in Python.mp437.36MB

39. Graph Algorithms - Kruskal and Prim's Algorithms/3. Prim's Algorithm.mp432.74MB

39. Graph Algorithms - Kruskal and Prim's Algorithms/4. Prim's Algorithm in Python.mp427.38MB

39. Graph Algorithms - Kruskal and Prim's Algorithms/5. Prim's vs Kruskal.mp412.05MB

40. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/1. Introduction.mp42.33MB

40. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/11. Solution to Validate BST - LeetCode 98.mp443.57MB

40. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/13. Solution to Successor.mp445.85MB

40. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/15. Solution to Build Order.mp4134.32MB

40. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/17. Solution to First Common Ancestor.mp462.8MB

40. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/3. Solution to Route Between Nodes.mp440.8MB

40. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/5. Solution to Minimal Tree.mp455.04MB

40. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/7. Solution to List of Depths.mp478.08MB

40. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/9. Solution to Check Balanced.mp446.09MB

41. Greedy Algorithms/1. What is Greedy Algorithm.mp432.01MB

41. Greedy Algorithms/2. Greedy Algorithms (Insertion Sort, Selection Sort, Prim, Kruskal, Topological ).mp426.56MB

41. Greedy Algorithms/3. Activity Selection Problem.mp421.28MB

41. Greedy Algorithms/4. Activity Selection Problem in Python.mp421.38MB

41. Greedy Algorithms/5. Coin Change Problem.mp413.83MB

41. Greedy Algorithms/6. Coin Change Problem in Python.mp418.38MB

41. Greedy Algorithms/7. Fractional Knapsack Problem.mp424.37MB

41. Greedy Algorithms/8. Fractional Knapsack Problem in Python.mp435.81MB

42. Divide and Conquer Algorithms/1. What is a Divide and Conquer Algorithm.mp425.18MB

42. Divide and Conquer Algorithms/10. Zero One Knapsack problem.mp422.34MB

42. Divide and Conquer Algorithms/11. Zero One Knapsack problem in Python.mp433.85MB

42. Divide and Conquer Algorithms/12. Longest Common Sequence Problem.mp427.1MB

42. Divide and Conquer Algorithms/13. Longest Common Subsequence in Python.mp416.76MB

42. Divide and Conquer Algorithms/14. Longest Palindromic Subsequence Problem.mp425.76MB

42. Divide and Conquer Algorithms/15. Longest Palindromic Subsequence in Python.mp416.63MB

42. Divide and Conquer Algorithms/16. Minimum cost to reach the Last cell problem.mp420.19MB

42. Divide and Conquer Algorithms/17. Minimum Cost to reach the Last Cell in 2D array using Python.mp412.93MB

42. Divide and Conquer Algorithms/18. Number of Ways to reach the Last Cell with given Cost.mp425.74MB

42. Divide and Conquer Algorithms/19. Number of Ways to reach the Last Cell with given Cost in Python.mp420.76MB

42. Divide and Conquer Algorithms/2. Common Divide and Conquer algorithms.mp417.15MB

42. Divide and Conquer Algorithms/3. How to solve Fibonacci series using Divide and Conquer approach.mp416.69MB

42. Divide and Conquer Algorithms/4. Number Factor.mp420.19MB

42. Divide and Conquer Algorithms/5. Number Factor in Python.mp411.3MB

42. Divide and Conquer Algorithms/6. House Robber.mp426.9MB

42. Divide and Conquer Algorithms/7. House Robber Problem in Python.mp418.62MB

42. Divide and Conquer Algorithms/8. Convert one string to another.mp422.21MB

42. Divide and Conquer Algorithms/9. Convert One String to another in Python.mp431.01MB

43. Dynamic Programming/1. What is Dynamic Programming (Overlapping property).mp422.25MB

43. Dynamic Programming/10. House Robber Top Down and Bottom Up.mp439.55MB

43. Dynamic Programming/11. Convert one string to another using Dynamic Programming.mp423.06MB

43. Dynamic Programming/13. Zero One Knapsack using Dynamic Programming.mp446.86MB

43. Dynamic Programming/2. Where does the name of DP come from.mp422.5MB

43. Dynamic Programming/3. Top Down with Memoization.mp451.47MB

43. Dynamic Programming/4. Bottom Up with Tabulation.mp426.78MB

43. Dynamic Programming/5. Top Down vs Bottom Up.mp413.41MB

43. Dynamic Programming/6. Is Merge Sort Dynamic Programming.mp416.63MB

43. Dynamic Programming/7. Number Factor Problem using Dynamic Programming.mp445.85MB

43. Dynamic Programming/8. Number Factor Top Down and Bottom Up.mp434.72MB

43. Dynamic Programming/9. House Robber Problem using Dynamic Programming.mp446.31MB

45. A Recipe for Problem Solving/1. Introduction.mp410.06MB

45. A Recipe for Problem Solving/2. Step 1 - Understand the problem.mp425MB

45. A Recipe for Problem Solving/3. Step 2 - Examples.mp420.54MB

45. A Recipe for Problem Solving/4. Step 3 - Break it Down.mp426.85MB

45. A Recipe for Problem Solving/5. Step 4 - Solve or Simplify.mp442.77MB

45. A Recipe for Problem Solving/6. Step 5 - Look Back and Refactor.mp426.38MB

5. Big O Notation/1. Analogy and Time Complexity.mp416.06MB

5. Big O Notation/2. Big O, Big Theta and Big Omega.mp434.9MB

5. Big O Notation/3. Time complexity examples.mp472.25MB

5. Big O Notation/4. Space Complexity.mp410.2MB

5. Big O Notation/5. Drop the Constants and the non dominant terms.mp414.27MB

5. Big O Notation/6. Add vs Multiply.mp44.31MB

5. Big O Notation/7. How to measure the codes using Big O.mp427.38MB

5. Big O Notation/8. How to find time complexity for Recursive calls.mp437.82MB

5. Big O Notation/9. How to measure Recursive Algorithms that make multiple calls.mp416.4MB

6. Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)/1. Question 1 - Product and Sum.mp411.05MB

6. Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)/10. Question 10 - Powers of 2.mp49.86MB

6. Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)/2. Question 2 - Print Pairs.mp45.69MB

6. Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)/3. Question 3 - Print Unordered Pairs.mp411.84MB

6. Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)/4. Question 4 - Print Unordered Pairs 2 Arrays.mp46.26MB

6. Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)/5. Question 5 - Print Unordered Pairs 2 Arrays 100000 Units.mp45.57MB

6. Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)/6. Question 6 - Reverse.mp49.16MB

6. Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)/7. Question 7 - O(N) Equivalents.mp411.13MB

6. Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)/8. Question 8 - Factorial Complexity.mp413.8MB

6. Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)/9. Question 9 - Fibonacci Complexity.mp410.25MB

7. Arrays/1. What is an Array.mp433.32MB

7. Arrays/10. Time and Space complexity of One Dimensional Array.mp417.98MB

7. Arrays/11. One Dimensional Array Practice.mp4153.44MB

7. Arrays/12. Create Two Dimensional Array.mp427.49MB

7. Arrays/13. Insertion - Two Dimensional Array.mp436.05MB

7. Arrays/14. Accessing an element of Two Dimensional Array.mp441.77MB

7. Arrays/15. Traversal - Two Dimensional Array.mp431.61MB

7. Arrays/16. Searching for an element in Two Dimensional Array.mp440.65MB

7. Arrays/17. Deletion - Two Dimensional Array.mp424.89MB

7. Arrays/18. Time and Space complexity of Two Dimensional Array.mp414.73MB

7. Arrays/19. When to useavoid array.mp46.85MB

7. Arrays/2. Types of Array.mp441.24MB

7. Arrays/3. Arrays in Memory.mp419.29MB

7. Arrays/4. Create an Array.mp421.66MB

7. Arrays/5. Insertion Operation.mp430.32MB

7. Arrays/6. Traversal Operation.mp413.5MB

7. Arrays/7. Accessing an element of Array.mp428.44MB

7. Arrays/8. Searching for an element in Array.mp424.75MB

7. Arrays/9. Deleting an element from Array.mp412.48MB

8. Python Lists/1. What is a List How to create it.mp419.87MB

8. Python Lists/10. Time and Space Complexity of List.mp413.11MB

8. Python Lists/12.1 lists.py1.24KB

8. Python Lists/2. AccessingTraversing a list.mp450.07MB

8. Python Lists/3. UpdateInsert a List.mp451.24MB

8. Python Lists/4. SliceDelete from a List.mp446.76MB

8. Python Lists/5. Searching for an element in a List.mp432.09MB

8. Python Lists/6. List OperationsFunctions.mp453.05MB

8. Python Lists/7. Lists and strings.mp420.52MB

8. Python Lists/8. Common List pitfalls and ways to avoid them.mp423.34MB

8. Python Lists/9. Lists vs Arrays.mp419.74MB

9. PROJECT 1 - ArraysLists/1. Goals - what you will make by the end of this section.mp47.58MB

9. PROJECT 1 - ArraysLists/2. Calculate Average Temperature.mp421.99MB

9. PROJECT 1 - ArraysLists/3. Find the Days Above Average Temperature.mp424.7MB