种子简介

种子名称： [FreeCourseSite.com] Udemy - Data Structures & Algorithms Essentials (2022)
文件类型： 视频
文件数目： 229个文件
文件大小： 15.75 GB
收录时间： 2022-7-11 16:18
已经下载： 3次
资源热度： 187
最近下载： 2024-12-19 19:31

下载BT种子文件

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

磁力链接下载

magnet:?xt=urn:btih:604c26bbda3065e4780a9835b6fb5d51d8c21544&dn=[FreeCourseSite.com] Udemy - Data Structures & Algorithms Essentials (2022) 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[FreeCourseSite.com] Udemy - Data Structures & Algorithms Essentials (2022).torrent

1. Introduction/1. Course Orientation!.mp4115.27MB

1. Introduction/2. Get maximum out of this course.mp469.53MB

10. Divide & Conquer/1. Merge Sort.mp449.59MB

10. Divide & Conquer/2. Merge Sort Code.mp491.31MB

10. Divide & Conquer/3. Quick Sort.mp4109.51MB

10. Divide & Conquer/4. Quick Sort Code.mp432.99MB

10. Divide & Conquer/6. Rotate Array Search.mp488.37MB

10. Divide & Conquer/7. Rotated Search Code.mp435.48MB

11. Backtracking/1. Backtracking Introduction.mp442.38MB

11. Backtracking/10. N-Queen All Ways.mp4158.36MB

11. Backtracking/11. Grid Ways.mp4115.04MB

11. Backtracking/12. Grid Ways - Math Trick!.mp438.21MB

11. Backtracking/13. Sudoku.mp4104.32MB

11. Backtracking/14. Sudoku Code.mp4130.47MB

11. Backtracking/2. Backtracking on Arrays Code.mp485.57MB

11. Backtracking/3. Bactracking on Vectors Code.mp444.51MB

11. Backtracking/4. Finding Subsets.mp4129.52MB

11. Backtracking/5. Finding Subsets Code.mp481.25MB

11. Backtracking/6. Ordering Subsets.mp468.45MB

11. Backtracking/7. Permutations.mp498.46MB

11. Backtracking/8. N-Queen Problem.mp4122.42MB

11. Backtracking/9. N-Queen Code.mp4123.76MB

12. Space & Time Complexity Analysis/1. Space Time Complexity Introduction.mp497.69MB

12. Space & Time Complexity Analysis/2. Experimental Analysis.mp4125.64MB

12. Space & Time Complexity Analysis/3. Big O Notation.mp451.55MB

12. Space & Time Complexity Analysis/4. Nested Loops.mp427.03MB

12. Space & Time Complexity Analysis/5. Loops Example.mp430.14MB

12. Space & Time Complexity Analysis/6. Analysis of Bubble Sort.mp440.89MB

12. Space & Time Complexity Analysis/7. Analysis of Binary Search.mp485.6MB

12. Space & Time Complexity Analysis/8. Merge Sort Analysis.mp466.89MB

12. Space & Time Complexity Analysis/9. Time Complexity For Recursive Problems.mp496.32MB

13. Object Oriented Programming/1. Introduction to OOPS.mp482.32MB

13. Object Oriented Programming/2. OOPS - Classes & Objects.mp470.95MB

13. Object Oriented Programming/3. Code Demo.mp460.6MB

13. Object Oriented Programming/4. Getters & Setters.mp462.72MB

13. Object Oriented Programming/5. Constructor Object Initialiastion.mp476.45MB

13. Object Oriented Programming/6. Copy Constructor.mp4110.96MB

13. Object Oriented Programming/7. Shallow & Deep Copy.mp4133.11MB

13. Object Oriented Programming/8. Copy Assignment Operator.mp468.4MB

13. Object Oriented Programming/9. Destructor.mp451.77MB

14. Linked List/1. Linked List Introduction.mp479.38MB

14. Linked List/11. Reverse a Linked List.mp447.77MB

14. Linked List/12. Reverse a Linked List Code.mp431.26MB

14. Linked List/2. Push Front.mp473.35MB

14. Linked List/3. Push Back.mp422.09MB

14. Linked List/4. Print.mp468.75MB

14. Linked List/5. Insert.mp443.05MB

14. Linked List/6. Search.mp430.03MB

14. Linked List/7. Recursive Search.mp437.03MB

14. Linked List/8. Deletion.mp456.02MB

14. Linked List/9. Pop Front.mp460.1MB

15. Stacks/1. Stack Data Structure.mp452.95MB

