种子简介

种子名称： [FreeCourseSite.com] Udemy - Mastering Data Structures & Algorithms using C and C++
文件类型： 视频
文件数目： 366个文件
文件大小： 61.84 GB
收录时间： 2019-10-19 12:23
已经下载： 3次
资源热度： 562
最近下载： 2024-11-23 17:01

下载BT种子文件

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

磁力链接下载

magnet:?xt=urn:btih:daec6b4caa0302d32e779ea841aa98b86e09fbc2&dn=[FreeCourseSite.com] Udemy - Mastering Data Structures & Algorithms using C and C++ 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[FreeCourseSite.com] Udemy - Mastering Data Structures & Algorithms using C and C++.torrent

1. Before we Start/1. Instructor's Note.mp449.05MB

10. Sparse Matrix and Polynomial Representation/1. Sparse Matrix Representation.mp4197.87MB

10. Sparse Matrix and Polynomial Representation/10. Polynomial Evaluation.mp491.57MB

10. Sparse Matrix and Polynomial Representation/11. Polynomial Addition.mp4201.31MB

10. Sparse Matrix and Polynomial Representation/12. Let's Code Polynomial.mp4134.08MB

10. Sparse Matrix and Polynomial Representation/2. Addition of Sparse Matrices.mp4208.02MB

10. Sparse Matrix and Polynomial Representation/3. Array Representation of Sparse Matrix.mp4254.7MB

10. Sparse Matrix and Polynomial Representation/4. Let's Code to Create Sparse Matrix.mp475.79MB

10. Sparse Matrix and Polynomial Representation/5. Program for Adding Sparse Matrix.mp4343.32MB

10. Sparse Matrix and Polynomial Representation/6. Let's Code to Add Sparse Matrix.mp4108.36MB

10. Sparse Matrix and Polynomial Representation/7. Let's Code Sparse Matrix using C++.mp464.59MB

10. Sparse Matrix and Polynomial Representation/8. Let's Code Sparse Matrix using C++ Continued......mp4131.79MB

10. Sparse Matrix and Polynomial Representation/9. Polynomial Representation.mp4233.83MB

11. Linked List/1. Why we need Dynamic Data Structure Linked List.mp4207.68MB

11. Linked List/10. Let's Code Count and Sum.mp472.57MB

11. Linked List/11. Maximum Element in a Linked List.mp4142.74MB

11. Linked List/12. Let's Code Max for Linked List.mp424.08MB

11. Linked List/13. Searching in a Linked List.mp4103.85MB

11. Linked List/14. Improve Searching in Linked List.mp4189.83MB

11. Linked List/15. Let's Code Searching in Linked List.mp465.34MB

11. Linked List/16. Inserting in a Linked List.mp4372.04MB

11. Linked List/17. Let's Code Insert for Linked List.mp444.73MB

11. Linked List/18. Creating a Linked List using Insert.mp453.61MB

11. Linked List/19. Creating a Linked List by Inserting at Last.mp4158.58MB

11. Linked List/2. About Linked List.mp4223.47MB

11. Linked List/20. Inserting in a Sorted Linked List.mp4156.37MB

11. Linked List/21. Let's Code Insert in Sorted Linked List.mp443.53MB

11. Linked List/22. Deleting from Linked List.mp4270.84MB

11. Linked List/23. Let's Code Delete on Linked List.mp448.7MB

11. Linked List/24. Check if a Linked List is Sorted.mp4185.09MB

11. Linked List/25. Let's Code to check if Linked List is Sorted.mp418.77MB

11. Linked List/26. Remove Duplicates from Linked List.mp4134.71MB

11. Linked List/27. Let's Code to Remove Duplicates from Linked List.mp418.58MB

11. Linked List/28. Reversing a Linked List.mp4153.46MB

11. Linked List/29. Reversing using Sliding Pointers.mp4234.1MB

11. Linked List/3. More About Linked List.mp4176.73MB

11. Linked List/30. Recursive Reverse for Linked List.mp496.58MB

11. Linked List/31. Let's Code Reversing a Linked List.mp454.69MB

11. Linked List/32. Concatenating 2 Linked Lists.mp468.73MB

11. Linked List/33. Merging 2 Linked Lists.mp4322.83MB

11. Linked List/34. Let's Code to Concatenate and Merge Linked Lists.mp473.35MB

