| 1. Installing Code Blocks | |||
| 1. Installing Code Blocks - 1-en_US.srt | 9.36 KB | ||
| 1. Installing Code Blocks - 1.mp4 | 31.82 MB | ||
| 2. Installing Code Blocks - 2-en_US.srt | 8.87 KB | ||
| 2. Installing Code Blocks - 2.mp4 | 65.9 MB | ||
| 10. Binary Search Algorithm | |||
| 1. Linear Search Algorithm ( Explain + Code )-en_US.srt | 19.26 KB | ||
| 1. Linear Search Algorithm ( Explain + Code ).mp4 | 48.87 MB | ||
| 1.1-linear-search.txt.txt | 533 B | ||
| 2. Problem with Linear Search-en_US.srt | 3.05 KB | ||
| 2. Problem with Linear Search.mp4 | 5.42 MB | ||
| 3. Binary Search Algorithm (Explain)-en_US.srt | 21.39 KB | ||
| 3. Binary Search Algorithm (Explain).mp4 | 102.42 MB | ||
| 3.1-binary-search.txt.txt | 772 B | ||
| 4. Binary Search Algorithm (Code)-en_US.srt | 18.26 KB | ||
| 4. Binary Search Algorithm (Code).mp4 | 56.39 MB | ||
| 4.2-binary-search.txt.txt | 772 B | ||
| 11. Recursion - 1 Basics | |||
| 1. Introduction to recursion-en_US.srt | 31.16 KB | ||
| 1. Introduction to recursion.mp4 | 212.37 MB | ||
| 10. Geometric Sum-en_US.srt | 11.52 KB | ||
| 10. Geometric Sum.mp4 | 64.34 MB | ||
| 2. Recursion and PMI-en_US.srt | 21.36 KB | ||
| 2. Recursion and PMI.mp4 | 56.84 MB | ||
| 3. Fibonacci Number-en_US.srt | 14.2 KB | ||
| 3. Fibonacci Number.mp4 | 50.81 MB | ||
| 4. Power-en_US.srt | 7.87 KB | ||
| 4. Power.mp4 | 43.22 MB | ||
| 5. Print Numbers-en_US.srt | 20.35 KB | ||
| 5. Print Numbers.mp4 | 73.51 MB | ||
| 6. Numbers of Digits-en_US.srt | 15.16 KB | ||
| 6. Numbers of Digits.mp4 | 47.01 MB | ||
| 7. Sum of Digits-en_US.srt | 12.51 KB | ||
| 7. Sum of Digits.mp4 | 33.69 MB | ||
| 8. Multiplication-en_US.srt | 12.91 KB | ||
| 8. Multiplication.mp4 | 32.5 MB | ||
| 9. Count Zeroes-en_US.srt | 12.29 KB | ||
| 9. Count Zeroes.mp4 | 29.32 MB | ||
| Fibonaci.txt | 366 B | ||
| Geometric-Sum.txt | 278 B | ||
| count-zeroes.txt | 378 B | ||
| count.txt | 276 B | ||
| factorial.txt | 350 B | ||
| multiplication.txt | 323 B | ||
| power.txt | 288 B | ||
| print-numbers.txt | 517 B | ||
| sum-of-digits.txt | 323 B | ||
| 12. Recursion - 2 Intermediate | |||
| 1-Check-if-Array-is-sorted.txt | 871 B | ||
| 1. Check if Array is sorted-en_US.srt | 37.01 KB | ||
| 1. Check if Array is sorted.mp4 | 109.74 MB | ||
| 10-Check-Palindrome.txt | 316 B | ||
| 10. Check Palindrome-en_US.srt | 16.06 KB | ||
| 10. Check Palindrome.mp4 | 69.95 MB | ||
| 2-Sum-of-Array.txt | 500 B | ||
| 2. Sum of Array-en_US.srt | 24.96 KB | ||
| 2. Sum of Array.mp4 | 77.13 MB | ||
| 3. Check if element is present-en_US.srt | 38.87 KB | ||
| 3. Check if element is present.mp4 | 246.1 MB | ||
| 4-First-Index-of-element.txt | 299 B | ||
| 4. First Index of element-en_US.srt | 12.34 KB | ||
| 4. First Index of element.mp4 | 33.86 MB | ||
| 5-Last-Index-of-element.txt | 784 B | ||
| 5. Last Index of element-en_US.srt | 36.39 KB | ||
| 5. Last Index of element.mp4 | 115.06 MB | ||
| 6-Print-All-position-of-element.txt | 281 B | ||
| 6. Print All position of element-en_US.srt | 6.76 KB | ||
| 6. Print All position of element.mp4 | 17.14 MB | ||
| 7-Count-Occurence-of-element-First-Approach.txt | 495 B | ||
| 7. Count Occurrence of element- First Approach-en_US.srt | 5.72 KB | ||
| 7. Count Occurrence of element- First Approach.mp4 | 16.68 MB | ||
| 8-Count-Occurence-of-element-Second-Approach.txt | 505 B | ||
| 8. Count Occurrence of element- Second Approach-en_US.srt | 6.07 KB | ||
| 8. Count Occurrence of element- Second Approach.mp4 | 24.55 MB | ||
| 9-Store-All-Position-of-element.txt | 1007 B | ||
| 9. Store All Position of element-en_US.srt | 18.87 KB | ||
| 9. Store All Position of element.mp4 | 84.14 MB | ||
| 13. Recursion - 3 Advanced | |||
| 1-print-and-reverse-print.txt | 404 B | ||
| 1. Print and Reverse Print Recursively-en_US.srt | 9.45 KB | ||
| 1. Print and Reverse Print Recursively.mp4 | 35.56 MB | ||
| 10-Staircase-Problem.txt | 337 B | ||
| 10. Staircase Problem-en_US.srt | 15.47 KB | ||
| 10. Staircase Problem.mp4 | 38.45 MB | ||
| 11-Tower-of-Hanoi.txt | 212 B | ||
| 11. Tower of Hanoi-en_US.srt | 12.4 KB | ||
| 11. Tower of Hanoi.mp4 | 31.4 MB | ||
| 12-Print-Steps-in-Tower-of-Hanoi.txt | 445 B | ||
| 12. Print Steps in Tower of Hanoi-en_US.srt | 11.96 KB | ||
| 12. Print Steps in Tower of Hanoi.mp4 | 95.24 MB | ||
| 2-Length-Recursively.txt | 269 B | ||
| 2. Length Recursively-en_US.srt | 5.94 KB | ||
| 2. Length Recursively.mp4 | 17.05 MB | ||
| 3-Replace-Character-Recursively.txt | 514 B | ||
| 3. Replace Character Recursively-en_US.srt | 8.5 KB | ||
| 3. Replace Character Recursively.mp4 | 41.69 MB | ||
| 4-Remove-Character.txt | 614 B | ||
| 4. Remove Character Recursively-en_US.srt | 12.01 KB | ||
| 4. Remove Character Recursively.mp4 | 37.86 MB | ||
| 5-Remove-Consecutive-Duplicates.txt | 729 B | ||
| 5. Remove Consecutive Duplicates-en_US.srt | 11.92 KB | ||
| 5. Remove Consecutive Duplicates.mp4 | 36.62 MB | ||
| 6-Print-All-Subsequences-of-String.txt | 833 B | ||
| 6. Print All Subsequences of String-en_US.srt | 24.74 KB | ||
| 6. Print All Subsequences of String.mp4 | 81.04 MB | ||
| 7-Store-All-Subsequences-of-String.txt | 535 B | ||
| 7. Store All Subsequences of String-en_US.srt | 3.3 KB | ||
| 7. Store All Subsequences of String.mp4 | 20.58 MB | ||
| 8-Convert-String-to-Integer.txt | 539 B | ||
| 8. Convert String to Integer-en_US.srt | 15.39 KB | ||
| 8. Convert String to Integer.mp4 | 44.31 MB | ||
| 9-Print-All-Permutation-of-String.txt | 371 B | ||
| 9. Print All Permutation of String-en_US.srt | 12.94 KB | ||
| 9. Print All Permutation of String.mp4 | 41.12 MB | ||
| 14. Merge Sort & Quick Sort | |||
| 1-Merge-Sort-Introduction.txt | 232 B | ||
| 1-Quick-Sort-Introduction.txt | 283 B | ||
| 1. Merge Sort Introduction-en_US.srt | 19.09 KB | ||
| 1. Merge Sort Introduction.mp4 | 76.47 MB | ||
| 2-Merge-Sort-Solution.txt | 1.98 KB | ||
| 2-Quick-Sort-Solution.txt | 484 B | ||
| 2. Merge Sort Solution-en_US.srt | 20.36 KB | ||
| 2. Merge Sort Solution.mp4 | 74.16 MB | ||
| 3-Quick-Sort-Checking.txt | 594 B | ||
| 3. Quick Sort Introduction-en_US.srt | 19.28 KB | ||
| 3. Quick Sort Introduction.mp4 | 52.95 MB | ||
| 4. Quick Sort Solution-en_US.srt | 13.88 KB | ||
| 4. Quick Sort Solution.mp4 | 48.52 MB | ||
| 5. Quick Sort Testing-en_US.srt | 2.17 KB | ||
| 5. Quick Sort Testing.mp4 | 11.96 MB | ||
| 15. Time Space Complexity Analysis | |||
| 1-Experimental-Analysis.txt | 1.86 KB | ||
| 1. Experimental Analysis-en_US.srt | 18.69 KB | ||
| 1. Experimental Analysis.mp4 | 119.54 MB | ||
| 10. Fibonacci Space Complexity-en_US.srt | 5.69 KB | ||
| 10. Fibonacci Space Complexity.mp4 | 14.59 MB | ||
| 2. Theoretical Analysis-en_US.srt | 20.53 KB | ||
| 2. Theoretical Analysis.mp4 | 79.52 MB | ||
| 3. Linear Search Time Complexity-en_US.srt | 4.73 KB | ||
| 3. Linear Search Time Complexity.mp4 | 8.74 MB | ||
| 4. Selection Sort Time Complexity-en_US.srt | 6.59 KB | ||
| 4. Selection Sort Time Complexity.mp4 | 14.29 MB | ||
| 5. Theoretical Analysis Recursive Algorithm-en_US.srt | 15.32 KB | ||
| 5. Theoretical Analysis Recursive Algorithm.mp4 | 49.07 MB | ||
| 6. Merge Sort Time Complexity-en_US.srt | 9.17 KB | ||
| 6. Merge Sort Time Complexity.mp4 | 28.85 MB | ||
| 7. Fibonacci Time Complexity-en_US.srt | 16.53 KB | ||
| 7. Fibonacci Time Complexity.mp4 | 68.98 MB | ||
| 8. Space Complexity Analysis-en_US.srt | 23.37 KB | ||
| 8. Space Complexity Analysis.mp4 | 97.23 MB | ||
| 9. Merge Sort Space Complexity-en_US.srt | 7.44 KB | ||
| 9. Merge Sort Space Complexity.mp4 | 19.68 MB | ||
| 16. Advanced Binary Search | |||
| 1. Find First & Last Occurence-en_US.srt | 30.98 KB | ||
| 1. Find First & Last Occurence.mp4 | 139.95 MB | ||
| 15-Search-in-Rotated-Sorted-Array.txt | 771 B | ||
| 2. Search in Rotated Sorted Array-en_US.srt | 24.63 KB | ||
| 2. Search in Rotated Sorted Array.mp4 | 170.67 MB | ||
| 17. Algorithm Moore Voting Majority Element | |||
| 1. Majority Element-en_US.srt | 36.79 KB | ||
| 1. Majority Element.mp4 | 285.66 MB | ||
| 43-majority-element.txt | 782 B | ||
| 18. What are Data Structures | |||
| 1. Introduction-en_US.srt | 2.78 KB | ||
| 1. Introduction.mp4 | 7.67 MB | ||
| 19. DS Linked List - 1 | |||
| 1. What is Linked List-en_US.srt | 22.74 KB | ||
| 1. What is Linked List.mp4 | 57.28 MB | ||
| 10. Solution with Memory Leak Delete ith Node-en_US.srt | 27.46 KB | ||
| 10. Solution with Memory Leak Delete ith Node.mp4 | 99.25 MB | ||
| 11-deleteithNode-solution-with-memory-leak.txt | 3.64 KB | ||
| 11. Solution without Memory Leak Delete ith Node-en_US.srt | 14.54 KB | ||
| 11. Solution without Memory Leak Delete ith Node.mp4 | 52.68 MB | ||
| 12deleteithNode-solution-without-memory-leak.txt | 3.79 KB | ||
| 2-What-is-LinkedList.txt | 381 B | ||
| 2. Print a Linked List-en_US.srt | 36.95 KB | ||
| 2. Print a Linked List.mp4 | 242.75 MB | ||
| 3-Print-a-Linked-List.txt | 1.04 KB | ||
| 3. Taking Input - 1-en_US.srt | 36.99 KB | ||
| 3. Taking Input - 1.mp4 | 118.48 MB | ||
| 4-takeInput.txt | 1.52 KB | ||
| 4. Taking Input - 2-en_US.srt | 12.81 KB | ||
| 4. Taking Input - 2.mp4 | 47.61 MB | ||
| 5-takeInput2.txt | 2.02 KB | ||
| 5. Length-en_US.srt | 15.86 KB | ||
| 5. Length.mp4 | 52.16 MB | ||
| 6-length.txt | 2.18 KB | ||
| 6. Print ith Node-en_US.srt | 32.12 KB | ||
| 6. Print ith Node.mp4 | 118.84 MB | ||
| 7-printIthNode.txt | 2.56 KB | ||
| 7. Question Insert Node at ith position-en_US.srt | 9.72 KB | ||
| 7. Question Insert Node at ith position.mp4 | 29.93 MB | ||
| 8. Solution Insert Node at ith position-en_US.srt | 33.95 KB | ||
| 8. Solution Insert Node at ith position.mp4 | 126.86 MB | ||
| 9-insert-node-at-ith-position.txt | 3.26 KB | ||
| 9. Question Delete ith Node-en_US.srt | 7 KB | ||
| 9. Question Delete ith Node.mp4 | 18.32 MB | ||
| 2. DS Arrays | |||
| 1. Arrays Introduction-en_US.srt | 26.88 KB | ||
| 1. Arrays Introduction.mp4 | 354.91 MB | ||
| 1.1-array-intro.txt.txt | 563 B | ||
| 2. Problem Sum of Array Elements-en_US.srt | 6.86 KB | ||
| 2. Problem Sum of Array Elements.mp4 | 18.23 MB | ||
| 2.1-sum-of-array.txt.txt | 410 B | ||
| 3. Problem Largest Element in Array-en_US.srt | 14.63 KB | ||
| 3. Problem Largest Element in Array.mp4 | 39.85 MB | ||
| 3.1-largest-in-array.txt.txt | 570 B | ||
| 4. Problem Swap 2 numbers-en_US.srt | 10.42 KB | ||
| 4. Problem Swap 2 numbers.mp4 | 27.16 MB | ||
| 4.1-swap-2-numbers.txt.txt | 403 B | ||
| 5. Problem Print Array in Reverse Order-en_US.srt | 5.02 KB | ||
| 5. Problem Print Array in Reverse Order.mp4 | 17.09 MB | ||
| 5.1-reverse-print.txt.txt | 416 B | ||
| 6. Problem Reverse Array-en_US.srt | 9.71 KB | ||
| 6. Problem Reverse Array.mp4 | 111.83 MB | ||
| 6.1-reverse-array.txt.txt | 544 B | ||
| 7. Segmentation Fault in Array-en_US.srt | 4.38 KB | ||
| 7. Segmentation Fault in Array.mp4 | 9.03 MB | ||
| 7.1-runtime.txt.txt | 115 B | ||
| 20. DS Linked List - 2 | |||
| 1-length-recursive.txt | 3.89 KB | ||
| 1. Length - recursive-en_US.srt | 10.98 KB | ||
| 1. Length - recursive.mp4 | 31.37 MB | ||
| 10. Doubly Linked List-en_US.srt | 9.67 KB | ||
| 10. Doubly Linked List.mp4 | 38.42 MB | ||
| 11. Circular Singly Linked List-en_US.srt | 11.83 KB | ||
| 11. Circular Singly Linked List.mp4 | 30.77 MB | ||
| 12. Circular Doubly Linked List-en_US.srt | 11.81 KB | ||
| 12. Circular Doubly Linked List.mp4 | 48.19 MB | ||
| 2-find-element.txt | 4.24 KB | ||
| 2. Search in Linked List-en_US.srt | 8.38 KB | ||
| 2. Search in Linked List.mp4 | 36.3 MB | ||
| 3-find-element-recursive.txt | 4.4 KB | ||
| 3. Search in Linked List - Recursive-en_US.srt | 11.22 KB | ||
| 3. Search in Linked List - Recursive.mp4 | 32.01 MB | ||
| 4-middle-point-of-LL.txt | 555 B | ||
| 4. Middle Node of List - Slow and Fast Pointer Approach-en_US.srt | 24.65 KB | ||
| 4. Middle Node of List - Slow and Fast Pointer Approach.mp4 | 91.39 MB | ||
| 5. Reverse a Linked List-en_US.srt | 9.43 KB | ||
| 5. Reverse a Linked List.mp4 | 37.79 MB | ||
| 6-remove-kth-node-from-end-of-ll.txt | 759 B | ||
| 6. Remove nth Node from end of list-en_US.srt | 34.12 KB | ||
| 6. Remove nth Node from end of list.mp4 | 186.69 MB | ||
| 7-merge-two-sorted-LL.txt | 1.09 KB | ||
| 7. Merge 2 sorted List-en_US.srt | 19.5 KB | ||
| 7. Merge 2 sorted List.mp4 | 90.93 MB | ||
| 8-merge-two-sorted-LL-recursive.txt | 623 B | ||
| 8. Merge 2 sorted List (Recursive)-en_US.srt | 8.33 KB | ||
| 8. Merge 2 sorted List (Recursive).mp4 | 25.75 MB | ||
| 9-merge-sort-LL.txt | 2.03 KB | ||
| 9. Merge Sort on Linked List-en_US.srt | 23.41 KB | ||
| 9. Merge Sort on Linked List.mp4 | 176.28 MB | ||
| GetFreeCourses.Co.url | 116 B | ||
| 21. DS Stacks | |||
| 1. Stack Introduction-en_US.srt | 19.45 KB | ||
| 1. Stack Introduction.mp4 | 38.11 MB | ||
| 10. Balanced Parenthesis-en_US.srt | 26.29 KB | ||
| 10. Balanced Parenthesis.mp4 | 202.15 MB | ||
| 11. Evaluate Reverse Polish Notation-en_US.srt | 28.74 KB | ||
| 11. Evaluate Reverse Polish Notation.mp4 | 272.99 MB | ||
| 12-remove-all-adjacent-duplicates.txt | 1.05 KB | ||
| 12. Remove All Adjacent Duplicates-en_US.srt | 34.09 KB | ||
| 12. Remove All Adjacent Duplicates.mp4 | 303.3 MB | ||
| 2-Stack-Implementation-using-Array-Part-1.txt | 607 B | ||
| 2. Stack Implementation using Array Part-1-en_US.srt | 15.24 KB | ||
| 2. Stack Implementation using Array Part-1.mp4 | 72.45 MB | ||
| 3-Stack-Implementation-using-Array-Part-2.txt | 1.62 KB | ||
| 3. Stack Implementation using Array Part-2-en_US.srt | 23.27 KB | ||
| 3. Stack Implementation using Array Part-2.mp4 | 147.94 MB | ||
| 4-Dynamic-Stack.txt | 1.48 KB | ||
| 4. Dynamic Stack-en_US.srt | 14.56 KB | ||
| 4. Dynamic Stack.mp4 | 52.74 MB | ||
| 5-templates.txt | 936 B | ||
| 5. Templates-en_US.srt | 41.86 KB | ||
| 5. Templates.mp4 | 150.83 MB | ||
| 6-Stack-using-templates.txt | 1.5 KB | ||
| 6. Stack using Templates-en_US.srt | 13.41 KB | ||
| 6. Stack using Templates.mp4 | 44.69 MB | ||
| 7-Stack-using-LL-introduction.txt | 619 B | ||
| 7-valid-paranthesis.txt | 957 B | ||
| 7. Stack using LL Introduction-en_US.srt | 29.61 KB | ||
| 7. Stack using LL Introduction.mp4 | 104.02 MB | ||
| 8-Stack-using-LL-solution.txt | 1.32 KB | ||
| 8-evaluate-reverse-polish-notation.txt | 1.14 KB | ||
| 8. Stack using LL Solution-en_US.srt | 16.12 KB | ||
| 8. Stack using LL Solution.mp4 | 55.95 MB | ||
| 9-Inbuilt-Stack.txt | 431 B | ||
| 9. Inbuilt Stack-en_US.srt | 11.52 KB | ||
| 9. Inbuilt Stack.mp4 | 58.18 MB | ||
| 22. DS Queues | |||
| 1. Queue Introduction-en_US.srt | 10.55 KB | ||
| 1. Queue Introduction.mp4 | 22.85 MB | ||
| 2. Queue using Array Introduction-en_US.srt | 30.2 KB | ||
| 2. Queue using Array Introduction.mp4 | 109.1 MB | ||
| 3-Queue-using-Array-Code.txt | 1.83 KB | ||
| 3. Queue using Array Code-en_US.srt | 49.06 KB | ||
| 3. Queue using Array Code.mp4 | 172.21 MB | ||
| 4-Dynamic-Queue.txt | 2.04 KB | ||
| 4. Dynamic Queue-en_US.srt | 21.33 KB | ||
| 4. Dynamic Queue.mp4 | 79.09 MB | ||
| 5-Queue-using-LL-introduction.txt | 961 B | ||
| 5. Queue using LL Introduction-en_US.srt | 17.21 KB | ||
| 5. Queue using LL Introduction.mp4 | 50.83 MB | ||
| 6-Queue-using-LL-solution.txt | 1.5 KB | ||
| 6. Queue using LL Solution-en_US.srt | 18.11 KB | ||
| 6. Queue using LL Solution.mp4 | 61.78 MB | ||
| 7-Inbuilt-Queue.txt | 458 B | ||
| 7. Inbuilt Queue-en_US.srt | 10.42 KB | ||
| 7. Inbuilt Queue.mp4 | 54.61 MB | ||
| 8-Reverse-a-queue.txt | 453 B | ||
| 8. Reverse a queue-en_US.srt | 12.37 KB | ||
| 8. Reverse a queue.mp4 | 75.34 MB | ||
| 23. DS Generic Trees | |||
| 1. Trees Introduction-en_US.srt | 12.9 KB | ||
| 1. Trees Introduction.mp4 | 36.97 MB | ||
| 10-Height-of-a-Tree.txt | 3.03 KB | ||
| 10. Height of a Tree-en_US.srt | 16.69 KB | ||
| 10. Height of a Tree.mp4 | 45.82 MB | ||
| 11-Print-All-Nodes-at-Level-K.txt | 3.31 KB | ||
| 11. Print All Nodes at Level K-en_US.srt | 16.45 KB | ||
| 11. Print All Nodes at Level K.mp4 | 46.12 MB | ||
| 12-Count-Leaf-Nodes.txt | 4.34 KB | ||
| 12. Count Leaf Nodes-en_US.srt | 29.99 KB | ||
| 12. Count Leaf Nodes.mp4 | 131.51 MB | ||
| 13-PreOrder-Traversal.txt | 4.9 KB | ||
| 13. PreOrder Traversal-en_US.srt | 14.01 KB | ||
| 13. PreOrder Traversal.mp4 | 88.1 MB | ||
| 14-PostOrder-Traversal.txt | 5.19 KB | ||
| 14. PostOrder Traversal-en_US.srt | 9.83 KB | ||
| 14. PostOrder Traversal.mp4 | 31.61 MB | ||
| 15-Delete-Tree.txt | 5.44 KB | ||
| 15. Delete Tree-en_US.srt | 10.17 KB | ||
| 15. Delete Tree.mp4 | 45.29 MB | ||
| 16-Destructor.txt | 5.58 KB | ||
| 16. Destructor-en_US.srt | 10.15 KB | ||
| 16. Destructor.mp4 | 34.23 MB | ||
| 2. Vectors-en_US.srt | 33.31 KB | ||
| 2. Vectors.mp4 | 175.08 MB | ||
| 3-TreeNode-class.txt | 460 B | ||
| 3. TreeNode Class-en_US.srt | 18.85 KB | ||
| 3. TreeNode Class.mp4 | 65.25 MB | ||
| 4-Print-Recursive.txt | 804 B | ||
| 4. Print Recursive-en_US.srt | 24.87 KB | ||
| 4. Print Recursive.mp4 | 203.68 MB | ||
| 48-vectors.txt | 1.12 KB | ||
| 5-Take-Input-Recursive.txt | 1.21 KB | ||
| 5. Take Input Recursive-en_US.srt | 23.26 KB | ||
| 5. Take Input Recursive.mp4 | 201.01 MB | ||
| 6-Take-Input-Level-Wise.txt | 1.95 KB | ||
| 6. Take Input Level Wise-en_US.srt | 40.75 KB | ||
| 6. Take Input Level Wise.mp4 | 161.83 MB | ||
| 7. Level Order Print Introduction-en_US.srt | 6.57 KB | ||
| 7. Level Order Print Introduction.mp4 | 13.41 MB | ||
| 8-Level-Order-Print-Solution.txt | 2.4 KB | ||
| 8. Level Order Print Solution-en_US.srt | 17.59 KB | ||
| 8. Level Order Print Solution.mp4 | 66.59 MB | ||
| 9-Count-Nodes.txt | 2.67 KB | ||
| 9. Count Nodes-en_US.srt | 9.92 KB | ||
| 9. Count Nodes.mp4 | 42.85 MB | ||
| 24. DS Binary Tree | |||
| 1-Binary-Tree-Introduction.txt | 541 B | ||
| 1. Binary Tree Introduction-en_US.srt | 21.45 KB | ||
| 1. Binary Tree Introduction.mp4 | 74.05 MB | ||
| 10-maxDepth-of-binary-tree.txt | 550 B | ||
| 10. Max Depth of Binary Tree-en_US.srt | 15.7 KB | ||
| 10. Max Depth of Binary Tree.mp4 | 70.73 MB | ||
| 11-Symmetric-Binary-Tree.txt | 885 B | ||
| 11. Symmetric Binary Tree-en_US.srt | 14.56 KB | ||
| 11. Symmetric Binary Tree.mp4 | 70.19 MB | ||
| 12-Find-Node.txt | 2.49 KB | ||
| 12. Find Node-en_US.srt | 8.05 KB | ||
| 12. Find Node.mp4 | 28.69 MB | ||
| 13-Min-Value.txt | 3.08 KB | ||
| 13. Min Value-en_US.srt | 23.31 KB | ||
| 13. Min Value.mp4 | 83 MB | ||
| 14-Max-Value.txt | 3.67 KB | ||
| 14. Max Value-en_US.srt | 11.31 KB | ||
| 14. Max Value.mp4 | 39.68 MB | ||
| 15-Count-Leaf-Nodes.txt | 4.36 KB | ||
| 15. Count Leaf Nodes-en_US.srt | 17.06 KB | ||
| 15. Count Leaf Nodes.mp4 | 58.55 MB | ||
| 16. Construct Tree from PreOrder and Inorder Traversal Introduction-en_US.srt | 27.54 KB | ||
| 16. Construct Tree from PreOrder and Inorder Traversal Introduction.mp4 | 86.4 MB | ||
| 17-Construct-Tree-from-PreOrder-and-Inorder-Traversal-Solution.txt | 1.61 KB | ||
| 17. Construct Tree from PreOrder and Inorder Traversal Solution-en_US.srt | 24.86 KB | ||
| 17. Construct Tree from PreOrder and Inorder Traversal Solution.mp4 | 223.43 MB | ||
| 18. Construct Tree from PostOrder and Inorder Traversal Introduction-en_US.srt | 13.81 KB | ||
| 18. Construct Tree from PostOrder and Inorder Traversal Introduction.mp4 | 76.57 MB | ||
| 19-Construct-Tree-from-PostOrder-and-Inorder-Traversal-Solution.txt | 1.65 KB | ||
| 19. Construct Tree from PostOrder and Inorder Traversal Solution-en_US.srt | 14.1 KB | ||
| 19. Construct Tree from PostOrder and Inorder Traversal Solution.mp4 | 104.09 MB | ||
| 2-Print-Tree-Recusrive.txt | 885 B | ||
| 2. Print Tree Recursive-en_US.srt | 15.02 KB | ||
| 2. Print Tree Recursive.mp4 | 44.79 MB | ||
| 20-Diameter-of-Binary-Tree.txt | 991 B | ||
| 20. Diameter of Binary Tree-en_US.srt | 26.35 KB | ||
| 20. Diameter of Binary Tree.mp4 | 169.19 MB | ||
| 21-Diameter-of-Binary-Tree-Better-Approach.txt | 1.2 KB | ||
| 21. Diameter of Binary Tree Better Approach-en_US.srt | 24.24 KB | ||
| 21. Diameter of Binary Tree Better Approach.mp4 | 100.88 MB | ||
| 22-Root-to-Node-Path.txt | 4.92 KB | ||
| 22. Root to Node Path-en_US.srt | 24.81 KB | ||
| 22. Root to Node Path.mp4 | 86.14 MB | ||
| 3-Take-Input-Recursive.txt | 1.28 KB | ||
| 3. Take Input Recursive-en_US.srt | 22.5 KB | ||
| 3. Take Input Recursive.mp4 | 69.52 MB | ||
| 4-Take-Input-Level-Wise.txt | 2.15 KB | ||
| 4. Take Input Level Wise-en_US.srt | 38.02 KB | ||
| 4. Take Input Level Wise.mp4 | 120.95 MB | ||
| 5-level-order-traversal.mp4.txt | 1.21 KB | ||
| 5. Level Order Traversal-en_US.srt | 40.27 KB | ||
| 5. Level Order Traversal.mp4 | 276.51 MB | ||
| 6-Count-Nodes.txt | 633 B | ||
| 6. Count Nodes-en_US.srt | 9.53 KB | ||
| 6. Count Nodes.mp4 | 21.72 MB | ||
| 7-inorder-traversal.txt | 687 B | ||
| 7. InOrder Traversal-en_US.srt | 14.06 KB | ||
| 7. InOrder Traversal.mp4 | 69.77 MB | ||
| 8-preorder-traversal.txt | 693 B | ||
| 8. PreOrder Traversal-en_US.srt | 11.82 KB | ||
| 8. PreOrder Traversal.mp4 | 50.39 MB | ||
| 9-postorder-traversal.txt | 661 B | ||
| 9. PostOrder Traversal-en_US.srt | 10.25 KB | ||
| 9. PostOrder Traversal.mp4 | 38.53 MB | ||
| 25. DS Binary Search Tree (BST) | |||
| 1. Introduction-en_US.srt | 20.58 KB | ||
| 1. Introduction.mp4 | 120.91 MB | ||
| 10-BST-class-Insert-Implementation.txt | 1.9 KB | ||
| 10. BST Class Insert Implementation-en_US.srt | 17.73 KB | ||
| 10. BST Class Insert Implementation.mp4 | 64 MB | ||
| 11-BST-class-How-to-Delete.txt | 2.03 KB | ||
| 11. BST Class - How to Delete-en_US.srt | 23.01 KB | ||
| 11. BST Class - How to Delete.mp4 | 109.37 MB | ||
| 12-BST-class-Delete-Implementation.txt | 3.38 KB | ||
| 12. BST Class Delete Implementation-en_US.srt | 31.36 KB | ||
| 12. BST Class Delete Implementation.mp4 | 144.82 MB | ||
| 13. Convert BST to Sorted Singly List Introduction-en_US.srt | 11.59 KB | ||
| 13. Convert BST to Sorted Singly List Introduction.mp4 | 37.08 MB | ||
| 14-Convert-BST-to-sorted-singly-list-solution.txt | 4.73 KB | ||
| 14. Convert BST to Sorted Singly List Solution-en_US.srt | 40.16 KB | ||
| 14. Convert BST to Sorted Singly List Solution.mp4 | 322.06 MB | ||
| 15. Types of Balanced BST-en_US.srt | 23.33 KB | ||
| 15. Types of Balanced BST.mp4 | 61.51 MB | ||
| 2-Search-in-BST.txt | 923 B | ||
| 2. Search in BST-en_US.srt | 11.56 KB | ||
| 2. Search in BST.mp4 | 60.17 MB | ||
| 3. Find Min in BST-en_US.srt | 6.62 KB | ||
| 3. Find Min in BST.mp4 | 14.55 MB | ||
| 4. Find Max in BST-en_US.srt | 6.74 KB | ||
| 4. Find Max in BST.mp4 | 13.18 MB | ||
| 5-Range-Sum-Of-BST.txt | 830 B | ||
| 5. Range Sum in BST-en_US.srt | 12.6 KB | ||
| 5. Range Sum in BST.mp4 | 44.24 MB | ||
| 6-Validate-Binary-Search-Tree.txt | 1.43 KB | ||
| 6. Validate BST-en_US.srt | 29.72 KB | ||
| 6. Validate BST.mp4 | 231.83 MB | ||
| 7-Convert-Sorted-Array-to-BST.txt | 982 B | ||
| 7. Convert Sorted Array to BST-en_US.srt | 10.72 KB | ||
| 7. Convert Sorted Array to BST.mp4 | 33.44 MB | ||
| 8-BST-Class-Implementation.txt | 1.33 KB | ||
| 8. BST Class Implementation-en_US.srt | 16.15 KB | ||
| 8. BST Class Implementation.mp4 | 113.16 MB | ||
| 9. BST Class - How to Insert-en_US.srt | 9.1 KB | ||
| 9. BST Class - How to Insert.mp4 | 20.41 MB | ||
| 26. DS HashMap | |||
| 1. Introduction to HashMap-en_US.srt | 30.06 KB | ||
| 1. Introduction to HashMap.mp4 | 81.27 MB | ||
| 10-Rehashing.txt | 4.06 KB | ||
| 10. Rehashing-en_US.srt | 30.48 KB | ||
| 10. Rehashing.mp4 | 274.95 MB | ||
| 2-Inbuilt-Hashmap.txt | 1017 B | ||
| 2. Inbuilt Hashmap-en_US.srt | 20.04 KB | ||
| 2. Inbuilt Hashmap.mp4 | 66.15 MB | ||
| 3-remove-duplicates.txt | 550 B | ||
| 3. Remove Duplicates-en_US.srt | 25 KB | ||
| 3. Remove Duplicates.mp4 | 63.58 MB | ||
| 4-iterators.txt | 1.51 KB | ||
| 4. Iterators-en_US.srt | 29.15 KB | ||
| 4. Iterators.mp4 | 337.47 MB | ||
| 5. Bucket Array & Hash Function-en_US.srt | 21.89 KB | ||
| 5. Bucket Array & Hash Function.mp4 | 56.32 MB | ||
| 6. Collision Handling-en_US.srt | 20.31 KB | ||
| 6. Collision Handling.mp4 | 71.53 MB | ||
| 7-HashMap-Implementation-insert.txt | 1.75 KB | ||
| 7. HashMap Implementation - Insert-en_US.srt | 39.79 KB | ||
| 7. HashMap Implementation - Insert.mp4 | 464.02 MB | ||
| 8-HashMap-Implementation-delete-search.txt | 2.65 KB | ||
| 8. HashMap Implementation - Delete & Search-en_US.srt | 15.3 KB | ||
| 8. HashMap Implementation - Delete & Search.mp4 | 106.52 MB | ||
| 9. Time Complexity & Load Factor-en_US.srt | 16.19 KB | ||
| 9. Time Complexity & Load Factor.mp4 | 108.07 MB | ||
| 27. DS Priority Queue | |||
| 1. Introduction to Priority Queue-en_US.srt | 14.94 KB | ||
| 1. Introduction to Priority Queue.mp4 | 64.17 MB | ||
| 10-remove-min-solution-and-complexity-analysis.txt | 1.87 KB | ||
| 10. Remove Min Solution & Complexity Analysis-en_US.srt | 28.75 KB | ||
| 10. Remove Min Solution & Complexity Analysis.mp4 | 239.74 MB | ||
| 11. Inplace Heap Sort-en_US.srt | 32.97 KB | ||
| 11. Inplace Heap Sort.mp4 | 111.85 MB | ||
| 12-Inplace-Heap-Sort-Solution.txt | 1.13 KB | ||
| 12. Inplace Heap Sort Solution-en_US.srt | 26.08 KB | ||
| 12. Inplace Heap Sort Solution.mp4 | 202.62 MB | ||
| 13-Inbuilt-Priority-Queue.txt | 406 B | ||
| 13. Inbuilt Priority Queue-en_US.srt | 12.62 KB | ||
| 13. Inbuilt Priority Queue.mp4 | 46.54 MB | ||
| 14. K Sorted Array-en_US.srt | 38.66 KB | ||
| 14. K Sorted Array.mp4 | 374.09 MB | ||
| 15-K-smallest-element.txt | 702 B | ||
| 15. K Smallest Element-en_US.srt | 24.12 KB | ||
| 15. K Smallest Element.mp4 | 159.64 MB | ||
| 16-Inbuilt-MIN-PQ.txt | 474 B | ||
| 16-K-smallest-using-MIN-PQ.txt | 1.02 KB | ||
| 16. Inbuilt Min Priority Queue-en_US.srt | 19.13 KB | ||
| 16. Inbuilt Min Priority Queue.mp4 | 149.01 MB | ||
| 2. Ways to implement Priority Queue-en_US.srt | 16.27 KB | ||
| 2. Ways to implement Priority Queue.mp4 | 44.69 MB | ||
| 3. Heaps Introduction-en_US.srt | 12.05 KB | ||
| 3. Heaps Introduction.mp4 | 39.86 MB | ||
| 4. CBT and its implementation-en_US.srt | 32.95 KB | ||
| 4. CBT and its implementation.mp4 | 180.11 MB | ||
| 5. Insert & Delete in Heaps-en_US.srt | 36.86 KB | ||
| 5. Insert & Delete in Heaps.mp4 | 170.41 MB | ||
| 6. Example Solution & Max Heap-en_US.srt | 13.55 KB | ||
| 6. Example Solution & Max Heap.mp4 | 27.86 MB | ||
| 7-Implementation-of-Priority-Queue-Part-1.txt | 506 B | ||
| 7. Implementation of Priority Queue - Part 1-en_US.srt | 8.67 KB | ||
| 7. Implementation of Priority Queue - Part 1.mp4 | 30.07 MB | ||
| 8. Implementation-Insert-en_US.srt | 18.59 KB | ||
| 8. Implementation-Insert.mp4 | 52.42 MB | ||
| 9. Remove Min Explanation-en_US.srt | 8.61 KB | ||
| 9. Remove Min Explanation.mp4 | 20.94 MB | ||
| 28. Dynamic Programming Basic | |||
| 1-fibonaci.txt | 1.05 KB | ||
| 1. Introduction & Fibonaci-en_US.srt | 35.97 KB | ||
| 1. Introduction & Fibonaci.mp4 | 117.05 MB | ||
| 2. Hint Minimum Steps to 1-en_US.srt | 14.24 KB | ||
| 2. Hint Minimum Steps to 1.mp4 | 23.25 MB | ||
| 3-minimum-steps-to-1-brute-force-implentation.txt | 487 B | ||
| 3. Minimum Steps to 1 Brute Force Method-en_US.srt | 15.01 KB | ||
| 3. Minimum Steps to 1 Brute Force Method.mp4 | 64.94 MB | ||
| 4-minimum-steps-to-1-memorization-method.txt | 1.16 KB | ||
| 4. Minimum Steps to 1 Memorization Method-en_US.srt | 18.99 KB | ||
| 4. Minimum Steps to 1 Memorization Method.mp4 | 72.97 MB | ||
| 5-minimum-steps-to-1-bottom-up-dp.txt | 2.06 KB | ||
| 5. Minimum Steps to 1 Bottom Up Method-en_US.srt | 15.49 KB | ||
| 5. Minimum Steps to 1 Bottom Up Method.mp4 | 165.08 MB | ||
| 6. Climbing Stairs Recursive-en_US.srt | 5.67 KB | ||
| 6. Climbing Stairs Recursive.mp4 | 28.18 MB | ||
| 7. Climbing Stairs DP-en_US.srt | 4.77 KB | ||
| 7. Climbing Stairs DP.mp4 | 24.45 MB | ||
| 8. Climbing Stairs DP Generalised-en_US.srt | 9.88 KB | ||
| 8. Climbing Stairs DP Generalised.mp4 | 57.28 MB | ||
| Climbing-Stairs-DP-Generalised.txt | 800 B | ||
| Climbing-Stairs-Recursive.txt | 256 B | ||
| Climbing-stairs-DP.txt | 426 B | ||
| 29. Dynamic Programming Advanced | |||
| 1. Longest Common Subsequence Recursive-en_US.srt | 13.85 KB | ||
| 1. Longest Common Subsequence Recursive.mp4 | 66.09 MB | ||
| 2. Longest Common Subsequence DP-en_US.srt | 11.55 KB | ||
| 2. Longest Common Subsequence DP.mp4 | 82.07 MB | ||
| 3. Minimum Distance Recursive-en_US.srt | 15.36 KB | ||
| 3. Minimum Distance Recursive.mp4 | 89.82 MB | ||
| 4. Minimum Distance DP-en_US.srt | 11.38 KB | ||
| 4. Minimum Distance DP.mp4 | 87.18 MB | ||
| 5. 0-1 Knapsack Recursive-en_US.srt | 25.84 KB | ||
| 5. 0-1 Knapsack Recursive.mp4 | 106.09 MB | ||
| 6. 0-1 Knapsack DP-en_US.srt | 14.16 KB | ||
| 6. 0-1 Knapsack DP.mp4 | 70.78 MB | ||
| Edit-Distance-dp.txt | 1.28 KB | ||
| Edit-Distance-recursive.txt | 633 B | ||
| Knapsack-DP.txt | 962 B | ||
| Knapsack-Recursive.txt | 490 B | ||
| LCS-dp.txt | 1005 B | ||
| LCS-recursive.txt | 488 B | ||
| 3. DS Character Array | |||
| 1. Introduction-en_US.srt | 19.67 KB | ||
| 1. Introduction.mp4 | 48.09 MB | ||
| 2. Length of String-en_US.srt | 7.25 KB | ||
| 2. Length of String.mp4 | 51.37 MB | ||
| 3. cin.getline()-en_US.srt | 24.04 KB | ||
| 3. cin.getline().mp4 | 149.94 MB | ||
| 4. Reverse string-en_US.srt | 13.97 KB | ||
| 4. Reverse string.mp4 | 112.06 MB | ||
| 5. Inbuilt functions-en_US.srt | 42.22 KB | ||
| 5. Inbuilt functions.mp4 | 153.36 MB | ||
| 6. Print all prefixes-en_US.srt | 11.91 KB | ||
| 6. Print all prefixes.mp4 | 75.49 MB | ||
| 30. DS Graph | |||
| 1. Graph Introduction-en_US.srt | 10.66 KB | ||
| 1. Graph Introduction.mp4 | 17.03 MB | ||
| 2. Graph Terminology-en_US.srt | 17.48 KB | ||
| 2. Graph Terminology.mp4 | 48.84 MB | ||
| 3. Graph Implementation-en_US.srt | 20.87 KB | ||
| 3. Graph Implementation.mp4 | 94.85 MB | ||
| 4-Adjacency-Matrix.txt | 299 B | ||
| 4. Adjacency Matrix-en_US.srt | 12.74 KB | ||
| 4. Adjacency Matrix.mp4 | 34.79 MB | ||
| 31. Graph Traversal Algo- BFS and DFS | |||
| 1. DFS Traversal-en_US.srt | 41.7 KB | ||
| 1. DFS Traversal.mp4 | 114.79 MB | ||
| 11-DFS-to-find-No-of-Connected-component.txt | 1.61 KB | ||
| 12-BFS-to-find-No-of-Connected-component.txt | 1.71 KB | ||
| 2. BFS Traversal Introduction-en_US.srt | 11.13 KB | ||
| 2. BFS Traversal Introduction.mp4 | 19.01 MB | ||
| 3. BFS Traversal Solution-en_US.srt | 18.19 KB | ||
| 3. BFS Traversal Solution.mp4 | 61.09 MB | ||
| 4. DFS for Disconnected Graph-en_US.srt | 24.49 KB | ||
| 4. DFS for Disconnected Graph.mp4 | 101.65 MB | ||
| 5-DFS-Traversal.txt | 629 B | ||
| 5. BFS for Disconnected Graph-en_US.srt | 12.29 KB | ||
| 5. BFS for Disconnected Graph.mp4 | 36.86 MB | ||
| 6-BFS-Traversal.txt | 629 B | ||
| 6. No of Connected Component-en_US.srt | 3.54 KB | ||
| 6. No of Connected Component.mp4 | 10.51 MB | ||
| 7-BFS-Traversal-Solution.txt | 1.14 KB | ||
| 7. DFS to find No of Connected component-en_US.srt | 10.05 KB | ||
| 7. DFS to find No of Connected component.mp4 | 29.35 MB | ||
| 8-DFS-for-disconnected-graph.txt | 1.32 KB | ||
| 8. BFS to find No of Connected component-en_US.srt | 4.3 KB | ||
| 8. BFS to find No of Connected component.mp4 | 11.64 MB | ||
| 9-BFS-for-disconnected-graph.txt | 1.51 KB | ||
| 32. Weighted and Directed Graph | |||
| 1. Weighted and Directed Graph-en_US.srt | 10.14 KB | ||
| 1. Weighted and Directed Graph.mp4 | 28.28 MB | ||
| 33. Spanning Tree | |||
| 1. Introduction-en_US.srt | 12.08 KB | ||
| 1. Introduction.mp4 | 39.98 MB | ||
| 2. Minimum Spanning Tree-en_US.srt | 8.45 KB | ||
| 2. Minimum Spanning Tree.mp4 | 26.07 MB | ||
| 34. Algo Kruskal | |||
| 1. Introduction-en_US.srt | 28.94 KB | ||
| 1. Introduction.mp4 | 130.56 MB | ||
| 2. Disjoint Set for Cycle Detection-en_US.srt | 45.2 KB | ||
| 2. Disjoint Set for Cycle Detection.mp4 | 281.3 MB | ||
| 3. Kruskal Code-en_US.srt | 4.38 KB | ||
| 3. Kruskal Code.mp4 | 19.24 MB | ||
| Disjoint-set.txt | 175 B | ||
| 35. Algo Prims | |||
| 1. Introduction + Code-en_US.srt | 25.84 KB | ||
| 1. Introduction + Code.mp4 | 118.83 MB | ||
| 2. Commutable Islands explain-en_US.srt | 6.28 KB | ||
| 2. Commutable Islands explain.mp4 | 31.5 MB | ||
| 3. Commutable Islands code-en_US.srt | 17.03 KB | ||
| 3. Commutable Islands code.mp4 | 79.84 MB | ||
| Commutable-Islands-Code.txt | 801 B | ||
| 36. Algo Dijikstra | |||
| 1. Introduction-en_US.srt | 19.31 KB | ||
| 1. Introduction.mp4 | 78.42 MB | ||
| 2. Dijikstra Code-en_US.srt | 5.07 KB | ||
| 2. Dijikstra Code.mp4 | 16.68 MB | ||
| 3. Limitation of Dijikstra-en_US.srt | 5.76 KB | ||
| 3. Limitation of Dijikstra.mp4 | 15.24 MB | ||
| 37. Algo Topological Sort | |||
| 1. Introduction-en_US.srt | 20.54 KB | ||
| 1. Introduction.mp4 | 69.35 MB | ||
| 2. Topological Sort Code-en_US.srt | 7.4 KB | ||
| 2. Topological Sort Code.mp4 | 23.02 MB | ||
| 38. DS Trie | |||
| 1. Introduction-en_US.srt | 26.64 KB | ||
| 1. Introduction.mp4 | 120.84 MB | ||
| 2. Insert in Trie-en_US.srt | 21.41 KB | ||
| 2. Insert in Trie.mp4 | 127.63 MB | ||
| 3. Search in Trie-en_US.srt | 10.54 KB | ||
| 3. Search in Trie.mp4 | 76.62 MB | ||
| Trie-add-and-search.txt | 1.42 KB | ||
| 39. Project Design LRU Cache | |||
| 1. LRU Cache explain-en_US.srt | 17.88 KB | ||
| 1. LRU Cache explain.mp4 | 72.72 MB | ||
| 2. LRU Cache code-en_US.srt | 12.91 KB | ||
| 2. LRU Cache code.mp4 | 51.17 MB | ||
| Lru-cache.txt | 1 KB | ||
| 4. DS Matrix or 2D Array | |||
| 1. Introduction to 2D Arrays-en_US.srt | 27.59 KB | ||
| 1. Introduction to 2D Arrays.mp4 | 180.46 MB | ||
| 2. Initialise and pass 2D Arrays to function-en_US.srt | 16.66 KB | ||
| 2. Initialise and pass 2D Arrays to function.mp4 | 83.35 MB | ||
| 3. How 2D Arrays are stored in Memory-en_US.srt | 23.48 KB | ||
| 3. How 2D Arrays are stored in Memory.mp4 | 176.79 MB | ||
| 40. Bonus | |||
| What to do next.html | 889 B | ||
| 5. DS String | |||
| 1-string.txt | 1.07 KB | ||
| 1. String-en_US.srt | 36.77 KB | ||
| 1. String.mp4 | 433.96 MB | ||
| 6. OOPS - Basics | |||
| 1. Introduction to OOPS-en_US.srt | 10.56 KB | ||
| 1. Introduction to OOPS.mp4 | 29.2 MB | ||
| 10. Fraction Class Continuation-en_US.srt | 11.75 KB | ||
| 10. Fraction Class Continuation.mp4 | 70.16 MB | ||
| 11. Complex Number Class-en_US.srt | 8.55 KB | ||
| 11. Complex Number Class.mp4 | 75 MB | ||
| 2. Creating objects-en_US.srt | 23.07 KB | ||
| 2. Creating objects.mp4 | 210.95 MB | ||
| 3. Getters and Setters-en_US.srt | 15.35 KB | ||
| 3. Getters and Setters.mp4 | 81.44 MB | ||
| 4. Constructors-en_US.srt | 20.5 KB | ||
| 4. Constructors.mp4 | 90.48 MB | ||
| 5. Constructor and this keyword-en_US.srt | 22.78 KB | ||
| 5. Constructor and this keyword.mp4 | 159.25 MB | ||
| 6. Copy Constructor-en_US.srt | 11.35 KB | ||
| 6. Copy Constructor.mp4 | 48.91 MB | ||
| 7. Copy Assignment Operator & Destructor-en_US.srt | 17.6 KB | ||
| 7. Copy Assignment Operator & Destructor.mp4 | 73.82 MB | ||
| 8. Play with Constructor-en_US.srt | 5.52 KB | ||
| 8. Play with Constructor.mp4 | 51.93 MB | ||
| 9. Fraction Class-en_US.srt | 25.78 KB | ||
| 9. Fraction Class.mp4 | 154.41 MB | ||
| 7. OOPS-Advanced | |||
| 1. Shallow and Deep Copy-en_US.srt | 17.28 KB | ||
| 1. Shallow and Deep Copy.mp4 | 82.61 MB | ||
| 2. Our Own Copy Constructor-en_US.srt | 15.96 KB | ||
| 2. Our Own Copy Constructor.mp4 | 62.75 MB | ||
| 3. Initialisation List-en_US.srt | 22.05 KB | ||
| 3. Initialisation List.mp4 | 80.56 MB | ||
| 4. Constant Function-en_US.srt | 15.63 KB | ||
| 4. Constant Function.mp4 | 48.13 MB | ||
| 5. Static Members-en_US.srt | 27.57 KB | ||
| 5. Static Members.mp4 | 94.26 MB | ||
| 6. Operator Overloading - 1-en_US.srt | 23.07 KB | ||
| 6. Operator Overloading - 1.mp4 | 111.83 MB | ||
| 7. Operator Overloading - 2-en_US.srt | 37.1 KB | ||
| 7. Operator Overloading - 2.mp4 | 414.28 MB | ||
| 8. Operator Overloading - 3-en_US.srt | 19.52 KB | ||
| 8. Operator Overloading - 3.mp4 | 112.57 MB | ||
| 9. Dynamic Array Class-en_US.srt | 48.19 KB | ||
| 9. Dynamic Array Class.mp4 | 217.16 MB | ||
| GetFreeCourses.Co.url | 116 B | ||
| fraction.txt | 1.34 KB | ||
| fractionUse.txt | 259 B | ||
| 8. DS Vectors | |||
| 1. Vectors-en_US.srt | 33.31 KB | ||
| 1. Vectors.mp4 | 175.03 MB | ||
| 2. Spiral Order Matrix-en_US.srt | 23.54 KB | ||
| 2. Spiral Order Matrix.mp4 | 178.58 MB | ||
| 48-vectors.txt | 1.12 KB | ||
| 9. Basic Sorting Algorithm | |||
| 1. Selection Sort Algorithm ( Explain + Code )-en_US.srt | 38.2 KB | ||
| 1. Selection Sort Algorithm ( Explain + Code ).mp4 | 451.96 MB | ||
| 1.1-selection-sort.txt.txt | 827 B | ||
| 2. Bubble Sort Algorithm ( Explain + Code )-en_US.srt | 26.08 KB | ||
| 2. Bubble Sort Algorithm ( Explain + Code ).mp4 | 113.78 MB | ||
| 2.1-bubble-sort.txt.txt | 467 B | ||
| 3. Optimized Bubble Sort Algorithm (Explain + Code )-en_US.srt | 9.73 KB | ||
| 3. Optimized Bubble Sort Algorithm (Explain + Code ).mp4 | 25.91 MB | ||
| 3.1-optimised-bubble-sort.txt.txt | 654 B | ||
| 4. Inbuilt Sort Standard Template Library (STL)-en_US.srt | 7.15 KB | ||
| 4. Inbuilt Sort Standard Template Library (STL).mp4 | 23.93 MB | ||
| 4.1-inbuilt-sort.txt.txt | 250 B | ||
| Download Paid Udemy Courses For Free.url | 116 B | ||
| GetFreeCourses.Co.url | 116 B | ||
| ▲ 710 total files | |||
Data Structure & Algorithm using C++ Zero To Mastery 2021
Greedy Algo, Dynamic Programming , Graph ,Tries , Arrays, Recursion, Linked Lists, Trees, HashMap, Stacks, Queues, Heaps
Udemy Link -
https://www.udemy.com/course/data-structures-algorithms-using-c-zero-to-mastery/
Please seed as much as you can!
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
| 484.8 MB | freecoursewb | 1 year | 6 | 2 | |
|
Udemy - Leetcode Solutions Using Algorithms And Data Structure In C# Posted by
freecoursewb in Other
|
3.7 GB | freecoursewb | 1 year | 0 | 0 |
| 849.1 MB | freecoursewb | 1 year | 9 | 2 | |
| 19 GB | fcs0310 | 3 years | 0 | 0 | |
| 890.5 MB | tutsnode | 3 years | 0 | 0 |
All Comments