15. Stacks/10. Stock Span Solution.mp465.79MB

15. Stacks/2. Stack Implementations.mp446.46MB

15. Stacks/3. Stack using Linked List.mp463.85MB

15. Stacks/4. Stack using Vector.mp433.05MB

15. Stacks/5. Stack STL.mp434.08MB

15. Stacks/6. Stack Insert At Bottom Challenge!.mp479.29MB

15. Stacks/7. Recursively Reverse a Stack.mp458.82MB

16. Queues/1. Queue Introduction.mp453.85MB

16. Queues/2. Queue Implementation.mp460.26MB

16. Queues/3. Queue using Circular Array.mp495.45MB

16. Queues/4. Queue STL.mp415.71MB

16. Queues/5. Stack using 2 Queues.mp446.07MB

16. Queues/6. Stack using 2 Queues Code.mp456.72MB

17. Binary Tree/1. Binary Tree Introduction.mp471.22MB

17. Binary Tree/10. Height of Tree.mp440.02MB

17. Binary Tree/13. Tree Diameter.mp4111.92MB

17. Binary Tree/14. Diameter Code-I.mp433.09MB

17. Binary Tree/15. Diameter Code-II.mp4106.58MB

17. Binary Tree/2. Build Tree Preorder.mp487.83MB

17. Binary Tree/3. Preorder Traversal.mp480.19MB

17. Binary Tree/4. Inorder Traversal.mp438.01MB

17. Binary Tree/5. Postorder Traversal.mp453.54MB

17. Binary Tree/6. Level Order Print.mp4105.27MB

17. Binary Tree/7. Level Order Print Code.mp441.49MB

17. Binary Tree/8. Level Order Build.mp466.21MB

17. Binary Tree/9. Level Order Build Code.mp426.08MB

18. Binary Search Tree/1. BST Introduction.mp479.74MB

18. Binary Search Tree/2. BST Creation.mp445.22MB

18. Binary Search Tree/4. Searching.mp451.3MB

18. Binary Search Tree/5. Deletion Concept.mp466.2MB

18. Binary Search Tree/6. Deletion Code.mp470.21MB

18. Binary Search Tree/7. Challenge - Print in Range.mp454.84MB

18. Binary Search Tree/8. Root To Leaf Paths.mp471.93MB

19. Heaps Priority Queue/1. Introduction to Heap.mp484.3MB

19. Heaps Priority Queue/10. Priority Queue STL.mp462.55MB

19. Heaps Priority Queue/11. Nearby Cars.mp457.32MB

19. Heaps Priority Queue/12. Nearby Cars Code.mp473.91MB

19. Heaps Priority Queue/2. Heap vs other Data Structure.mp467.98MB

19. Heaps Priority Queue/3. Heaps as CBT.mp457.94MB

19. Heaps Priority Queue/4. Heaps as Array.mp489.61MB

19. Heaps Priority Queue/5. Insertion.mp476.07MB

19. Heaps Priority Queue/6. Insertion Code.mp492.36MB

19. Heaps Priority Queue/7. Remove Min Max.mp485.84MB

19. Heaps Priority Queue/8. Remove Min Max Code.mp493.04MB

2. Arrays/1. Array Introduction.mp4109.2MB

2. Arrays/10. Printing Subarrays.mp476.35MB

2. Arrays/11. Subarray Sum - I (Brute Force).mp463.81MB

2. Arrays/12. Subarray Sum - II (Prefix Sums).mp4109.26MB