11. Linked List/35. Check for LOOP in Linked List.mp4207.45MB

11. Linked List/36. Let's Code to Check LOOP.mp429.5MB

11. Linked List/37. Let's Code a C++ class for Linked List.mp4110.2MB

11. Linked List/38. Circular Linked List.mp4155.02MB

11. Linked List/39. Display Circular Linked List.mp4188.71MB

11. Linked List/4. Display Linked List.mp4127.55MB

11. Linked List/40. Le's Code Circular Linked List.mp445.46MB

11. Linked List/41. Inserting in a Circular Linked List.mp4231.75MB

11. Linked List/42. Let's Code Insert for a Circular Linked List.mp438.49MB

11. Linked List/43. Deleting From Circular Linked List.mp4147.81MB

11. Linked List/44. Let's Code for Circular Linked List.mp432.21MB

11. Linked List/45. Doubly Linked List.mp494.67MB

11. Linked List/46. Let's Code Doubly Linked List.mp431.56MB

11. Linked List/47. Insert in a Doubly Linked List.mp4211.52MB

11. Linked List/48. Let's Code Insert for Doubly Linked List.mp425.43MB

11. Linked List/49. Deleting from Doubly Linked List.mp4182.83MB

11. Linked List/5. Let's Code Display for Linked List.mp462.31MB

11. Linked List/50. Let's Code Delete for Doubly Linked List.mp428.97MB

11. Linked List/51. Reverse a Doubly Linked List.mp4122.36MB

11. Linked List/52. Let's Code Reverse for Doubly Linked List.mp414MB

11. Linked List/53. Circular Doubly Linked List.mp4163.79MB

11. Linked List/54. Comparison of Linked List.mp4250.39MB

11. Linked List/55. Comparison of Array with Linked List.mp4243.84MB

11. Linked List/56. Student Challenge Finding Middle Element of a Linked List..mp4234.39MB

11. Linked List/57. Student Challenge Finding Intersecting point of Two Linked List.mp4198.84MB

11. Linked List/6. Recursive Display of Linked List.mp4308.67MB

11. Linked List/7. Le's Code Recursive Display for Linked List.mp432.61MB

11. Linked List/8. Counting Nodes in a Linked List.mp4234.42MB

11. Linked List/9. Sum of All Elements in a Linked List.mp489.44MB

12. Sparse Matrix and Polynomial using Linked List/1. Student Challenge Sparse Matrix using Linked List.mp4217.39MB

12. Sparse Matrix and Polynomial using Linked List/2. Student Challenge Polynomial Representation using Linked List.mp4159.95MB

12. Sparse Matrix and Polynomial using Linked List/3. Let's Code Polynomial.mp449.77MB

13. Stack/1. Introduction to Stack.mp4273.44MB

13. Stack/10. Program for Parenthesis Matching.mp4185.85MB

13. Stack/11. Let's Code Parenthesis Matching.mp425.32MB

13. Stack/12. More on Parenthesis Matching.mp4144.78MB

13. Stack/13. Infix to Postfix Conversion.mp4394.48MB

13. Stack/14. Associativity and Unary Operators.mp4298.86MB

13. Stack/15. Infix to Postfix using Stack Method 1.mp4159.12MB

13. Stack/16. Infix to Postfix using Stack Method 2.mp475.17MB

13. Stack/17. Program for Infix to Postfix Conversion.mp4192.05MB

13. Stack/18. Let's Code Infix to Postfix Conversion.mp455.09MB

13. Stack/19. Student Challenge Infix to Postfix with Associativity and Parenthesis.mp4213.52MB

13. Stack/2. Stack using Array.mp4221.39MB

13. Stack/20. Evaluation of Postfix Expression.mp4223.92MB

13. Stack/21. Program for Evaluation of Postfix.mp4175.87MB

13. Stack/22. Let's Code Evaluation of Postfix.mp433.87MB

13. Stack/3. Implementation os Stack using Array.mp4378.45MB

13. Stack/4. Let's Code Stack using Array.mp477.65MB

13. Stack/5. Stack using Linked List.mp4120.05MB

13. Stack/6. Stack Operations using Linked List.mp4198.81MB

13. Stack/7. Let's Code Stack using Linked List.mp442.15MB

13. Stack/8. Let's Code C++ class for Stack using Linked List.mp433.86MB

13. Stack/9. Parenthesis Matching.mp4149.42MB

