Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 1. Before we Start
- 1. Instructor's Note.mp4
- 2. Essential C and C++ Concepts
- 1. Arrays Basics.mp4
- 10. Structures and Functions (Must Watch).mp4
- 11. Converting a C program to a C++ class (Must Watch).mp4
- 12. C++ Class and Constructor.mp4
- 13. Template classes.mp4
- 2. Structures.mp4
- 3. Pointers.mp4
- 4. Reference in C++.mp4
- 5. Pointer to Structure.mp4
- 6. Functions.mp4
- 7. Parameter Passing Methods.mp4
- 8. Array as Parameter.mp4
- 9. Structure as Parameter.mp4
- 3. Required Setup for Programming
- 1. Setup Dev-C++.mp4
- 2. Setup CodeBlocks.mp4
- 3. Setup Xcode.mp4
- 4. Introduction
- 1. Introduction.mp4
- 2. Stack vs Heap Memory.mp4
- 3. Stack vs Heap. Continued....mp4
- 4. Physical vs Logical Data Structures.mp4
- 5. ADT.mp4
- 6. Time and Space Complexity.mp4
- 7. Time and Space Complexity from Code.mp4
- 5. Recursion
- 1. How Recursion Works ( Tracing ).mp4
- 10. Tree Recursion.mp4
- 11. Let's Code Tree Recursion.mp4
- 11.1 11. TreeRecursion.pdf.pdf
- 12. Indirect Recursion.mp4
- 13. Let's Code Indirect Recursion.mp4
- 13.1 12. Indirect Recursion.pdf.pdf
- 14. Nested Recursion.mp4
- 15. Let's Code Nested Recursion.mp4
- 15.1 13. Nested Recursion.pdf.pdf
- 23.1 17. Taylor Series.pdf.pdf
- 24. Taylor Series using Horner's Rule.mp4
- 25. Let's Code Taylor Series Horner's Rule - Recursion.mp4
- 25.1 18. Taylor.pdf.pdf
- 26. Let's Code Taylor Series Iterative.mp4
- 26.1 18. Tayloer Series Iterative.pdf.pdf
- 27. Fibonacci Series using Recursion - Memoization.mp4
- 28. Let's Code Fibonacci.mp4
- 28.1 19. Fibonacci.pdf.pdf
- 29. nCr using Recursion.mp4
- 3. How Recursion uses Stack.mp4
- 30. Let's Code nCr using Recursion.mp4
- 30.1 20. Combination.pdf.pdf
- 32. Let's Code Tower of Hanoi.mp4
- 32.1 21. Tower of Hanoi.pdf.pdf
- 33. Recursion.html
- 34. Quiz 1 Solutions.mp4
- 4. Recurrence Relation - Time Complexity of Recursion.mp4
- 5. Lets Code Recursion.mp4
- 5.1 7. TailHead.pdf.pdf
- 6. Static and Global Variables in Recursion.mp4
- 7. Let's Code Static and Global in Recursion.mp4
- 7.1 8. StaticGlobal.pdf.pdf
- 8. Tail Recursion.mp4
- 9. Head Recursion.mp4
- 16. Sum of Natural Number using Recursion.mp4
- 31. Tower of Hanoi Problem.mp4
- 17. Let's Code Sum of N using Recursion.mp4
- 17.1 14. Sum of N .pdf.pdf
- 18. Factorial using Recursion.mp4
- 19. Let's Code Factorial using Recursion.mp4
- 19.1 15. Factorial.pdf.pdf
- 2. Generalising Recursion.mp4
- 20. Power using Recursion.mp4
- 21. Let's Code Power Recursion.mp4
- 21.1 16. Power.pdf.pdf
- 22. Taylor Series using Recursion.mp4
- 23. Let's Code Taylor Series using Recursion.mp4
- 6. Arrays Representations
- 3. Demo - Array Declaration.mp4
- 1. Introduction to Array.mp4
- 10. Array Representation by Compiler.mp4
- 11. Row Major Formula for 2D Arrays.mp4
- 12. Column Major Formula for 2D Arrays.mp4
- 13. Formulas for nD Arrays.mp4
- 14. Formulas for 3D Arrays.mp4
- 15. Arrays Representation.html
- 2. Declarations of Array.mp4
- 4. Static vs Dynamic Arrays.mp4
- 5. Demo - Static vs Dynamic Array.mp4
- 5.1 23. Static Dyn Array.pdf.pdf
- 6. How to Increase Array Size.mp4
- 7. Demo - Increasing Array Size.mp4
- 7.1 23.1 Array Size.pdf.pdf
- 8. 2D Arrays.mp4
- 9. Demo - 2D Array.mp4
- 9.1 23.2 2D Array.pdf.pdf
- 7. Array ADT
- 1. Array ADT.mp4
- 10. Binary Search.mp4
- 11. Binary Search Algorithm.mp4
- 12. Let's Code Binary Search.mp4
- 12.1 34. BinarySearch.pdf.pdf
- 13. Analysis of Binary Search.mp4
- 14. Average Case Analysis of Binary Search.mp4
- 15. Get( ) Set( ) Avg( ) Max( ) functions on Array.mp4
- 16. Let's Code Get() Set() Max() on Array.mp4
- 16.1 37. Get Set.pdf.pdf
- 17. Reverse and Shift an Array.mp4
- 18. Lest's Code Reversing an Array.mp4
- 18.1 38. Reverse Array.pdf.pdf
- 27.1 41.1 Array C++ #2.pdf.pdf
- 28. Student Challenge Finding Single Missing Element in an Array.mp4
- 29. Student Challenge Finding Multiple Missing Elements in an Array.mp4
- 3. Inserting in an Array.mp4
- 30. Student Challenge Finding Missing Element in an Array Method 2.mp4
- 31. Student Challenge Finding Duplicates in a Sorted Array.mp4
- 32. Student Challenge Finding Duplicates in Sorted Array using Hashing.mp4
- 33. Student Challenge Finding Duplicates in a Unsorted Array.mp4
- 34. Student Challenge Finding a Pair of Elements with sum K.mp4
- 2. Demo - Array ADT.mp4
- 20. Let's Code to check if Array is Sorted.mp4
- 20.1 39. isSorted.pdf.pdf
- 21. Merging Arrays.mp4
- 22. Let's Code to Merge Arrays.mp4
- 22.1 40 Merge 2.pdf.pdf
- 23. Set operations on Array - Union, Intersection and Difference.mp4
- 24. Let's Code Set operations on Array.mp4
- 24.1 41. Set Operations.pdf.pdf
- 25. Let's Code a Menu Driver program for Arrays.mp4
- 25.1 41. Array Menu C.pdf.pdf
- 26. Let's convert C program for Array to C++.mp4
- 26.1 41.1 Array C++ class.pdf.pdf
- 19. Check if Array is Sorted.mp4
- 27. Let's Put all together in C++ program for Array.mp4
- 35. Student Challenge Finding a Pair of Elements with sum K in Sorted Array.mp4
- 36. Student Challenge Finding Max and Min in a single Scan.mp4
- 37. Array ADT.html
- 4. Let's Code Insert.mp4
- 4.1 29. Insert.pdf.pdf
- 5. Deleting from Array.mp4
- 6. Let's Code Delete.mp4
- 6.1 30 Delete.pdf.pdf
- 7. Linear Search.mp4
- 8. Improving Linear Search.mp4
- 9. Let's Code Linear Search.mp4
- 9.1 32. LinearSearch.pdf.pdf
- 8. Strings
- 1. Introduction to Strings.mp4
- 10. Checking if 2 Strings are Anagram.mp4
- 11. Permutation of String.mp4
- 2. Finding Length of a String.mp4
- 3. Changing Case of a String.mp4
- 4. Counting Words and Vowels in a String.mp4
- 5. Validating a String.mp4
- 6. Reversing a String.mp4
- 7. Comparing Strings and Checking Palindrome.mp4
- 8. Finding Duplicates in a String.mp4
- 9. Finding Duplicates in a String using Bitwise Operations.mp4
- 9. Matrices
- 2. Diagonal Matrix.mp4
- 1. Section Introduction.mp4
- 10. Upper Triangular Matrix Row-Major Mapping.mp4
- 11. Upper Triangular Matrix Column-Major Mapping.mp4
- 12. Symmetric Matrix.mp4
- 13. Tri-Diagonal and Tri-Band Matrix.mp4
- 14. Toeplitz Matrix.mp4
- 15. Menu Driven Program for Matrices.mp4
- 16. Menu Driven Program for Matrices using Functions.mp4
- 17. How to Write C++ Classes for All Matrices.mp4
- 18. Matrices.html
- 3. Let's Code Diagonal Matrix.mp4
- 3.1 43. Diag Matrix C.pdf.pdf
- 4. C++ class for Diagonal Matrix.mp4
- 5. Let's Code C++ class for Diagonal matrix.mp4
- 5.1 43. Diag Matrix Cpp.pdf.pdf
- 6. Lower Triangular Matrix Row-Major Mapping.mp4
- 7. Lower Triangular Matrix Column-Major Mapping.mp4
- 8. Let's Code Lower Triangular Matrix in C.mp4
- 8.1 45. Lower Triangular C.pdf.pdf
- 9. Let's Code Lower Triangular Matrix in C++.mp4
- 9.1 46. Lower Triangular CPP.pdf.pdf
- 10. Sparse Matrix and Polynomial Representation
- 4.1 58. Sparse Matrix C.pdf.pdf
- 1. Sparse Matrix Representation.mp4
- 10. Polynomial Evaluation.mp4
- 11. Polynomial Addition.mp4
- 12. Let's Code Polynomial.mp4
- 12.1 60. Polynomial.pdf.pdf
- 2. Addition of Sparse Matrices.mp4
- 3. Array Representation of Sparse Matrix.mp4
- 4. Let's Code to Create Sparse Matrix.mp4
- 5. Program for Adding Sparse Matrix.mp4
- 6. Let's Code to Add Sparse Matrix.mp4
- 6.1 58. Sparse Matrix C.pdf.pdf
- 7. Let's Code Sparse Matrix using C++.mp4
- 8. Let's Code Sparse Matrix using C++ Continued......mp4
- 8.1 58. Sparse Matrix C++.pdf.pdf
- 9. Polynomial Representation.mp4
- 11. Linked List
- 1. Why we need Dynamic Data Structure Linked List.mp4
- 10. Let's Code Count and Sum.mp4
- 10.1 67. Count SumLinked List.pdf.pdf
- 11. Maximum Element in a Linked List.mp4
- 12. Let's Code Max for Linked List.mp4
- 12.1 69. Max LL.pdf.pdf
- 13. Searching in a Linked List.mp4
- 14. Improve Searching in Linked List.mp4
- 15. Let's Code Searching in Linked List.mp4
- 15.1 70. Search LL.pdf.pdf
- 16. Inserting in a Linked List.mp4
- 17. Let's Code Insert for Linked List.mp4
- 17.1 73. Insert in LL.pdf.pdf
- 29. Reversing using Sliding Pointers.mp4
- 3. More About Linked List.mp4
- 30. Recursive Reverse for Linked List.mp4
- 31. Let's Code Reversing a Linked List.mp4
- 31.1 74. Reverse LL.pdf.pdf
- 32. Concatenating 2 Linked Lists.mp4
- 33. Merging 2 Linked Lists.mp4
- 34. Let's Code to Concatenate and Merge Linked Lists.mp4
- 42. Let's Code Insert for a Circular Linked List.mp4
- 43. Deleting From Circular Linked List.mp4
- 44. Let's Code for Circular Linked List.mp4
- 44.1 88. Circluar Linked List.pdf.pdf
- 45. Doubly Linked List.mp4
- 46. Let's Code Doubly Linked List.mp4
- 47. Insert in a Doubly Linked List.mp4
- 48. Let's Code Insert for Doubly Linked List.mp4
- 49. Deleting from Doubly Linked List.mp4
- 5. Let's Code Display for Linked List.mp4
- 5.1 66. Create and Display LL.pdf.pdf
- 50. Let's Code Delete for Doubly Linked List.mp4
- 19. Creating a Linked List by Inserting at Last.mp4
- 2. About Linked List.mp4
- 20. Inserting in a Sorted Linked List.mp4
- 21. Let's Code Insert in Sorted Linked List.mp4
- 21.1 74. SortedInsert LL.pdf.pdf
- 21.2 74. Create LL using Insert.pdf.pdf
- 52. Let's Code Reverse for Doubly Linked List.mp4
- 52.1 91. Doubly Linked List.pdf.pdf
- 53. Circular Doubly Linked List.mp4
- 54. Comparison of Linked List.mp4
- 55. Comparison of Array with Linked List.mp4
- 56. Student Challenge Finding Middle Element of a Linked List..mp4
- 34.1 74. Merge LL.pdf.pdf
- 35. Check for LOOP in Linked List.mp4
- 36. Let's Code to Check LOOP.mp4
- 36.1 74. isLoop LL.pdf.pdf
- 37. Let's Code a C++ class for Linked List.mp4
- 37.1 84. LinkedList CPP.pdf.pdf
- 38. Circular Linked List.mp4
- 39. Display Circular Linked List.mp4
- 4. Display Linked List.mp4
- 40. Le's Code Circular Linked List.mp4
- 18. Creating a Linked List using Insert.mp4
- 22. Deleting from Linked List.mp4
- 28. Reversing a Linked List.mp4
- 41. Inserting in a Circular Linked List.mp4
- 51. Reverse a Doubly Linked List.mp4
- 23. Let's Code Delete on Linked List.mp4
- 23.1 74. Deleteing LL.pdf.pdf
- 24. Check if a Linked List is Sorted.mp4
- 25. Let's Code to check if Linked List is Sorted.mp4
- 25.1 74. isSorted LL.pdf.pdf
- 26. Remove Duplicates from Linked List.mp4
- 27. Let's Code to Remove Duplicates from Linked List.mp4
- 27.1 74. Remove Duplicate LL.pdf.pdf
- 57. Student Challenge Finding Intersecting point of Two Linked List.mp4
- 58. Linked List.html
- 6. Recursive Display of Linked List.mp4
- 7. Le's Code Recursive Display for Linked List.mp4
- 7.1 66. Create and Display LL.pdf.pdf
- 8. Counting Nodes in a Linked List.mp4
- 9. Sum of All Elements in a Linked List.mp4
- 12. Sparse Matrix and Polynomial using Linked List
- 1. Student Challenge Sparse Matrix using Linked List.mp4
- 2. Student Challenge Polynomial Representation using Linked List.mp4
- 3. Let's Code Polynomial.mp4
- 3.1 96. Polynomial Linked List.pdf.pdf
- 13. Stack
- 18.1 110. InToPost.pdf.pdf
- 3. Implementation os Stack using Array.mp4
- 1. Introduction to Stack.mp4
- 10. Program for Parenthesis Matching.mp4
- 11. Let's Code Parenthesis Matching.mp4
- 11.1 103. Parantheses Matching.pdf.pdf
- 12. More on Parenthesis Matching.mp4
- 13. Infix to Postfix Conversion.mp4
- 14. Associativity and Unary Operators.mp4
- 15. Infix to Postfix using Stack Method 1.mp4
- 16. Infix to Postfix using Stack Method 2.mp4
- 17. Program for Infix to Postfix Conversion.mp4
- 18. Let's Code Infix to Postfix Conversion.mp4
- 19. Student Challenge Infix to Postfix with Associativity and Parenthesis.mp4
- 2. Stack using Array.mp4
- 20. Evaluation of Postfix Expression.mp4
- 21. Program for Evaluation of Postfix.mp4
- 22. Let's Code Evaluation of Postfix.mp4
- 22.1 113. Evaulation Postfix.pdf.pdf
- 23. Stack.html
- 4. Let's Code Stack using Array.mp4
- 4.1 101. Stack Array CPP.pdf.pdf
- 4.2 100. Stack Array.pdf.pdf
- 5. Stack using Linked List.mp4
- 6. Stack Operations using Linked List.mp4
- 7. Let's Code Stack using Linked List.mp4
- 7.1 101. Stack LL C.pdf.pdf
- 8. Let's Code C++ class for Stack using Linked List.mp4
- 8.1 101. Stack Linked List CPP.pdf.pdf
- 9. Parenthesis Matching.mp4
- 14. Queues
- 4. Implementing Queue using Array.mp4
- 1. Queue ADT.mp4
- 10. Queue using Linked List.mp4
- 11. Let's Code Queue using Linked List.mp4
- 11.1 120. Queue LL.pdf.pdf
- 12. Double Ended Queue DEQUEUE.mp4
- 13. Priority Queues.mp4
- 14. Queue using 2 Stacks.mp4
- 15. Queue.html
- 2. Queue using Single Pointer.mp4
- 3. Queue using Two Pointers.mp4
- 5. Let's Code Queue using Array.mp4
- 5.1 117. Queue using Array C.pdf.pdf
- 6. Let's Code Queue in C++.mp4
- 6.1 118. Queue CPP.pdf.pdf
- 7. Drawback of Queue using Array.mp4
- 8. Circular Queue.mp4
- 9. Let's Code Circular Queue.mp4
- 9.1 119. Circular Queue.pdf.pdf
- 15. Trees
- 17. Binary Tree Traversal Easy Method 3.mp4
- 23. Inorder Tree Traversals Functions.mp4
- 31. Height and Count of Binary Tree.mp4
- 1. Terminology.mp4
- 10. Representation of Binary Tree.mp4
- 11. Linked Representation of Binary Tree.mp4
- 12. Full vs Complete Binary Tree.mp4
- 13. Strict vs Complete Binary Tree.mp4
- 14. Binary Tree Traversals.mp4
- 15. Binary Tree Traversal Easy Method 1.mp4
- 16. Binary Tree Traversal Easy Method 2.mp4
- 24. Iterative Preorder.mp4
- 25. Iterative Inorder.mp4
- 26. Let's Code Iterative Traversals.mp4
- 26.1 Tree Traversals Iterative.pdf.pdf
- 27. Level Order Traversal.mp4
- 28. Let's Code Level Order Traversal.mp4
- 28.1 Tree Level Order Traversal.pdf.pdf
- 29. Can we Generate Tree from Traversals.mp4
- 3. Height vs Nodes in Binary Tree.mp4
- 30. Generating Tree from Traversals.mp4
- 32. Let's Code Height and Count.mp4
- 32.1 Tree Count and Height.pdf.pdf
- 33. Student Challenge Count Leaf Nodes of a Binary Tree.mp4
- 34. Binary Trees.html
- 4. Internal Nodes vs External Nodes in Binary Tree.mp4
- 5. Strict Binary Tree.mp4
- 6. Height vs Node of String Binary Tree.mp4
- 7. Internal vs External Nodes of Strict Binary Trees.mp4
- 8. n-ary Trees.mp4
- 9. Analysis of n-Ary Trees.mp4
- 18. Creating Binary Tree.mp4
- 19. Program to Create Binary Tree.mp4
- 2. Number of Binary Trees using N Nodes.mp4
- 20. Let's Code Creating Binary Tree.mp4
- 20.1 146. Tree.pdf.pdf
- 21. Let's Code Creating Binary Tree in C++.mp4
- 21.1 142. TreeCpp.pdf.pdf
- 22. Preorder Tree Traversal.mp4
- 16. Binary Search Trees
- 5. Creating a Binary Search Tree.mp4
- 1. BST intro.mp4
- 10. Program for Generating BST from Preorder.mp4
- 11. Drawbacks of Binary Search Tree.mp4
- 12. Binary Search Trees.html
- 2. Searching in a Binary Search Tree.mp4
- 3. Inserting in a Binary Search Tree.mp4
- 4. Recursive Insert in Binary Search Tree.mp4
- 6. Let's code Binary Search Tree.mp4
- 6.1 BST Insert Search.pdf.pdf
- 7. Deleting from Binary Search Tree.mp4
- 8. Let's Code Recursive Insert and Delete on BST.mp4
- 8.1 154. BST Insert Delete.pdf.pdf
- 9. Generating BST from Preorder.mp4
- 17. AVL Trees
- 1. Introduction to AVL Trees.mp4
- 2. Inserting in AVL with Rotations.mp4
- 3. General form of AVL Rotations.mp4
- 4. Let's Code LL Rotation on AVL.mp4
- 5. Let's Code LR Rotation on AVL.mp4
- 5.1 158. AVL #2.pdf.pdf
- 6. Generating AVL Tree.mp4
- 7. Deletion from AVL Tree with Rotations.mp4
- 8. Height Analysis of AVL Trees.mp4
- 18. Search Trees
- 1. 2-3 Trees.mp4
- 2. 2-3-4 Trees.mp4
- 3. Re-Black Trees Introduction.mp4
- 4. Red-Black Tree creation.mp4
- 5. Red-Black Trees vs 2-3-4 Trees.mp4
- 6. Creating Red-Black Tree similar to Creating 2-3-4 Tree.mp4
- 7. Red-Black Tree Deletion Cases.mp4
- 8. Red-Black Tree Deletion Examples.mp4
- 9. Red-Black Tree vs 2-3-4 Tree Deletion.mp4
- 19. Heap
- 1. Introduction to Heap.mp4
- 2. Inserting in a Heap.mp4
- 3. Program to Insert in a Heap.mp4
- 4. Creating a Heap.mp4
- 5. Deleting from Heap and Heap Sort.mp4
- 6. Let's Code Heap Sort.mp4
- 7. Heapify - Faster Method for creating Heap.mp4
- 8. Heap as Priority Queue.mp4
- 20. Sorting Techniques
- 1. Criteria used for Analysing Sorts.mp4
- 10. Selection Sort.mp4
- 11. Program for Selection Sort.mp4
- 12. Analysis of Selection Sort.mp4
- 13. Let's Code Selection Sort.mp4
- 13.1 177. Selection Sort.pdf.pdf
- 14. Idea behind Quick Sort.mp4
- 15. Quick Sort.mp4
- 16. Analysis of Quick Sort.mp4
- 17. Analysis of Quick Sort Continued......mp4
- 18. Let's Code Quick Sort.mp4
- 18.1 179. Quick Sort.pdf.pdf
- 25. Let's Code Count Sort.mp4
- 25.1 187. Count Sort.pdf.pdf
- 26. Bin Bucket Sort.mp4
- 27. Radix Sort.mp4
- 28. Shell Sort.mp4
- 29. Let's Code Shell Sort.mp4
- 29.1 191. Shell Sort.pdf.pdf
- 3. Let's Code Bubble Sort.mp4
- 2. Bubble Sort.mp4
- 20. Iterative Merge Sort.mp4
- 21. Let's Code Iterative Merge Sort.mp4
- 21.1 185. Iterative Merge Sort.pdf.pdf
- 22. Recursive Merge Sort.mp4
- 23. Let's Code Recursive Merge Sort.mp4
- 23.1 186. Recursive Merge Sort.pdf.pdf
- 4. Insertion Sort.mp4
- 5. Insertion Sort Continued.....mp4
- 6. Program for Insertion Sort.mp4
- 7. Analysis of Insertion Sort.mp4
- 8. Let's Code Insertion Sort.mp4
- 8.1 171. Insertion Sort.pdf.pdf
- 9. Comparing Bubble and Insertion Sort.mp4
- 19. Merging.mp4
- 24. Count Sort.mp4
- 3.1 170. Bubble Sort.pdf.pdf
- 21. Hashing Technique
- 1. Introduction to Hashing.mp4
- 2. Chaining.mp4
- 3. Let's Code Chaining.mp4
- 3.1 Chaining.pdf.pdf
- 4. Linear Probing.mp4
- 5. Let's Code Linear Probing.mp4
- 5.1 Linear Probing.pdf.pdf
- 6. Quadratic Probing.mp4
- 7. Double Hashing.mp4
- 8. Hash Function Ideas.mp4
- 9. Hashing.html
- 22. Graphs
- 16.1 Kruskals.pdf.pdf
- 1. Introduction to Graphs.mp4
- 10. Prim's Minimum Cost Spanning Tree.mp4
- 11. Prim's Program.mp4
- 12. Let's Code Prim's using.mp4
- 12.1 Prims.pdf.pdf
- 13. Kruskal's Minimum Cost Spanning Tree.mp4
- 14. Disjoint Subsets.mp4
- 15. Kruskal's Program.mp4
- 16. Let's Code Kruskla's Program.mp4
- 17. Graphs.html
- 2. Representation of Undirected Graph.mp4
- 3. Representation of Directed Graphs.mp4
- 4. Breadth First Search.mp4
- 5. Program for BFS.mp4
- 6. Depth First Search.mp4
- 7. Program for DFS.mp4
- 8. Let's Code BFS & DFS.mp4
- 8.1 Graph BFS DFS.pdf.pdf
- 9. Spanning Trees.mp4
- 23. Asymptotic Notations
- 1. Asymptotic Notations Big Oh , Omega , Theta.mp4
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement