种子简介

种子名称： GetFreeCourses.Co-Udemy-Data Structures & Algorithms Essentials using C++ (2022)
文件类型： 视频
文件数目： 231个文件
文件大小： 5.87 GB
收录时间： 2023-3-28 16:37
已经下载： 3次
资源热度： 232
最近下载： 2025-1-7 20:39

下载BT种子文件

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

磁力链接下载

magnet:?xt=urn:btih:955b51f6b520ef990a4f4efbe062cb649b066d7d&dn=GetFreeCourses.Co-Udemy-Data Structures & Algorithms Essentials using C++ (2022) 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

GetFreeCourses.Co-Udemy-Data Structures & Algorithms Essentials using C++ (2022).torrent

01 - Introduction/001 Course Orientation!.mp4115.27MB

01 - Introduction/002 Get maximum out of this course.mp421.88MB

03 - Arrays/001 Array Introduction.mp4109.2MB

03 - Arrays/002 Arrays - Input, Ouput, Update.mp415.24MB

03 - Arrays/003 Arrays & Functions - Pass by Reference.mp429.15MB

03 - Arrays/005 Linear Search.mp415.41MB

03 - Arrays/006 Binary Search.mp4116.78MB

03 - Arrays/007 Binary Search Code.mp419.49MB

03 - Arrays/008 Array Reverse.mp413.57MB

03 - Arrays/009 Printing Pairs.mp415.64MB

03 - Arrays/010 Printing Subarrays.mp422.73MB

03 - Arrays/011 Subarray Sum - I (Brute Force).mp417.75MB

03 - Arrays/012 Subarray Sum - II (Prefix Sums).mp424.2MB