14. Queues/1. Queue ADT.mp4101.86MB

14. Queues/10. Queue using Linked List.mp4173.13MB

14. Queues/11. Let's Code Queue using Linked List.mp433.17MB

14. Queues/12. Double Ended Queue DEQUEUE.mp4115.19MB

14. Queues/13. Priority Queues.mp4252.2MB

14. Queues/14. Queue using 2 Stacks.mp4150.98MB

14. Queues/2. Queue using Single Pointer.mp484.73MB

14. Queues/3. Queue using Two Pointers.mp4173.92MB

14. Queues/4. Implementing Queue using Array.mp4194.16MB

14. Queues/5. Let's Code Queue using Array.mp438.52MB

14. Queues/6. Let's Code Queue in C++.mp438.66MB

14. Queues/7. Drawback of Queue using Array.mp4101.2MB

14. Queues/8. Circular Queue.mp4244.06MB

14. Queues/9. Let's Code Circular Queue.mp422.82MB

15. Trees/1. Terminology.mp4255.32MB

15. Trees/10. Representation of Binary Tree.mp4119.13MB

15. Trees/11. Linked Representation of Binary Tree.mp478.38MB

15. Trees/12. Full vs Complete Binary Tree.mp4133.68MB

15. Trees/13. Strict vs Complete Binary Tree.mp494.62MB

15. Trees/14. Binary Tree Traversals.mp4202.08MB

15. Trees/15. Binary Tree Traversal Easy Method 1.mp463.38MB

15. Trees/16. Binary Tree Traversal Easy Method 2.mp476.63MB

15. Trees/17. Binary Tree Traversal Easy Method 3.mp498.53MB

15. Trees/18. Creating Binary Tree.mp4175.5MB

15. Trees/19. Program to Create Binary Tree.mp494.39MB

15. Trees/2. Number of Binary Trees using N Nodes.mp4280.78MB

15. Trees/20. Let's Code Creating Binary Tree.mp4104.76MB

15. Trees/21. Let's Code Creating Binary Tree in C++.mp4222.69MB

15. Trees/22. Preorder Tree Traversal.mp4287.67MB

15. Trees/23. Inorder Tree Traversals Functions.mp4224.62MB

15. Trees/24. Iterative Preorder.mp4216.91MB

15. Trees/25. Iterative Inorder.mp4209.27MB

15. Trees/26. Let's Code Iterative Traversals.mp444.07MB

15. Trees/27. Level Order Traversal.mp4142.46MB

15. Trees/28. Let's Code Level Order Traversal.mp422.97MB

15. Trees/29. Can we Generate Tree from Traversals.mp4145.3MB

15. Trees/3. Height vs Nodes in Binary Tree.mp4286.37MB

15. Trees/30. Generating Tree from Traversals.mp4162.34MB

15. Trees/31. Height and Count of Binary Tree.mp4212.26MB

15. Trees/32. Let's Code Height and Count.mp419.8MB

15. Trees/33. Student Challenge Count Leaf Nodes of a Binary Tree.mp4236.54MB

15. Trees/4. Internal Nodes vs External Nodes in Binary Tree.mp474.68MB

15. Trees/5. Strict Binary Tree.mp452.91MB

15. Trees/6. Height vs Node of String Binary Tree.mp487.33MB

15. Trees/7. Internal vs External Nodes of Strict Binary Trees.mp432.1MB

15. Trees/8. n-ary Trees.mp4139.82MB

15. Trees/9. Analysis of n-Ary Trees.mp4183.98MB

16. Binary Search Trees/1. BST intro.mp4120.53MB

16. Binary Search Trees/10. Program for Generating BST from Preorder.mp4140.8MB

16. Binary Search Trees/11. Drawbacks of Binary Search Tree.mp4104.7MB

16. Binary Search Trees/2. Searching in a Binary Search Tree.mp4222.75MB

16. Binary Search Trees/3. Inserting in a Binary Search Tree.mp4148.92MB

16. Binary Search Trees/4. Recursive Insert in Binary Search Tree.mp4149.17MB

16. Binary Search Trees/5. Creating a Binary Search Tree.mp462.43MB

16. Binary Search Trees/6. Let's code Binary Search Tree.mp494.32MB

16. Binary Search Trees/7. Deleting from Binary Search Tree.mp4227.24MB