2. Arrays/13. Subarray Sum - III (Kadane's Algorithm).mp490.18MB

2. Arrays/15. Vectors Introduction.mp449.73MB

2. Arrays/16. Vectors (Demo).mp468.86MB

2. Arrays/2. Arrays - Input, Ouput, Update.mp473.26MB

2. Arrays/3. Arrays & Functions - Pass by Reference.mp4103.34MB

2. Arrays/5. Linear Search.mp479.31MB

2. Arrays/6. Binary Search.mp4116.78MB

2. Arrays/7. Binary Search Code.mp495.36MB

2. Arrays/8. Array Reverse.mp466.37MB

2. Arrays/9. Printing Pairs.mp477.33MB

20. Hashing/1. Introduction to Hashing.mp4105.91MB

20. Hashing/10. Hashing Code - VI (Operator [] Overloading).mp4132.61MB

20. Hashing/2. Hash Functions.mp4103.4MB

20. Hashing/3. Collision Handling.mp4166.75MB

20. Hashing/4. Hashing Code - I (Setup).mp458.81MB

20. Hashing/5. Hashing Code - II (Insertion).mp478MB

20. Hashing/6. Hashing Code - III (Rehashing).mp4110.57MB

20. Hashing/7. Testing our Hashtable.mp448.55MB

20. Hashing/8. Hashing Code - IV (Search).mp446.74MB

20. Hashing/9. Hashing Code - V (Erase).mp424.61MB

21. Trie Data Structure/1. Trie Data Structure.mp4161.22MB

21. Trie Data Structure/2. Trie Class.mp441.45MB

21. Trie Data Structure/3. Trie Insertion.mp436.51MB

21. Trie Data Structure/4. Trie Searching.mp422.62MB

21. Trie Data Structure/5. Trie Queries.mp446.34MB

22. Graphs Introduction/1. Graphs Introduction.mp4140.65MB

22. Graphs Introduction/10. Kahn's Algorithm (Modified BFS).mp448.13MB

22. Graphs Introduction/11. Topological Ordering using BFS Code.mp432.04MB

22. Graphs Introduction/12. Dijkshtra's Algorithm.mp496.14MB

22. Graphs Introduction/13. Dijkshtra's Algorithm Code.mp4117.13MB

22. Graphs Introduction/2. Graph Applications.mp4117.7MB

22. Graphs Introduction/3. Adjacency List Representation.mp448.85MB

22. Graphs Introduction/4. Adjacency List Representation with Node Class.mp466.36MB

22. Graphs Introduction/5. BFS.mp461.24MB

22. Graphs Introduction/6. BFS Code.mp467.94MB

22. Graphs Introduction/7. DFS.mp436.06MB

22. Graphs Introduction/8. DFS Code.mp439.59MB

22. Graphs Introduction/9. Topological Ordering.mp449.15MB

23. Dynamic Programming Introduction/1. Dynamic Programming Basics.mp4195.45MB

23. Dynamic Programming Introduction/10. Wines - III.mp438.95MB

23. Dynamic Programming Introduction/11. Wines - IV.mp444.26MB

23. Dynamic Programming Introduction/2. Coin Change.mp4128.43MB

23. Dynamic Programming Introduction/3. Coin Change Code.mp432.12MB

23. Dynamic Programming Introduction/4. Longest Common Subsequence (LCS).mp423.67MB

23. Dynamic Programming Introduction/5. Longest Common Subsequence Code.mp412.27MB

23. Dynamic Programming Introduction/6. Knapsack Problem.mp452.79MB

23. Dynamic Programming Introduction/7. Knapsack Problem Code.mp452.24MB

23. Dynamic Programming Introduction/8. Wines Problem.mp426.35MB

23. Dynamic Programming Introduction/9. Wines Problem - II.mp433.01MB

24. Project - Shopping Cart Backend/1. Shopping Cart Introduction.mp466.98MB

24. Project - Shopping Cart Backend/2. Shopping Cart Demo.mp459.47MB

24. Project - Shopping Cart Backend/3. Product Class.mp430.78MB

24. Project - Shopping Cart Backend/4. Item Class.mp452.36MB

24. Project - Shopping Cart Backend/5. Choosing Products.mp466.24MB

24. Project - Shopping Cart Backend/6. Cart Implementation.mp4129.06MB

24. Project - Shopping Cart Backend/7. Checkout.mp452.91MB

3. Basic Sorting Algorithms/1. Sorting Introduction.mp426.86MB

3. Basic Sorting Algorithms/10. Counting Sort.mp462.27MB

3. Basic Sorting Algorithms/11. Counting Sort Code.mp468.19MB

3. Basic Sorting Algorithms/2. Bubble Sort.mp4105.27MB

3. Basic Sorting Algorithms/3. Bubble Sort Code.mp445.07MB

3. Basic Sorting Algorithms/5. Insertion Sort.mp450.95MB

3. Basic Sorting Algorithms/6. Insertion Sort Code.mp439.87MB

3. Basic Sorting Algorithms/7. Selection Sort.mp429.03MB

3. Basic Sorting Algorithms/8. Selection Sort Code.mp445.66MB

3. Basic Sorting Algorithms/9. Inbuilt Sort & Comparators.mp4123.9MB

4. Character ArraysStrings/1. Character Arrays Introduction.mp484.49MB

4. Character ArraysStrings/10. String Class.mp477.15MB

4. Character ArraysStrings/12. Run Length Encoding.mp443.85MB

4. Character ArraysStrings/2. Using cin.get().mp4154.55MB

4. Character ArraysStrings/3. Digits & Spaces.mp434.05MB

4. Character ArraysStrings/4. Using cin.getline().mp468.02MB

4. Character ArraysStrings/5. Shortest Path.mp486.12MB

4. Character ArraysStrings/6. String Copy, Compare, Concat!.mp458.75MB

4. Character ArraysStrings/7. Solution Largest String.mp497.05MB

5. 2D Arrays/1. Introduction to 2D Arrays.mp479.4MB

5. 2D Arrays/2. 2D Array Basics.mp486.29MB

5. 2D Arrays/3. 2D Character Arrays.mp448.34MB

5. 2D Arrays/4. Spiral Print.mp4148.27MB

5. 2D Arrays/6. Sorted Array Search.mp460.27MB

5. 2D Arrays/7. Sorted Array Search Code.mp434.25MB

5. 2D Arrays/8. Mango Trees.mp4156.37MB

6. Pointers & Dynamic Memory/1. Address of Operator.mp461.67MB

6. Pointers & Dynamic Memory/2. Pointers.mp475MB

6. Pointers & Dynamic Memory/3. Dereference Operator.mp447.87MB

6. Pointers & Dynamic Memory/4. Reference Variables.mp453.51MB

6. Pointers & Dynamic Memory/5. Pass by Reference - Reference Variable.mp472.29MB

6. Pointers & Dynamic Memory/6. Pass by Reference - Pointers.mp460.72MB

6. Pointers & Dynamic Memory/7. Dynamic Memory Allocation.mp4114.46MB

6. Pointers & Dynamic Memory/8. Using New & Delete.mp450.61MB

6. Pointers & Dynamic Memory/9. 2D Dynamic Array.mp477.86MB

7. Vector Data Structure/1. Vector.mp477.97MB

7. Vector Data Structure/10. Sorting a Complex Vector!.mp448.44MB

7. Vector Data Structure/2. Vectors - How they grow.mp472MB

7. Vector Data Structure/3. Using Vector Container.mp468.76MB

7. Vector Data Structure/4. 2D Vector using STL.mp435.14MB

7. Vector Data Structure/5. Vector Class - I.mp471.3MB

7. Vector Data Structure/6. Vector Class - II.mp470.64MB

7. Vector Data Structure/7. Vector Class - III.mp4101.1MB

7. Vector Data Structure/8. Header Files & Template Classes.mp470.76MB

7. Vector Data Structure/9. Inbuilt Searching.mp489.26MB

8. Bit Manipulation/1. Bitwise Operators.mp4110.63MB

8. Bit Manipulation/10. Replace Bits.mp461.74MB

8. Bit Manipulation/11. Two Power.mp436.67MB

8. Bit Manipulation/12. Count Bits.mp447.59MB

8. Bit Manipulation/13. Count Bits - Hack.mp437.08MB

8. Bit Manipulation/14. Fast Exponentiation.mp488.96MB

8. Bit Manipulation/15. Make it Binary!.mp443.76MB

8. Bit Manipulation/2. Left Shift & Right Shift.mp442.72MB

8. Bit Manipulation/3. Odd Even.mp432.96MB

8. Bit Manipulation/4. Get ith Bit.mp447.64MB

8. Bit Manipulation/5. Clear ith Bit.mp435.66MB

8. Bit Manipulation/6. Set ith Bit.mp429.68MB

8. Bit Manipulation/7. Update ith Bit.mp461.06MB

8. Bit Manipulation/8. Clear Last i Bits.mp452.07MB

8. Bit Manipulation/9. Clear Range of Bits.mp471.52MB

9. Recursion Basics/1. Recursion Introduction.mp4115.65MB

9. Recursion Basics/12. Power Function.mp444.48MB

9. Recursion Basics/13. Power Function Optimised.mp456.22MB

9. Recursion Basics/14. Bubble Sort.mp4103.07MB

9. Recursion Basics/15. Number Spell.mp465.91MB

9. Recursion Basics/2. Factorial.mp492.56MB

9. Recursion Basics/3. Fibonacci Series.mp4133.2MB

9. Recursion Basics/4. Sorted Array Check!.mp4110.98MB

9. Recursion Basics/5. Understanding Recursion Directions.mp483.73MB

9. Recursion Basics/6. First Occurence.mp444.22MB

9. Recursion Basics/7. First Occurence Code.mp462.02MB

9. Recursion Basics/8. Last Occurence.mp443.37MB

9. Recursion Basics/9. Last Occurence Code.mp433.99MB