03 - Arrays/013 Subarray Sum - III (Kadane's Algorithm).mp418.84MB

03 - Arrays/015 Vectors Introduction.mp429.04MB

03 - Arrays/016 Vectors (Demo).mp423.35MB

04 - Basic Sorting Algorithms/001 Sorting Introduction.mp48.28MB

04 - Basic Sorting Algorithms/002 Bubble Sort.mp422.34MB

04 - Basic Sorting Algorithms/003 Bubble Sort Code.mp49.89MB

04 - Basic Sorting Algorithms/004 Insertion Sort.mp410.93MB

04 - Basic Sorting Algorithms/005 Insertion Sort Code.mp414.54MB

04 - Basic Sorting Algorithms/006 Selection Sort.mp46.01MB

04 - Basic Sorting Algorithms/007 Selection Sort Code.mp413.86MB

04 - Basic Sorting Algorithms/008 Inbuilt Sort & Comparators.mp425.43MB

04 - Basic Sorting Algorithms/009 Counting Sort.mp413.1MB

04 - Basic Sorting Algorithms/010 Counting Sort Code.mp425.72MB

05 - Character ArraysStrings/001 Character Arrays Introduction.mp423.13MB

05 - Character ArraysStrings/002 Using cin.get().mp432.46MB

05 - Character ArraysStrings/003 Digits & Spaces.mp410.61MB

05 - Character ArraysStrings/004 Using cin.getline().mp413.44MB

05 - Character ArraysStrings/005 Shortest Path.mp418.27MB

05 - Character ArraysStrings/006 String Copy, Compare, Concat!.mp411.85MB

05 - Character ArraysStrings/007 Solution Largest String.mp420.87MB

05 - Character ArraysStrings/009 String Class.mp421.32MB

05 - Character ArraysStrings/010 Run Length Encoding.mp413.67MB

06 - 2D Arrays/001 Introduction to 2D Arrays.mp420.06MB

06 - 2D Arrays/002 2D Array Basics.mp427.77MB

06 - 2D Arrays/003 2D Character Arrays.mp411.68MB

06 - 2D Arrays/004 Spiral Print.mp463.81MB

06 - 2D Arrays/005 Sorted Array Search.mp414.05MB

06 - 2D Arrays/006 Sorted Array Search Code.mp414.5MB

06 - 2D Arrays/007 Mango Trees.mp4156.37MB

07 - Pointers & Dynamic Memory/001 Address of Operator.mp417.07MB

07 - Pointers & Dynamic Memory/002 Pointers.mp416.82MB

07 - Pointers & Dynamic Memory/003 Dereference Operator.mp429.12MB

07 - Pointers & Dynamic Memory/004 Reference Variables.mp411.5MB

07 - Pointers & Dynamic Memory/005 Pass by Reference - Reference Variable.mp472.28MB

07 - Pointers & Dynamic Memory/006 Pass by Reference - Pointers.mp413.66MB

07 - Pointers & Dynamic Memory/007 Dynamic Memory Allocation.mp426.77MB

07 - Pointers & Dynamic Memory/008 Using New & Delete.mp411.05MB

07 - Pointers & Dynamic Memory/009 2D Dynamic Array.mp428.5MB

08 - Vector Data Structure/001 Vector.mp445.28MB

08 - Vector Data Structure/002 Vectors - How they grow.mp472MB

08 - Vector Data Structure/003 Using Vector Container.mp423.35MB

08 - Vector Data Structure/004 2D Vector using STL.mp47.5MB

08 - Vector Data Structure/005 Vector Class - I.mp418.66MB

08 - Vector Data Structure/006 Vector Class - II.mp470.64MB

08 - Vector Data Structure/007 Vector Class - III.mp423.65MB

08 - Vector Data Structure/008 Header Files & Template Classes.mp422.81MB

08 - Vector Data Structure/009 Inbuilt Searching.mp455.65MB

08 - Vector Data Structure/010 Sorting a Complex Vector!.mp419.17MB

09 - Bit Manipulation/001 Bitwise Operators.mp421.91MB

09 - Bit Manipulation/002 Left Shift & Right Shift.mp49.2MB

09 - Bit Manipulation/003 Odd Even.mp47.32MB

09 - Bit Manipulation/004 Get ith Bit.mp410.23MB

09 - Bit Manipulation/005 Set ith Bit.mp410.99MB

09 - Bit Manipulation/006 Clear ith Bit.mp47.96MB

09 - Bit Manipulation/007 Update ith Bit.mp461.06MB

09 - Bit Manipulation/008 Clear Last i Bits.mp411.63MB

09 - Bit Manipulation/009 Clear Range of Bits.mp471.52MB

09 - Bit Manipulation/010 Replace Bits.mp413.81MB

09 - Bit Manipulation/011 Two Power.mp47.83MB

09 - Bit Manipulation/012 Count Bits.mp414.91MB

09 - Bit Manipulation/013 Count Bits - Hack.mp411.38MB

09 - Bit Manipulation/014 Fast Exponentiation.mp422.28MB

09 - Bit Manipulation/015 Make it Binary!.mp443.76MB

10 - Recursion Basics/001 Recursion Introduction.mp433.15MB

10 - Recursion Basics/002 Factorial.mp421.29MB

10 - Recursion Basics/003 Fibonacci Series.mp430.32MB

10 - Recursion Basics/004 Sorted Array Check!.mp432.47MB

10 - Recursion Basics/005 Understanding Recursion Directions.mp418.82MB

10 - Recursion Basics/006 First Occurence.mp410.54MB

10 - Recursion Basics/007 First Occurence Code.mp414.44MB

10 - Recursion Basics/008 Last Occurence.mp49.51MB

10 - Recursion Basics/009 Last Occurence Code.mp49.66MB

10 - Recursion Basics/010 Power Function.mp412.89MB

10 - Recursion Basics/011 Power Function Optimised.mp456.22MB

10 - Recursion Basics/012 Bubble Sort.mp442.67MB

10 - Recursion Basics/013 Number Spell.mp420.13MB

10 - Recursion Basics/014 Tiling Problem Solution.mp415.31MB

10 - Recursion Basics/015 Binary Strings Solution.mp416.6MB

10 - Recursion Basics/016 Friend's Party Solution.mp415.47MB

11 - Divide & Conquer/001 Merge Sort.mp49.92MB

11 - Divide & Conquer/002 Merge Sort Code.mp439.99MB

11 - Divide & Conquer/003 Quick Sort.mp425.55MB

11 - Divide & Conquer/004 Quick Sort Code.mp416.56MB

11 - Divide & Conquer/005 Rotate Array Search.mp421.86MB

11 - Divide & Conquer/006 Rotated Search Code.mp412.29MB

12 - Backtracking/001 Backtracking Introduction.mp49.71MB

12 - Backtracking/002 Backtracking on Arrays Code.mp420.82MB

12 - Backtracking/003 Bactracking on Vectors Code.mp410.92MB

12 - Backtracking/004 Finding Subsets.mp431.21MB

12 - Backtracking/005 Finding Subsets Code.mp481.25MB

12 - Backtracking/006 Ordering Subsets.mp417.11MB

12 - Backtracking/007 Permutations.mp423.6MB

12 - Backtracking/008 N-Queen Problem.mp426.32MB

12 - Backtracking/009 N-Queen Code.mp437.72MB

12 - Backtracking/010 N-Queen All Ways.mp438.68MB

12 - Backtracking/011 Grid Ways.mp435.51MB

12 - Backtracking/012 Grid Ways - Math Trick!.mp49.27MB

12 - Backtracking/013 Sudoku.mp427.92MB

12 - Backtracking/014 Sudoku Code.mp452.88MB

13 - Space & Time Complexity Analysis/001 Space Time Complexity Introduction.mp420.39MB

13 - Space & Time Complexity Analysis/002 Experimental Analysis.mp441.09MB

13 - Space & Time Complexity Analysis/003 Big O Notation.mp410.79MB

13 - Space & Time Complexity Analysis/004 Nested Loops.mp45.98MB

13 - Space & Time Complexity Analysis/005 Loops Example.mp430.14MB

13 - Space & Time Complexity Analysis/006 Analysis of Bubble Sort.mp49.3MB

13 - Space & Time Complexity Analysis/007 Analysis of Binary Search.mp418.13MB

13 - Space & Time Complexity Analysis/008 Merge Sort Analysis.mp414.49MB

13 - Space & Time Complexity Analysis/009 Time Complexity For Recursive Problems.mp422.46MB

14 - Object Oriented Programming/001 Introduction to OOPS.mp420.11MB

14 - Object Oriented Programming/002 OOPS - Classes & Objects.mp415.26MB

14 - Object Oriented Programming/003 Code Demo.mp414.62MB

14 - Object Oriented Programming/004 Getters & Setters.mp419.11MB

14 - Object Oriented Programming/005 Constructor Object Initialiastion.mp447.19MB

14 - Object Oriented Programming/006 Copy Constructor.mp466.65MB

14 - Object Oriented Programming/007 Shallow & Deep Copy.mp484.71MB

14 - Object Oriented Programming/008 Copy Assignment Operator.mp415.9MB

14 - Object Oriented Programming/009 Destructor.mp419.29MB

15 - Linked List/001 Linked List Introduction.mp419.61MB

15 - Linked List/002 Push Front.mp420.51MB

15 - Linked List/003 Push Back.mp45.62MB

15 - Linked List/004 Print.mp422.34MB

15 - Linked List/005 Insert.mp411.26MB

15 - Linked List/007 Recursive Search.mp425.12MB

15 - Linked List/008 Deletion.mp417.39MB

15 - Linked List/009 Pop Front.mp414.89MB

15 - Linked List/010 Reverse a Linked List.mp410.6MB

15 - Linked List/011 Reverse a Linked List Code.mp418.78MB

16 - Stacks/001 Stack Data Structure.mp418.14MB

16 - Stacks/002 Stack Implementations.mp410.6MB

16 - Stacks/003 Stack using Linked List.mp417.39MB

16 - Stacks/004 Stack using Vector.mp48.14MB

16 - Stacks/005 Stack STL.mp47.77MB

16 - Stacks/006 Stack Insert At Bottom Challenge!.mp424.72MB

16 - Stacks/007 Recursively Reverse a Stack.mp414.2MB

16 - Stacks/008 Stock Span Solution.mp436.21MB

17 - Queues/001 Queue Introduction.mp411.16MB

17 - Queues/002 Queue Implementation.mp414.23MB

17 - Queues/003 Queue using Circular Array.mp433.55MB

17 - Queues/004 Queue STL.mp44.62MB

17 - Queues/005 Stack using 2 Queues.mp410.96MB

17 - Queues/006 Stack using 2 Queues Code.mp420.15MB

18 - Binary Tree/001 Binary Tree Introduction.mp427.09MB

18 - Binary Tree/002 Build Tree Preorder.mp420.52MB

18 - Binary Tree/003 Preorder Traversal.mp424.33MB

18 - Binary Tree/004 Inorder Traversal.mp48.35MB

18 - Binary Tree/005 Postorder Traversal.mp411.6MB

18 - Binary Tree/006 Level Order Print.mp421.56MB

18 - Binary Tree/007 Level Order Print Code.mp413.87MB

18 - Binary Tree/008 Level Order Build.mp415.3MB

18 - Binary Tree/009 Level Order Build Code.mp410.17MB

18 - Binary Tree/010 Height of Tree.mp49.24MB

18 - Binary Tree/011 Tree Diameter.mp424.47MB

18 - Binary Tree/012 Diameter Code-I.mp47.51MB

18 - Binary Tree/013 Diameter Code-II.mp434.48MB

19 - Binary Search Tree/001 BST Introduction.mp417.75MB

19 - Binary Search Tree/002 BST Creation.mp416.77MB

19 - Binary Search Tree/004 Searching.mp416.25MB

19 - Binary Search Tree/005 Deletion Concept.mp420.87MB

19 - Binary Search Tree/006 Deletion Code.mp431.45MB

19 - Binary Search Tree/007 Challenge - Print in Range.mp418.65MB

19 - Binary Search Tree/008 Root To Leaf Paths.mp423.56MB

20 - Heaps Priority Queue/001 Introduction to Heap.mp484.3MB

20 - Heaps Priority Queue/002 Heap vs other Data Structure.mp467.98MB

20 - Heaps Priority Queue/003 Heaps as CBT.mp413.06MB

20 - Heaps Priority Queue/004 Heaps as Array.mp420.68MB

20 - Heaps Priority Queue/005 Insertion.mp476.07MB

20 - Heaps Priority Queue/006 Insertion Code.mp421.56MB

20 - Heaps Priority Queue/007 Remove Min Max.mp425.48MB

20 - Heaps Priority Queue/008 Remove Min Max Code.mp434.31MB

20 - Heaps Priority Queue/009 Priority Queue STL.mp418.09MB

20 - Heaps Priority Queue/010 Nearby Cars.mp416.86MB

20 - Heaps Priority Queue/011 Nearby Cars Code.mp452.19MB

21 - Hashing/001 Introduction to Hashing.mp4105.91MB

21 - Hashing/002 Hash Functions.mp4103.4MB

21 - Hashing/003 Collision Handling.mp439.22MB

21 - Hashing/004 Hashing Code - I (Setup).mp418.83MB

21 - Hashing/005 Hashing Code - II (Insertion).mp425.8MB

21 - Hashing/006 Hashing Code - III (Rehashing).mp441.45MB

21 - Hashing/007 Testing our Hashtable.mp416.72MB

21 - Hashing/008 Hashing Code - IV (Search).mp431.76MB

21 - Hashing/009 Hashing Code - V (Erase).mp45.75MB

21 - Hashing/010 Hashing Code - VI (Operator [] Overloading).mp454.49MB

22 - Trie Data Structure/001 Trie Data Structure.mp437.58MB

22 - Trie Data Structure/002 Trie Class.mp410.49MB

22 - Trie Data Structure/003 Trie Insertion.mp411.05MB

22 - Trie Data Structure/004 Trie Searching.mp47.95MB

22 - Trie Data Structure/005 Trie Queries.mp415.5MB

23 - Graphs Introduction/001 Graphs Introduction.mp430.71MB

23 - Graphs Introduction/002 Graph Applications.mp417.94MB

23 - Graphs Introduction/003 Adjacency List Representation.mp416.56MB

23 - Graphs Introduction/004 Adjacency List Representation with Node Class.mp426.88MB

23 - Graphs Introduction/005 BFS.mp415.37MB

23 - Graphs Introduction/006 BFS Code.mp466.16MB

23 - Graphs Introduction/007 DFS.mp49.55MB

23 - Graphs Introduction/008 DFS Code.mp416.85MB

23 - Graphs Introduction/009 Topological Ordering.mp418MB

23 - Graphs Introduction/010 Kahn's Algorithm (Modified BFS).mp411.05MB

23 - Graphs Introduction/011 Topological Ordering using BFS Code.mp412.84MB

23 - Graphs Introduction/012 Dijkshtra's Algorithm.mp423.36MB

23 - Graphs Introduction/013 Dijkshtra's Algorithm Code.mp446.56MB

24 - Dynamic Programming Introduction/001 Dynamic Programming Basics.mp442.7MB

24 - Dynamic Programming Introduction/002 Coin Change.mp429.32MB

24 - Dynamic Programming Introduction/003 Coin Change Code.mp417.29MB

24 - Dynamic Programming Introduction/004 Longest Common Subsequence (LCS).mp411.74MB

24 - Dynamic Programming Introduction/005 Longest Common Subsequence Code.mp45.31MB

24 - Dynamic Programming Introduction/006 Knapsack Problem.mp424.11MB

24 - Dynamic Programming Introduction/007 Knapsack Problem Code.mp422.16MB

24 - Dynamic Programming Introduction/008 Wines Problem.mp411.73MB

24 - Dynamic Programming Introduction/009 Wines Problem - II.mp424.86MB

24 - Dynamic Programming Introduction/010 Wines - III.mp419.38MB

24 - Dynamic Programming Introduction/011 Wines - IV.mp421.31MB

25 - Project - Shopping Cart Backend/001 Shopping Cart Introduction.mp466.98MB

25 - Project - Shopping Cart Backend/002 Shopping Cart Demo.mp422.41MB

25 - Project - Shopping Cart Backend/003 Product Class.mp410.44MB

25 - Project - Shopping Cart Backend/004 Item Class.mp424.28MB

25 - Project - Shopping Cart Backend/005 Choosing Products.mp422.96MB

25 - Project - Shopping Cart Backend/006 Cart Implementation.mp448.63MB

25 - Project - Shopping Cart Backend/007 Checkout.mp418.13MB