16. Binary Search Trees/8. Let's Code Recursive Insert and Delete on BST.mp4142.71MB

16. Binary Search Trees/9. Generating BST from Preorder.mp4201.19MB

17. AVL Trees/1. Introduction to AVL Trees.mp4137.03MB

17. AVL Trees/2. Inserting in AVL with Rotations.mp4329.83MB

17. AVL Trees/3. General form of AVL Rotations.mp4304.59MB

17. AVL Trees/4. Let's Code LL Rotation on AVL.mp4135.98MB

17. AVL Trees/5. Let's Code LR Rotation on AVL.mp437.59MB

17. AVL Trees/6. Generating AVL Tree.mp4287.06MB

17. AVL Trees/7. Deletion from AVL Tree with Rotations.mp4179.46MB

17. AVL Trees/8. Height Analysis of AVL Trees.mp4280.61MB

18. Search Trees/1. 2-3 Trees.mp4769.4MB

18. Search Trees/2. 2-3-4 Trees.mp4299.52MB

18. Search Trees/3. Re-Black Trees Introduction.mp4115.94MB

18. Search Trees/4. Red-Black Tree creation.mp4513.05MB

18. Search Trees/5. Red-Black Trees vs 2-3-4 Trees.mp4112.6MB

18. Search Trees/6. Creating Red-Black Tree similar to Creating 2-3-4 Tree.mp4256.96MB

18. Search Trees/7. Red-Black Tree Deletion Cases.mp4334.35MB

18. Search Trees/8. Red-Black Tree Deletion Examples.mp4211.24MB

18. Search Trees/9. Red-Black Tree vs 2-3-4 Tree Deletion.mp4269.04MB

19. Heap/1. Introduction to Heap.mp491.54MB

19. Heap/2. Inserting in a Heap.mp4172.49MB

19. Heap/3. Program to Insert in a Heap.mp498.18MB

19. Heap/4. Creating a Heap.mp4252.62MB

19. Heap/5. Deleting from Heap and Heap Sort.mp4282MB

19. Heap/6. Let's Code Heap Sort.mp490.07MB

19. Heap/7. Heapify - Faster Method for creating Heap.mp4196.82MB

19. Heap/8. Heap as Priority Queue.mp4166.12MB

2. Essential C and C++ Concepts/1. Arrays Basics.mp4143.47MB

2. Essential C and C++ Concepts/10. Structures and Functions (Must Watch).mp4117.92MB

2. Essential C and C++ Concepts/11. Converting a C program to a C++ class (Must Watch).mp4212.42MB

2. Essential C and C++ Concepts/12. C++ Class and Constructor.mp4220.52MB

2. Essential C and C++ Concepts/13. Template classes.mp4241.76MB

2. Essential C and C++ Concepts/2. Structures.mp4413.55MB

2. Essential C and C++ Concepts/3. Pointers.mp4247.36MB

2. Essential C and C++ Concepts/4. Reference in C++.mp488.61MB

2. Essential C and C++ Concepts/5. Pointer to Structure.mp4141.1MB

2. Essential C and C++ Concepts/6. Functions.mp4276.07MB

2. Essential C and C++ Concepts/7. Parameter Passing Methods.mp4315.32MB

2. Essential C and C++ Concepts/8. Array as Parameter.mp4167.2MB

2. Essential C and C++ Concepts/9. Structure as Parameter.mp4236.53MB

20. Sorting Techniques/1. Criteria used for Analysing Sorts.mp4192.33MB

20. Sorting Techniques/10. Selection Sort.mp4249.14MB

20. Sorting Techniques/11. Program for Selection Sort.mp460.33MB

20. Sorting Techniques/12. Analysis of Selection Sort.mp470.97MB

20. Sorting Techniques/13. Let's Code Selection Sort.mp415.8MB

20. Sorting Techniques/14. Idea behind Quick Sort.mp4148.22MB

20. Sorting Techniques/15. Quick Sort.mp4188.16MB

20. Sorting Techniques/16. Analysis of Quick Sort.mp4228.45MB

20. Sorting Techniques/17. Analysis of Quick Sort Continued......mp4280.68MB

20. Sorting Techniques/18. Let's Code Quick Sort.mp442.7MB

20. Sorting Techniques/19. Merging.mp4384.37MB

20. Sorting Techniques/2. Bubble Sort.mp4451.72MB

20. Sorting Techniques/20. Iterative Merge Sort.mp4257.22MB

20. Sorting Techniques/21. Let's Code Iterative Merge Sort.mp449.37MB

20. Sorting Techniques/22. Recursive Merge Sort.mp4404.33MB

20. Sorting Techniques/23. Let's Code Recursive Merge Sort.mp419.3MB

20. Sorting Techniques/24. Count Sort.mp4269.72MB

20. Sorting Techniques/25. Let's Code Count Sort.mp444.77MB

20. Sorting Techniques/26. Bin Bucket Sort.mp4228.3MB

20. Sorting Techniques/27. Radix Sort.mp4322.04MB

20. Sorting Techniques/28. Shell Sort.mp4476.82MB

20. Sorting Techniques/29. Let's Code Shell Sort.mp419.17MB

20. Sorting Techniques/3. Let's Code Bubble Sort.mp438.59MB

20. Sorting Techniques/4. Insertion Sort.mp4136.02MB

20. Sorting Techniques/5. Insertion Sort Continued.....mp4203.99MB

20. Sorting Techniques/6. Program for Insertion Sort.mp4113.96MB

20. Sorting Techniques/7. Analysis of Insertion Sort.mp498.07MB

20. Sorting Techniques/8. Let's Code Insertion Sort.mp414.71MB

20. Sorting Techniques/9. Comparing Bubble and Insertion Sort.mp460.01MB

21. Hashing Technique/1. Introduction to Hashing.mp4358.72MB

21. Hashing Technique/2. Chaining.mp4337.06MB

21. Hashing Technique/3. Let's Code Chaining.mp449.79MB

21. Hashing Technique/4. Linear Probing.mp4392.26MB

21. Hashing Technique/5. Let's Code Linear Probing.mp462.01MB

21. Hashing Technique/6. Quadratic Probing.mp4105.64MB

21. Hashing Technique/7. Double Hashing.mp4211.69MB

21. Hashing Technique/8. Hash Function Ideas.mp4220.55MB

22. Graphs/1. Introduction to Graphs.mp4195.51MB

22. Graphs/10. Prim's Minimum Cost Spanning Tree.mp4156.41MB

22. Graphs/11. Prim's Program.mp4654.46MB

22. Graphs/12. Let's Code Prim's using.mp461.27MB

22. Graphs/13. Kruskal's Minimum Cost Spanning Tree.mp4140.95MB

22. Graphs/14. Disjoint Subsets.mp4310.71MB

22. Graphs/15. Kruskal's Program.mp4438.14MB

22. Graphs/16. Let's Code Kruskla's Program.mp450.48MB

22. Graphs/2. Representation of Undirected Graph.mp4315.17MB

22. Graphs/3. Representation of Directed Graphs.mp4146.73MB

22. Graphs/4. Breadth First Search.mp4397.95MB

22. Graphs/5. Program for BFS.mp4202.28MB

22. Graphs/6. Depth First Search.mp4236.77MB

22. Graphs/7. Program for DFS.mp493.32MB

22. Graphs/8. Let's Code BFS & DFS.mp486.64MB

22. Graphs/9. Spanning Trees.mp4175.49MB

23. Asymptotic Notations/1. Asymptotic Notations Big Oh , Omega , Theta.mp4237.56MB

3. Required Setup for Programming/1. Setup Dev-C++.mp452.21MB

3. Required Setup for Programming/2. Setup CodeBlocks.mp457.84MB

3. Required Setup for Programming/3. Setup Xcode.mp471.43MB

4. Introduction/1. Introduction.mp4302.19MB

4. Introduction/2. Stack vs Heap Memory.mp4201.6MB

4. Introduction/3. Stack vs Heap. Continued....mp4294.49MB

4. Introduction/4. Physical vs Logical Data Structures.mp4163.15MB

4. Introduction/5. ADT.mp4325.12MB

4. Introduction/6. Time and Space Complexity.mp4411.07MB

4. Introduction/7. Time and Space Complexity from Code.mp4205.42MB

5. Recursion/1. How Recursion Works ( Tracing ).mp4426.79MB

5. Recursion/10. Tree Recursion.mp4391.13MB

5. Recursion/11. Let's Code Tree Recursion.mp455.53MB

5. Recursion/12. Indirect Recursion.mp4104.1MB

5. Recursion/13. Let's Code Indirect Recursion.mp422.24MB

5. Recursion/14. Nested Recursion.mp4159.27MB

5. Recursion/15. Let's Code Nested Recursion.mp413.54MB

5. Recursion/16. Sum of Natural Number using Recursion.mp4232.28MB

5. Recursion/17. Let's Code Sum of N using Recursion.mp439.17MB

5. Recursion/18. Factorial using Recursion.mp4104.79MB

5. Recursion/19. Let's Code Factorial using Recursion.mp441.38MB

5. Recursion/2. Generalising Recursion.mp447.37MB

5. Recursion/20. Power using Recursion.mp4305.97MB

5. Recursion/21. Let's Code Power Recursion.mp421.29MB

5. Recursion/22. Taylor Series using Recursion.mp4320.03MB

5. Recursion/23. Let's Code Taylor Series using Recursion.mp429.95MB

5. Recursion/24. Taylor Series using Horner's Rule.mp4245.26MB

5. Recursion/25. Let's Code Taylor Series Horner's Rule - Recursion.mp414.17MB

5. Recursion/26. Let's Code Taylor Series Iterative.mp411.54MB

5. Recursion/27. Fibonacci Series using Recursion - Memoization.mp4436.72MB

5. Recursion/28. Let's Code Fibonacci.mp4106.55MB

5. Recursion/29. nCr using Recursion.mp4210.84MB

5. Recursion/3. How Recursion uses Stack.mp4242.21MB

5. Recursion/30. Let's Code nCr using Recursion.mp425.98MB

5. Recursion/31. Tower of Hanoi Problem.mp4586.95MB

5. Recursion/32. Let's Code Tower of Hanoi.mp421.36MB

5. Recursion/34. Quiz 1 Solutions.mp4696.29MB

5. Recursion/4. Recurrence Relation - Time Complexity of Recursion.mp4249.77MB

5. Recursion/5. Lets Code Recursion.mp4134.28MB

5. Recursion/6. Static and Global Variables in Recursion.mp4190.37MB

5. Recursion/7. Let's Code Static and Global in Recursion.mp459.5MB

5. Recursion/8. Tail Recursion.mp4165.22MB

5. Recursion/9. Head Recursion.mp4110.36MB

6. Arrays Representations/1. Introduction to Array.mp493.56MB

6. Arrays Representations/10. Array Representation by Compiler.mp4195.85MB

6. Arrays Representations/11. Row Major Formula for 2D Arrays.mp4215.81MB

6. Arrays Representations/12. Column Major Formula for 2D Arrays.mp4145.79MB

6. Arrays Representations/13. Formulas for nD Arrays.mp4250.27MB

6. Arrays Representations/14. Formulas for 3D Arrays.mp481.32MB

6. Arrays Representations/2. Declarations of Array.mp4138.08MB

6. Arrays Representations/3. Demo - Array Declaration.mp432.22MB

6. Arrays Representations/4. Static vs Dynamic Arrays.mp4197.35MB

6. Arrays Representations/5. Demo - Static vs Dynamic Array.mp432.32MB

6. Arrays Representations/6. How to Increase Array Size.mp4115.69MB

6. Arrays Representations/7. Demo - Increasing Array Size.mp452.66MB

6. Arrays Representations/8. 2D Arrays.mp4237.61MB

6. Arrays Representations/9. Demo - 2D Array.mp450.27MB

7. Array ADT/1. Array ADT.mp4102.63MB

7. Array ADT/10. Binary Search.mp4223.9MB

7. Array ADT/11. Binary Search Algorithm.mp4159.85MB

7. Array ADT/12. Let's Code Binary Search.mp454.23MB

7. Array ADT/13. Analysis of Binary Search.mp4284.11MB

7. Array ADT/14. Average Case Analysis of Binary Search.mp4256.24MB

7. Array ADT/15. Get( ) Set( ) Avg( ) Max( ) functions on Array.mp4327.17MB

7. Array ADT/16. Let's Code Get() Set() Max() on Array.mp467.54MB

7. Array ADT/17. Reverse and Shift an Array.mp4254.93MB

7. Array ADT/18. Lest's Code Reversing an Array.mp449.42MB

7. Array ADT/19. Check if Array is Sorted.mp4353.42MB

7. Array ADT/2. Demo - Array ADT.mp4101.58MB

7. Array ADT/20. Let's Code to check if Array is Sorted.mp484.97MB

7. Array ADT/21. Merging Arrays.mp4197.96MB

7. Array ADT/22. Let's Code to Merge Arrays.mp471.46MB

7. Array ADT/23. Set operations on Array - Union, Intersection and Difference.mp4269.58MB

7. Array ADT/24. Let's Code Set operations on Array.mp493.18MB

7. Array ADT/25. Let's Code a Menu Driver program for Arrays.mp468.31MB

7. Array ADT/26. Let's convert C program for Array to C++.mp4169.54MB

7. Array ADT/27. Let's Put all together in C++ program for Array.mp4131.58MB

7. Array ADT/28. Student Challenge Finding Single Missing Element in an Array.mp4246.73MB

7. Array ADT/29. Student Challenge Finding Multiple Missing Elements in an Array.mp4181.5MB

7. Array ADT/3. Inserting in an Array.mp4248.27MB

7. Array ADT/30. Student Challenge Finding Missing Element in an Array Method 2.mp4180.74MB

7. Array ADT/31. Student Challenge Finding Duplicates in a Sorted Array.mp4289.19MB

7. Array ADT/32. Student Challenge Finding Duplicates in Sorted Array using Hashing.mp4167.94MB

7. Array ADT/33. Student Challenge Finding Duplicates in a Unsorted Array.mp4296.34MB

7. Array ADT/34. Student Challenge Finding a Pair of Elements with sum K.mp4293.12MB

7. Array ADT/35. Student Challenge Finding a Pair of Elements with sum K in Sorted Array.mp4170.28MB

7. Array ADT/36. Student Challenge Finding Max and Min in a single Scan.mp4202.3MB

7. Array ADT/4. Let's Code Insert.mp448.79MB

7. Array ADT/5. Deleting from Array.mp4145.29MB

7. Array ADT/6. Let's Code Delete.mp440.93MB

7. Array ADT/7. Linear Search.mp4258.69MB

7. Array ADT/8. Improving Linear Search.mp496.84MB

7. Array ADT/9. Let's Code Linear Search.mp449.73MB

8. Strings/1. Introduction to Strings.mp4522.08MB

8. Strings/10. Checking if 2 Strings are Anagram.mp4305.78MB

8. Strings/11. Permutation of String.mp4706.77MB

8. Strings/2. Finding Length of a String.mp4105.89MB

8. Strings/3. Changing Case of a String.mp4180.32MB

8. Strings/4. Counting Words and Vowels in a String.mp4200.22MB

8. Strings/5. Validating a String.mp4135.5MB

8. Strings/6. Reversing a String.mp4196.07MB

8. Strings/7. Comparing Strings and Checking Palindrome.mp4247.92MB

8. Strings/8. Finding Duplicates in a String.mp4289.26MB

8. Strings/9. Finding Duplicates in a String using Bitwise Operations.mp4564.31MB

9. Matrices/1. Section Introduction.mp422.32MB

9. Matrices/10. Upper Triangular Matrix Row-Major Mapping.mp4151.87MB

9. Matrices/11. Upper Triangular Matrix Column-Major Mapping.mp475.33MB

9. Matrices/12. Symmetric Matrix.mp457.31MB

9. Matrices/13. Tri-Diagonal and Tri-Band Matrix.mp4217.25MB

9. Matrices/14. Toeplitz Matrix.mp4162.72MB

9. Matrices/15. Menu Driven Program for Matrices.mp4334.78MB

9. Matrices/16. Menu Driven Program for Matrices using Functions.mp4109.68MB

9. Matrices/17. How to Write C++ Classes for All Matrices.mp4268.01MB

9. Matrices/2. Diagonal Matrix.mp4194.45MB

9. Matrices/3. Let's Code Diagonal Matrix.mp455.74MB

9. Matrices/4. C++ class for Diagonal Matrix.mp4307.17MB

9. Matrices/5. Let's Code C++ class for Diagonal matrix.mp458.82MB

9. Matrices/6. Lower Triangular Matrix Row-Major Mapping.mp4211.7MB

9. Matrices/7. Lower Triangular Matrix Column-Major Mapping.mp4148.78MB

9. Matrices/8. Let's Code Lower Triangular Matrix in C.mp498.34MB

9. Matrices/9. Let's Code Lower Triangular Matrix in C++.mp484.61MB