Name [FreeAllCourse.Com] Udemy - Data Structures & Algorithms !

File Type video

Size 8.18GB

UpdateDate 2024-10-11

hash *****4481C6B4863BBC7AAE18E82BDF8CFB5AAE

Hot 3

Files 1. S01 -- Introduction to Data Structure & Algorithms/1. S01 - L01 -- Course Breakdown.mp4 | 27.05MB 1. S01 -- Introduction to Data Structure & Algorithms/1. S01 - L01 -- Course Breakdown.vtt | 7.70KB 1. S01 -- Introduction to Data Structure & Algorithms/2. S01 - L02 -- What is DS and Algo.mp4 | 37.85MB 1. S01 -- Introduction to Data Structure & Algorithms/2. S01 - L02 -- What is DS and Algo.vtt | 4.80KB 1. S01 -- Introduction to Data Structure & Algorithms/3. S01 - L03 -- Why companies ask DS.mp4 | 16.33MB 1. S01 -- Introduction to Data Structure & Algorithms/3. S01 - L03 -- Why companies ask DS.vtt | 3.84KB 1. S01 -- Introduction to Data Structure & Algorithms/4. S01 - L04 -- DS in every day life.mp4 | 20.73MB 1. S01 -- Introduction to Data Structure & Algorithms/4. S01 - L04 -- DS in every day life.vtt | 3.67KB 1. S01 -- Introduction to Data Structure & Algorithms/5. S01 - L05 -- Types of DS.mp4 | 10.27MB 1. S01 -- Introduction to Data Structure & Algorithms/5. S01 - L05 -- Types of DS.vtt | 3.74KB 1. S01 -- Introduction to Data Structure & Algorithms/6. QUIZ-Introduction.html | 155B 10. S08.03 -- AVL Tree/1. S08.03 - L01 -- Why learn AVL Tree.mp4 | 25.65MB 10. S08.03 -- AVL Tree/1. S08.03 - L01 -- Why learn AVL Tree.vtt | 6.42KB 10. S08.03 -- AVL Tree/10. S08.03 - L10 -- Delete LL LR RR RL.mp4 | 39.77MB 10. S08.03 -- AVL Tree/10. S08.03 - L10 -- Delete LL LR RR RL.vtt | 11.57KB 10. S08.03 -- AVL Tree/11. S08.03 - L11 -- Delete End to End Case.mp4 | 64.16MB 10. S08.03 -- AVL Tree/11. S08.03 - L11 -- Delete End to End Case.vtt | 12.17KB 10. S08.03 -- AVL Tree/12. S08.03 - L12 -- Delete AVL Tree & Tree Comparison.mp4 | 28.16MB 10. S08.03 -- AVL Tree/12. S08.03 - L12 -- Delete AVL Tree & Tree Comparison.vtt | 7.25KB 10. S08.03 -- AVL Tree/12.1 AVL.zip.zip | 7.23KB 10. S08.03 -- AVL Tree/2. S08.03 - L02 -- What is AVL Tree.mp4 | 36.21MB 10. S08.03 -- AVL Tree/2. S08.03 - L02 -- What is AVL Tree.vtt | 9.96KB 10. S08.03 -- AVL Tree/3. S08.03 - L03 -- Create Search Traverse AVL Tree.mp4 | 23.24MB 10. S08.03 -- AVL Tree/3. S08.03 - L03 -- Create Search Traverse AVL Tree.vtt | 6.71KB 10. S08.03 -- AVL Tree/4. S08.03 - L04 -- Insert in AVL_LL Theory.mp4 | 38.26MB 10. S08.03 -- AVL Tree/4. S08.03 - L04 -- Insert in AVL_LL Theory.vtt | 13.21KB 10. S08.03 -- AVL Tree/5. S08.03 - L05 -- Insert in AVL_LL Algorithm.mp4 | 20.60MB 10. S08.03 -- AVL Tree/5. S08.03 - L05 -- Insert in AVL_LL Algorithm.vtt | 4.95KB 10. S08.03 -- AVL Tree/6. S08.03 - L06 -- Insert in AVL LR.mp4 | 34.42MB 10. S08.03 -- AVL Tree/6. S08.03 - L06 -- Insert in AVL LR.vtt | 8.02KB 10. S08.03 -- AVL Tree/7. S08.03 - L07 -- Insert in AVL RR.mp4 | 31.08MB 10. S08.03 -- AVL Tree/7. S08.03 - L07 -- Insert in AVL RR.vtt | 8.78KB 10. S08.03 -- AVL Tree/8. S08.03 - L08 -- Insert in AVL RL.mp4 | 23.83MB 10. S08.03 -- AVL Tree/8. S08.03 - L08 -- Insert in AVL RL.vtt | 6.36KB 10. S08.03 -- AVL Tree/9. S08.03 - L09 -- Insert End to End Case.mp4 | 64.14MB 10. S08.03 -- AVL Tree/9. S08.03 - L09 -- Insert End to End Case.vtt | 14.34KB 11. S08.04 -- Binary Heap/1. S08.04 - L01 -- What Why and Type of Heap.mp4 | 48.98MB 11. S08.04 -- Binary Heap/1. S08.04 - L01 -- What Why and Type of Heap.vtt | 12.32KB 11. S08.04 -- Binary Heap/2. S08.04 - L02 -- Create, Peek, Size of Heap.mp4 | 16.80MB 11. S08.04 -- Binary Heap/2. S08.04 - L02 -- Create, Peek, Size of Heap.vtt | 4.86KB 11. S08.04 -- Binary Heap/3. S08.04 - L03 -- Insert element in Heap.mp4 | 18.89MB 11. S08.04 -- Binary Heap/3. S08.04 - L03 -- Insert element in Heap.vtt | 5.54KB 11. S08.04 -- Binary Heap/4. S08.04 - L04 -- Extract and Delete from Heap.mp4 | 19.67MB 11. S08.04 -- Binary Heap/4. S08.04 - L04 -- Extract and Delete from Heap.vtt | 6.49KB 11. S08.04 -- Binary Heap/4.1 Heap.zip.zip | 1.82KB 11. S08.04 -- Binary Heap/5. S08.04 - L05 -- Why avoid Reference based implementation .mp4 | 15.31MB 11. S08.04 -- Binary Heap/5. S08.04 - L05 -- Why avoid Reference based implementation .vtt | 3.93KB 12. S08.05 -- Trie/1. S08.05 - L01 -- What and Why of Trie.mp4 | 29.54MB 12. S08.05 -- Trie/1. S08.05 - L01 -- What and Why of Trie.vtt | 6.58KB 12. S08.05 -- Trie/2. S08.05 - L02 -- Create Insert in Trie.mp4 | 34.09MB 12. S08.05 -- Trie/2. S08.05 - L02 -- Create Insert in Trie.vtt | 7.53KB 12. S08.05 -- Trie/3. S08.05 - L03 -- Search a String in Trie.mp4 | 12.14MB 12. S08.05 -- Trie/3. S08.05 - L03 -- Search a String in Trie.vtt | 3.10KB 12. S08.05 -- Trie/4. S08.05 - L04 -- Delete a String from Trie.mp4 | 42.84MB 12. S08.05 -- Trie/4. S08.05 - L04 -- Delete a String from Trie.vtt | 8.18KB 12. S08.05 -- Trie/4.1 Trie.zip.zip | 1.74KB 12. S08.05 -- Trie/5. S08.05 - L05 -- Practical Uses of Trie.mp4 | 20.61MB 12. S08.05 -- Trie/5. S08.05 - L05 -- Practical Uses of Trie.vtt | 2.97KB 13. S09 -- Hashing/1. S09 - L01 -- Introduction to Hashing.mp4 | 5.56MB 13. S09 -- Hashing/1. S09 - L01 -- Introduction to Hashing.vtt | 3.61KB 13. S09 -- Hashing/2. S09 - L02 -- Why learn Hashing .mp4 | 8.85MB 13. S09 -- Hashing/2. S09 - L02 -- Why learn Hashing .vtt | 5.08KB 13. S09 -- Hashing/3. S09 - L03 -- Introduction to Hash Functions.mp4 | 13.87MB 13. S09 -- Hashing/3. S09 - L03 -- Introduction to Hash Functions.vtt | 8.27KB 13. S09 -- Hashing/4. S09 - L04 -- Types of Collision Resolution Techniques.mp4 | 24.35MB 13. S09 -- Hashing/4. S09 - L04 -- Types of Collision Resolution Techniques.vtt | 14.37KB 13. S09 -- Hashing/5. S09 - L05 -- What happens when Hash Table is full .mp4 | 7.04MB 13. S09 -- Hashing/5. S09 - L05 -- What happens when Hash Table is full .vtt | 4.76KB 13. S09 -- Hashing/6. S09 - L06 -- Collision Resolution Techniques Compared.mp4 | 13.63MB 13. S09 -- Hashing/6. S09 - L06 -- Collision Resolution Techniques Compared.vtt | 9.12KB 13. S09 -- Hashing/7. S09 - L07 -- Practical Use of Hashing.mp4 | 11.35MB 13. S09 -- Hashing/7. S09 - L07 -- Practical Use of Hashing.vtt | 6.56KB 13. S09 -- Hashing/8. S09 - L08 -- Hashing vs Other DS.mp4 | 7.84MB 13. S09 -- Hashing/8. S09 - L08 -- Hashing vs Other DS.vtt | 4.60KB 13. S09 -- Hashing/8.1 Hashing.zip.zip | 12.55KB 14. S10 -- Sorting/1. S10 - L01 -- What and Why of Sorting.mp4 | 15.18MB 14. S10 -- Sorting/1. S10 - L01 -- What and Why of Sorting.vtt | 4.40KB 14. S10 -- Sorting/10. S10 - L09 -- Quick Sort Part#2.mp4 | 28.27MB 14. S10 -- Sorting/10. S10 - L09 -- Quick Sort Part#2.vtt | 6.75KB 14. S10 -- Sorting/10.1 QuickSort.zip.zip | 1004B 14. S10 -- Sorting/11. S10 - L10 -- HeapSort.mp4 | 59.91MB 14. S10 -- Sorting/11. S10 - L10 -- HeapSort.vtt | 15.15KB 14. S10 -- Sorting/11.1 HeapSort.zip.zip | 2.37KB 14. S10 -- Sorting/12. S10 - L11 -- Sorting Techniques compared.mp4 | 8.87MB 14. S10 -- Sorting/12. S10 - L11 -- Sorting Techniques compared.vtt | 2.57KB 14. S10 -- Sorting/2. S10 - L02 -- Types of Sorting Techniques.mp4 | 35.89MB 14. S10 -- Sorting/2. S10 - L02 -- Types of Sorting Techniques.vtt | 7.58KB 14. S10 -- Sorting/3. S10 - L03 -- Sorting Terminologies.mp4 | 18.80MB 14. S10 -- Sorting/3. S10 - L03 -- Sorting Terminologies.vtt | 5.55KB 14. S10 -- Sorting/4. S10 - L04 -- Bubble Sort.mp4 | 29.41MB 14. S10 -- Sorting/4. S10 - L04 -- Bubble Sort.vtt | 9.18KB 14. S10 -- Sorting/4.1 BubbleSort.zip.zip | 950B 14. S10 -- Sorting/5. S10 - L05 -- Selection Sort.mp4 | 22.63MB 14. S10 -- Sorting/5. S10 - L05 -- Selection Sort.vtt | 6.82KB 14. S10 -- Sorting/5.1 SelectionSort.zip.zip | 1.00KB 14. S10 -- Sorting/6. S10 - L06 -- Insertion Sort.mp4 | 32.56MB 14. S10 -- Sorting/6. S10 - L06 -- Insertion Sort.vtt | 10.65KB 14. S10 -- Sorting/6.1 InsertionSort.zip.zip | 1003B 14. S10 -- Sorting/7. S10 - L07 -- Bucket Sort.mp4 | 46.07MB 14. S10 -- Sorting/7. S10 - L07 -- Bucket Sort.vtt | 9.50KB 14. S10 -- Sorting/7.1 BucketSort.zip.zip | 1.49KB 14. S10 -- Sorting/8. S10 - L08 -- Merge Sort.mp4 | 45.99MB 14. S10 -- Sorting/8. S10 - L08 -- Merge Sort.vtt | 13.16KB 14. S10 -- Sorting/8.1 MergeSort.zip.zip | 1.20KB 14. S10 -- Sorting/9. S10 - L09 -- Quick Sort Part#1.mp4 | 61.48MB 14. S10 -- Sorting/9. S10 - L09 -- Quick Sort Part#1.vtt | 14.61KB 15. S11 -- Graph/1. S11 - L01 -- What and Why of Graphs.mp4 | 43.82MB 15. S11 -- Graph/1. S11 - L01 -- What and Why of Graphs.vtt | 9.46KB 15. S11 -- Graph/10. S11 - L10 -- What is Topological Sort.mp4 | 15.67MB 15. S11 -- Graph/10. S11 - L10 -- What is Topological Sort.vtt | 4.16KB 15. S11 -- Graph/11. S11 - L11 -- Topological Sort Dry Run.mp4 | 34.97MB 15. S11 -- Graph/11. S11 - L11 -- Topological Sort Dry Run.vtt | 6.67KB 15. S11 -- Graph/12. S11 - L12 -- Why Topological Sort Works.mp4 | 36.77MB 15. S11 -- Graph/12. S11 - L12 -- Why Topological Sort Works.vtt | 7.43KB 15. S11 -- Graph/13. S11 - L13 -- Topological Sort Algorithm.mp4 | 39.69MB 15. S11 -- Graph/13. S11 - L13 -- Topological Sort Algorithm.vtt | 7.41KB 15. S11 -- Graph/13.1 TopologicalSort.zip.zip | 5.34KB 15. S11 -- Graph/14. S11 - L14 -- What is Single Source Shortest Path Problem(SSSP).mp4 | 35.39MB 15. S11 -- Graph/14. S11 - L14 -- What is Single Source Shortest Path Problem(SSSP).vtt | 7.01KB 15. S11 -- Graph/15. S11 - L15 -- BFS for SSSP.mp4 | 50.77MB 15. S11 -- Graph/15. S11 - L15 -- BFS for SSSP.vtt | 8.29KB 15. S11 -- Graph/15.1 BFS.zip.zip | 9.07KB 15. S11 -- Graph/16. S11 - L16 -- Why BFS does not works for Weighted Graph SSSP.mp4 | 18.20MB 15. S11 -- Graph/16. S11 - L16 -- Why BFS does not works for Weighted Graph SSSP.vtt | 4.24KB 15. S11 -- Graph/17. S11 - L17 -- Why DFS does not works for SSSP.mp4 | 11.49MB 15. S11 -- Graph/17. S11 - L17 -- Why DFS does not works for SSSP.vtt | 3.12KB 15. S11 -- Graph/18. S11 - L18 -- Dijkstra for SSSP.mp4 | 61.63MB 15. S11 -- Graph/18. S11 - L18 -- Dijkstra for SSSP.vtt | 12.46KB 15. S11 -- Graph/18.1 Dijkstra.zip.zip | 6.32KB 15. S11 -- Graph/19. S11 - L19 -- Why Dijkstra does not work for Negative Cycle.mp4 | 27.36MB 15. S11 -- Graph/19. S11 - L19 -- Why Dijkstra does not work for Negative Cycle.vtt | 6.70KB 15. S11 -- Graph/2. S11 - L02 -- Graph Terminologies.mp4 | 22.21MB 15. S11 -- Graph/2. S11 - L02 -- Graph Terminologies.vtt | 5.48KB 15. S11 -- Graph/20. S11 - L20 -- BellmanFord Dry run for SSSP.mp4 | 66.42MB 15. S11 -- Graph/20. S11 - L20 -- BellmanFord Dry run for SSSP.vtt | 10.72KB 15. S11 -- Graph/21. S11 - L21 -- BellanFord Algorithm for SSSP.mp4 | 24.27MB 15. S11 -- Graph/21. S11 - L21 -- BellanFord Algorithm for SSSP.vtt | 4.99KB 15. S11 -- Graph/21.1 BellmanFord2.zip.zip | 140.66KB 15. S11 -- Graph/22. S11 - L22 -- How Bellman Ford works for Negative Cycle.mp4 | 73.70MB 15. S11 -- Graph/22. S11 - L22 -- How Bellman Ford works for Negative Cycle.vtt | 9.51KB 15. S11 -- Graph/23. S11 - L23 -- Why BellmanFord runs for V-1 times.mp4 | 59.81MB 15. S11 -- Graph/23. S11 - L23 -- Why BellmanFord runs for V-1 times.vtt | 10.65KB 15. S11 -- Graph/24. S11 - L24 -- BFS vs Dijkstra vs BellmanFord.mp4 | 29.95MB 15. S11 -- Graph/24. S11 - L24 -- BFS vs Dijkstra vs BellmanFord.vtt | 5.21KB 15. S11 -- Graph/25. S11 - L25 -- What is All Pair Shortest Path Problem(APSP).mp4 | 38.50MB 15. S11 -- Graph/25. S11 - L25 -- What is All Pair Shortest Path Problem(APSP).vtt | 6.27KB 15. S11 -- Graph/26. S11 - L26 -- Dry run of BFS Dijkstra Bellman for APSP.mp4 | 24.30MB 15. S11 -- Graph/26. S11 - L26 -- Dry run of BFS Dijkstra Bellman for APSP.vtt | 6.36KB 15. S11 -- Graph/27. S11 - L27 -- Floyd Warshall Algorithm for APSP.mp4 | 65.79MB 15. S11 -- Graph/27. S11 - L27 -- Floyd Warshall Algorithm for APSP.vtt | 10.64KB 15. S11 -- Graph/27.1 FloydWarshall.zip.zip | 80.51KB 15. S11 -- Graph/28. S11 - L28 -- Why Floyd Warshall Algorithm always works.mp4 | 45.32MB 15. S11 -- Graph/28. S11 - L28 -- Why Floyd Warshall Algorithm always works.vtt | 9.09KB 15. S11 -- Graph/29. S11 - L29 -- Why Floyd does not works for Negative Cycle.mp4 | 16.33MB 15. S11 -- Graph/29. S11 - L29 -- Why Floyd does not works for Negative Cycle.vtt | 4.13KB 15. S11 -- Graph/3. S11 - L03 -- Types of Graphs.mp4 | 15.69MB 15. S11 -- Graph/3. S11 - L03 -- Types of Graphs.vtt | 4.22KB 15. S11 -- Graph/30. S11 - L30 -- BFS vs Dijkstra vs Bellman vs Floys.mp4 | 35.48MB 15. S11 -- Graph/30. S11 - L30 -- BFS vs Dijkstra vs Bellman vs Floys.vtt | 5.11KB 15. S11 -- Graph/31. S11 - L31 -- What is Minimum Spanning Tree (MST).mp4 | 28.56MB 15. S11 -- Graph/31. S11 - L31 -- What is Minimum Spanning Tree (MST).vtt | 5.00KB 15. S11 -- Graph/32. S11 - L32.1 -- DisjointSet.mp4 | 42.10MB 15. S11 -- Graph/32. S11 - L32.1 -- DisjointSet.vtt | 9.97KB 15. S11 -- Graph/32.1 DisjointSet.zip.zip | 6.22KB 15. S11 -- Graph/33. S11 - L32.2 -- Kruskals Algorithm.mp4 | 70.92MB 15. S11 -- Graph/33. S11 - L32.2 -- Kruskals Algorithm.vtt | 13.68KB 15. S11 -- Graph/33.1 Kruskal4.zip.zip | 8.12KB 15. S11 -- Graph/34. S11 - L33 -- Prims Algorithm Dry Run.mp4 | 29.95MB 15. S11 -- Graph/34. S11 - L33 -- Prims Algorithm Dry Run.vtt | 7.30KB 15. S11 -- Graph/35. S11 - L34 -- Prims Algorithm Explained.mp4 | 31.98MB 15. S11 -- Graph/35. S11 - L34 -- Prims Algorithm Explained.vtt | 5.88KB 15. S11 -- Graph/35.1 Prims.zip.zip | 6.37KB 15. S11 -- Graph/36. S11 - L35 -- Prims vs Kruskal.mp4 | 11.10MB 15. S11 -- Graph/36. S11 - L35 -- Prims vs Kruskal.vtt | 3.01KB 15. S11 -- Graph/4. S11 - L04 -- Graph Representation in Code.mp4 | 31.06MB 15. S11 -- Graph/4. S11 - L04 -- Graph Representation in Code.vtt | 7.34KB 15. S11 -- Graph/5. S11 - L05 -- BFS Algorithm.mp4 | 38.58MB 15. S11 -- Graph/5. S11 - L05 -- BFS Algorithm.vtt | 9.39KB 15. S11 -- Graph/6. S11 - L06 -- BFS Time Complexity.mp4 | 34.83MB 15. S11 -- Graph/6. S11 - L06 -- BFS Time Complexity.vtt | 7.14KB 15. S11 -- Graph/6.1 BFS.zip.zip | 9.07KB 15. S11 -- Graph/7. S11 - L07 -- DFS Algorithm.mp4 | 38.73MB 15. S11 -- Graph/7. S11 - L07 -- DFS Algorithm.vtt | 9.15KB 15. S11 -- Graph/8. S11 - L08 -- DFS Time Complexity.mp4 | 33.40MB 15. S11 -- Graph/8. S11 - L08 -- DFS Time Complexity.vtt | 6.22KB 15. S11 -- Graph/8.1 DFS.zip.zip | 7.20KB 15. S11 -- Graph/9. S11 - L09 -- BFS vs DFS.mp4 | 22.42MB 15. S11 -- Graph/9. S11 - L09 -- BFS vs DFS.vtt | 4.73KB 16. S12.1 -- Magic Framework/1. S12.1 - L01 -- Magic Framework.mp4 | 15.73MB 16. S12.1 -- Magic Framework/1. S12.1 - L01 -- Magic Framework.vtt | 5.07KB 17. S12.2 -- Greedy Algorithm/1. S12.2 - L01 -- Greedy Algo Introduction.mp4 | 40.27MB 17. S12.2 -- Greedy Algorithm/1. S12.2 - L01 -- Greedy Algo Introduction.vtt | 6.45KB 17. S12.2 -- Greedy Algorithm/2. S12.2 - L02 -- Known Algos.mp4 | 41.51MB 17. S12.2 -- Greedy Algorithm/2. S12.2 - L02 -- Known Algos.vtt | 10.70KB 17. S12.2 -- Greedy Algorithm/3. S12.2 - L03 -- Activity Selection Problem.mp4 | 35.38MB 17. S12.2 -- Greedy Algorithm/3. S12.2 - L03 -- Activity Selection Problem.vtt | 8.67KB 17. S12.2 -- Greedy Algorithm/3.1 ActivitySelection.zip.zip | 2.00KB 17. S12.2 -- Greedy Algorithm/4. S12.2 - L04 -- Coin Change Problem.mp4 | 41.24MB 17. S12.2 -- Greedy Algorithm/4. S12.2 - L04 -- Coin Change Problem.vtt | 9.61KB 17. S12.2 -- Greedy Algorithm/4.1 CoinChange.zip.zip | 1.07KB 17. S12.2 -- Greedy Algorithm/5. S12.2 - L05 -- Fractional Knapsack Problem.mp4 | 64.34MB 17. S12.2 -- Greedy Algorithm/5. S12.2 - L05 -- Fractional Knapsack Problem.vtt | 12.58KB 17. S12.2 -- Greedy Algorithm/5.1 FractionalKnapsack.zip.zip | 2.19KB 18. S12.3 -- Divide & Conquer/1. S12.3 - L01 -- What and Why of Divide&Conquer.mp4 | 29.37MB 18. S12.3 -- Divide & Conquer/1. S12.3 - L01 -- What and Why of Divide&Conquer.vtt | 8.41KB 18. S12.3 -- Divide & Conquer/10. S12.3 - L10 -- Longest Palindromic Substring.mp4 | 47.77MB 18. S12.3 -- Divide & Conquer/10. S12.3 - L10 -- Longest Palindromic Substring.vtt | 9.38KB 18. S12.3 -- Divide & Conquer/10.1 LongestPalindromicSubstring_DC.zip.zip | 4.78KB 18. S12.3 -- Divide & Conquer/11. S12.3 - L11 -- Min Cost to Reach End of Array.mp4 | 33.82MB 18. S12.3 -- Divide & Conquer/11. S12.3 - L11 -- Min Cost to Reach End of Array.vtt | 7.56KB 18. S12.3 -- Divide & Conquer/11.1 MinCostToReachLastCellI_in2DArray_DC.zip.zip | 4.68KB 18. S12.3 -- Divide & Conquer/12. S12.3 - L12 -- Number of Paths to reach last cell with given Cost.mp4 | 55.29MB 18. S12.3 -- Divide & Conquer/12. S12.3 - L12 -- Number of Paths to reach last cell with given Cost.vtt | 11.00KB 18. S12.3 -- Divide & Conquer/12.1 NumberOfPathsToReachLastCell_DC.zip.zip | 4.66KB 18. S12.3 -- Divide & Conquer/2. S12.3 - L02 -- Binary Search, Quick, Merge Sortt.mp4 | 21.59MB 18. S12.3 -- Divide & Conquer/2. S12.3 - L02 -- Binary Search, Quick, Merge Sortt.vtt | 6.33KB 18. S12.3 -- Divide & Conquer/3. S12.3 - L03 -- Fibonacci Series.mp4 | 12.63MB 18. S12.3 -- Divide & Conquer/3. S12.3 - L03 -- Fibonacci Series.vtt | 3.76KB 18. S12.3 -- Divide & Conquer/3.1 Fibonacci_DC.zip.zip | 4.41KB 18. S12.3 -- Divide & Conquer/4. S12.3 - L04 -- Number Factor.mp4 | 44.42MB 18. S12.3 -- Divide & Conquer/4. S12.3 - L04 -- Number Factor.vtt | 10.08KB 18. S12.3 -- Divide & Conquer/4.1 Number_Factors_DC.zip.zip | 4.46KB 18. S12.3 -- Divide & Conquer/5. S12.3 - L05 -- House thief.mp4 | 36.25MB 18. S12.3 -- Divide & Conquer/5. S12.3 - L05 -- House thief.vtt | 9.11KB 18. S12.3 -- Divide & Conquer/5.1 House_Thieft_DC.zip.zip | 4.48KB 18. S12.3 -- Divide & Conquer/6. S12.3 - L06 -- Convert One String to Another.mp4 | 59.86MB 18. S12.3 -- Divide & Conquer/6. S12.3 - L06 -- Convert One String to Another.vtt | 13.37KB 18. S12.3 -- Divide & Conquer/6.1 ConvertOneStringToAnother_DC.zip.zip | 4.63KB 18. S12.3 -- Divide & Conquer/7. S12.3 - L07 -- Zero-One Knapsack.mp4 | 36.24MB 18. S12.3 -- Divide & Conquer/7. S12.3 - L07 -- Zero-One Knapsack.vtt | 8.07KB 18. S12.3 -- Divide & Conquer/7.1 ZeroOneKnapsack_DC.zip.zip | 4.54KB 18. S12.3 -- Divide & Conquer/8. S12.3 - L08 -- Longest Common Subsequence.mp4 | 44.33MB 18. S12.3 -- Divide & Conquer/8. S12.3 - L08 -- Longest Common Subsequence.vtt | 9.20KB 18. S12.3 -- Divide & Conquer/8.1 LongestCommonSubsequence_DC.zip.zip | 4.57KB 18. S12.3 -- Divide & Conquer/9. S12.3 - L09 -- Longest Palindromic Subsequence.mp4 | 48.53MB 18. S12.3 -- Divide & Conquer/9. S12.3 - L09 -- Longest Palindromic Subsequence.vtt | 9.71KB 18. S12.3 -- Divide & Conquer/9.1 LongestPalindromicSubsequence_DC.zip.zip | 4.70KB 19. S12.4 -- Dynamic Programming/1. S12.4 - L01 -- What and Why of Dynamic Programming.mp4 | 26.94MB 19. S12.4 -- Dynamic Programming/1. S12.4 - L01 -- What and Why of Dynamic Programming.vtt | 5.24KB 19. S12.4 -- Dynamic Programming/10. S12.4 - L10 -- Longest Palindromic Subsequence.mp4 | 88.35MB 19. S12.4 -- Dynamic Programming/10. S12.4 - L10 -- Longest Palindromic Subsequence.vtt | 13.00KB 19. S12.4 -- Dynamic Programming/10.1 Java Code - LongestPalindromicSubsequence.zip.zip | 329.94KB 19. S12.4 -- Dynamic Programming/11. S12.4 - L11 -- Longest Palindromic Substring.mp4 | 105.21MB 19. S12.4 -- Dynamic Programming/11. S12.4 - L11 -- Longest Palindromic Substring.vtt | 15.08KB 19. S12.4 -- Dynamic Programming/11.1 Java Code - LongestPalindromicSubsequence.zip.zip | 329.94KB 19. S12.4 -- Dynamic Programming/12. S12.4 - L12 -- Min Cost to Reach End of Array.mp4 | 91.32MB 19. S12.4 -- Dynamic Programming/12. S12.4 - L12 -- Min Cost to Reach End of Array.vtt | 14.94KB 19. S12.4 -- Dynamic Programming/12.1 Java Code - MinCostToReachLastCellI_in2DArray.zip.zip | 329.96KB 19. S12.4 -- Dynamic Programming/13. S12.4 - L13 -- Ways to Reach last cell.mp4 | 169.58MB 19. S12.4 -- Dynamic Programming/13. S12.4 - L13 -- Ways to Reach last cell.vtt | 26.56KB 19. S12.4 -- Dynamic Programming/13.1 Java Code - NumberOfPathsToReachLastCell.zip.zip | 330.10KB 19. S12.4 -- Dynamic Programming/13.2 Java Code - NumberOfPathsToReachLastCell_TD.zip.zip | 1.65KB 19. S12.4 -- Dynamic Programming/2. S12.4 - L02 -- Top Down Approach.mp4 | 28.26MB 19. S12.4 -- Dynamic Programming/2. S12.4 - L02 -- Top Down Approach.vtt | 7.24KB 19. S12.4 -- Dynamic Programming/3. S12.4 - L03 -- Bottom Up Approach.mp4 | 35.23MB 19. S12.4 -- Dynamic Programming/3. S12.4 - L03 -- Bottom Up Approach.vtt | 8.40KB 19. S12.4 -- Dynamic Programming/4. S12.4 - L04 -- Is Merge Sort Dynamic Programming .mp4 | 17.13MB 19. S12.4 -- Dynamic Programming/4. S12.4 - L04 -- Is Merge Sort Dynamic Programming .vtt | 4.32KB 19. S12.4 -- Dynamic Programming/5. S12.4 - L05 -- Number Factor Problem.mp4 | 95.72MB 19. S12.4 -- Dynamic Programming/5. S12.4 - L05 -- Number Factor Problem.vtt | 16.78KB 19. S12.4 -- Dynamic Programming/5.1 Java Code - Number_Factors.zip.zip | 329.40KB 19. S12.4 -- Dynamic Programming/6. S12.4 - L06 -- HouseThief Problem.mp4 | 88.63MB 19. S12.4 -- Dynamic Programming/6. S12.4 - L06 -- HouseThief Problem.vtt | 12.79KB 19. S12.4 -- Dynamic Programming/6.1 Java Code - House_Thieft.zip.zip | 329.46KB 19. S12.4 -- Dynamic Programming/7. S12.4 - L07 -- Convert One String to Another.mp4 | 83.21MB 19. S12.4 -- Dynamic Programming/7. S12.4 - L07 -- Convert One String to Another.vtt | 12.82KB 19. S12.4 -- Dynamic Programming/7.1 Java Code - ConvertOneStringToAnother.zip.zip | 329.81KB 19. S12.4 -- Dynamic Programming/8. S12.4 - L08 -- Zero One Knapsack Problem.mp4 | 96.98MB 19. S12.4 -- Dynamic Programming/8. S12.4 - L08 -- Zero One Knapsack Problem.vtt | 15.04KB 19. S12.4 -- Dynamic Programming/8.1 Java Code - ZeroOneKnapsack.zip.zip | 329.90KB 19. S12.4 -- Dynamic Programming/9. S12.4 - L09 -- Longest Common Subsequence.mp4 | 74.15MB 19. S12.4 -- Dynamic Programming/9. S12.4 - L09 -- Longest Common Subsequence.vtt | 11.79KB 19. S12.4 -- Dynamic Programming/9.1 Java Code - LongestCommonSubsequence.zip.zip | 329.74KB 2. S01.1 -- Recursion/1. S01.1-L01--What is Recursion.mp4 | 58.70MB 2. S01.1 -- Recursion/1. S01.1-L01--What is Recursion.vtt | 11.17KB 2. S01.1 -- Recursion/2. S01.1-L02--Why learn Recursion.mp4 | 15.07MB 2. S01.1 -- Recursion/2. S01.1-L02--Why learn Recursion.vtt | 4.33KB 2. S01.1 -- Recursion/3. S01.1-L03--Format of Recursion Method.mp4 | 12.45MB 2. S01.1 -- Recursion/3. S01.1-L03--Format of Recursion Method.vtt | 3.51KB 2. S01.1 -- Recursion/4. S01.1-L04--How Recurssion works internally.mp4 | 54.72MB 2. S01.1 -- Recursion/4. S01.1-L04--How Recurssion works internally.vtt | 13.90KB 2. S01.1 -- Recursion/5. S01.1-L05--Finding Factorial using Recursion.mp4 | 26.55MB 2. S01.1 -- Recursion/5. S01.1-L05--Finding Factorial using Recursion.vtt | 7.47KB 2. S01.1 -- Recursion/6. S01.1-L06--Finding Fibonacci using Recursion.mp4 | 25.04MB 2. S01.1 -- Recursion/6. S01.1-L06--Finding Fibonacci using Recursion.vtt | 7.79KB 2. S01.1 -- Recursion/7. S01.1-L07--Recursion vs Iteration.mp4 | 10.34MB 2. S01.1 -- Recursion/7. S01.1-L07--Recursion vs Iteration.vtt | 3.17KB 2. S01.1 -- Recursion/8. S01.1-L08--When to Use & Avoid Recursion.mp4 | 13.56MB 2. S01.1 -- Recursion/8. S01.1-L08--When to Use & Avoid Recursion.vtt | 4.29KB 2. S01.1 -- Recursion/9. S01.1-L09--Practical Uses of Recursion.mp4 | 7.88MB 2. S01.1 -- Recursion/9. S01.1-L09--Practical Uses of Recursion.vtt | 3.26KB 3. S02 -- Algorithm Run Time Analysis/1. S02-L01 -- What is Algo Run Time Analysis.mp4 | 13.73MB 3. S02 -- Algorithm Run Time Analysis/1. S02-L01 -- What is Algo Run Time Analysis.vtt | 3.07KB 3. S02 -- Algorithm Run Time Analysis/2. S02-L02 -- What are Notations.mp4 | 75.41MB 3. S02 -- Algorithm Run Time Analysis/2. S02-L02 -- What are Notations.vtt | 9.61KB 3. S02 -- Algorithm Run Time Analysis/3. S02-L03 -- Examples of Notations.mp4 | 28.39MB 3. S02 -- Algorithm Run Time Analysis/3. S02-L03 -- Examples of Notations.vtt | 7.15KB 3. S02 -- Algorithm Run Time Analysis/4. S02-L04 -- Examples of Time Complexity.mp4 | 34.63MB 3. S02 -- Algorithm Run Time Analysis/4. S02-L04 -- Examples of Time Complexity.vtt | 6.11KB 3. S02 -- Algorithm Run Time Analysis/5. S02-L05 -- Finding Time Complexity of Iterative Algo.mp4 | 39.52MB 3. S02 -- Algorithm Run Time Analysis/5. S02-L05 -- Finding Time Complexity of Iterative Algo.vtt | 7.31KB 3. S02 -- Algorithm Run Time Analysis/6. S02-L06 -- Finding Time Complexity of Recursive Algo#1.mp4 | 45.05MB 3. S02 -- Algorithm Run Time Analysis/6. S02-L06 -- Finding Time Complexity of Recursive Algo#1.vtt | 10.80KB 3. S02 -- Algorithm Run Time Analysis/7. S02-L07 -- Finding Time Complexity of Recursive Algo#2.mp4 | 76.98MB 3. S02 -- Algorithm Run Time Analysis/7. S02-L07 -- Finding Time Complexity of Recursive Algo#2.vtt | 17.00KB 4. S03 -- Array/1. S03 - L01 -- What and Why of Array.mp4 | 36.20MB 4. S03 -- Array/1. S03 - L01 -- What and Why of Array.vtt | 7.99KB 4. S03 -- Array/10. S03 - L10 -- 2D Array operations.mp4 | 57.94MB 4. S03 -- Array/10. S03 - L10 -- 2D Array operations.vtt | 13.81KB 4. S03 -- Array/11. S03 - L11 -- Time Complexity of 2D Array.mp4 | 15.40MB 4. S03 -- Array/11. S03 - L11 -- Time Complexity of 2D Array.vtt | 2.78KB 4. S03 -- Array/12. S03 - L12 -- When to use Array.mp4 | 18.46MB 4. S03 -- Array/12. S03 - L12 -- When to use Array.vtt | 5.75KB 4. S03 -- Array/13. S03 - L13 -- Code 2D Array.mp4 | 112.41MB 4. S03 -- Array/13. S03 - L13 -- Code 2D Array.vtt | 15.08KB 4. S03 -- Array/13.1 2DimentionalArray.zip.zip | 1.63KB 4. S03 -- Array/14. S03 - L14 -- Practical uses of Array.mp4 | 31.97MB 4. S03 -- Array/14. S03 - L14 -- Practical uses of Array.vtt | 6.76KB 4. S03 -- Array/2. S03 - L02 -- Types of Array.mp4 | 52.75MB 4. S03 -- Array/2. S03 - L02 -- Types of Array.vtt | 6.88KB 4. S03 -- Array/3. S03 - L03 -- How is Array represented in Memory.mp4 | 36.80MB 4. S03 -- Array/3. S03 - L03 -- How is Array represented in Memory.vtt | 5.88KB 4. S03 -- Array/4. S03 - L04 -- Create an Array.mp4 | 60.68MB 4. S03 -- Array/4. S03 - L04 -- Create an Array.vtt | 10.21KB 4. S03 -- Array/5. S03 - L05 -- Insert Traverse in 1D Array.mp4 | 24.61MB 4. S03 -- Array/5. S03 - L05 -- Insert Traverse in 1D Array.vtt | 6.61KB 4. S03 -- Array/6. S03 - L06 -- Access Search Delete in 1D Array.mp4 | 63.12MB 4. S03 -- Array/6. S03 - L06 -- Access Search Delete in 1D Array.vtt | 16.53KB 4. S03 -- Array/7. S03 - L07 -- Code 1D Array.mp4 | 93.32MB 4. S03 -- Array/7. S03 - L07 -- Code 1D Array.vtt | 13.63KB 4. S03 -- Array/7.1 SingleDimentionalArray.zip.zip | 1.68KB 4. S03 -- Array/8. S03 - L08 -- Time Complexity of 1D Array.mp4 | 19.71MB 4. S03 -- Array/8. S03 - L08 -- Time Complexity of 1D Array.vtt | 4.14KB 4. S03 -- Array/9. S03 - L09 -- Create 2D Array.mp4 | 48.76MB 4. S03 -- Array/9. S03 - L09 -- Create 2D Array.vtt | 8.34KB 5. S04 -- Linked List/1. S04 - L01 -- What is linked list.mp4 | 42.34MB 5. S04 -- Linked List/1. S04 - L01 -- What is linked list.vtt | 8.23KB 5. S04 -- Linked List/10. S04 - L10 -- Traversal of SLL.mp4 | 14.71MB 5. S04 -- Linked List/10. S04 - L10 -- Traversal of SLL.vtt | 3.52KB 5. S04 -- Linked List/11. S04 - L11 -- Search node in SLL.mp4 | 20.35MB 5. S04 -- Linked List/11. S04 - L11 -- Search node in SLL.vtt | 5.27KB 5. S04 -- Linked List/12. S04 - L12 -- Deletion of node from SLL - Dry Run.mp4 | 39.77MB 5. S04 -- Linked List/12. S04 - L12 -- Deletion of node from SLL - Dry Run.vtt | 9.35KB 5. S04 -- Linked List/13. S04 - L13 -- Deletion of node from SLL - Algo.mp4 | 55.27MB 5. S04 -- Linked List/13. S04 - L13 -- Deletion of node from SLL - Algo.vtt | 8.47KB 5. S04 -- Linked List/14. S04 - L14 -- Delete entire SLL.mp4 | 11.61MB 5. S04 -- Linked List/14. S04 - L14 -- Delete entire SLL.vtt | 3.11KB 5. S04 -- Linked List/15. S04 - L15 -- Time Complexity of SLL.mp4 | 19.05MB 5. S04 -- Linked List/15. S04 - L15 -- Time Complexity of SLL.vtt | 3.56KB 5. S04 -- Linked List/15.1 LinkedList.zip.zip | 13.12KB 5. S04 -- Linked List/16. S04 - L16 -- Creation of Circular Single LinkedList (CSLL).mp4 | 16.02MB 5. S04 -- Linked List/16. S04 - L16 -- Creation of Circular Single LinkedList (CSLL).vtt | 4.30KB 5. S04 -- Linked List/17. S04 - L17 -- Insertion of data in CSLL - Dry Run.mp4 | 27.74MB 5. S04 -- Linked List/17. S04 - L17 -- Insertion of data in CSLL - Dry Run.vtt | 5.97KB 5. S04 -- Linked List/18. S04 - L18 -- Insertion of data in CSLL - Algo.mp4 | 44.14MB 5. S04 -- Linked List/18. S04 - L18 -- Insertion of data in CSLL - Algo.vtt | 44.16MB 5. S04 -- Linked List/19. S04 - L19 -- Traverse CSLL.mp4 | 10.12MB 5. S04 -- Linked List/19. S04 - L19 -- Traverse CSLL.vtt | 2.58KB 5. S04 -- Linked List/2. S04 - L02 -- Linked list vs Array.mp4 | 19.29MB 5. S04 -- Linked List/2. S04 - L02 -- Linked list vs Array.vtt | 3.15KB 5. S04 -- Linked List/20. S04 - L20 -- Search a node in CSLL.mp4 | 19.93MB 5. S04 -- Linked List/20. S04 - L20 -- Search a node in CSLL.vtt | 5.41KB 5. S04 -- Linked List/21. S04 - L21 -- Delete a node from CSLL - Dry Run.mp4 | 23.48MB 5. S04 -- Linked List/21. S04 - L21 -- Delete a node from CSLL - Dry Run.vtt | 5.21KB 5. S04 -- Linked List/22. S04 - L22 -- Deletion of node from CSLL - Algo.mp4 | 47.85MB 5. S04 -- Linked List/22. S04 - L22 -- Deletion of node from CSLL - Algo.vtt | 6.94KB 5. S04 -- Linked List/23. S04 - L23 -- Deletion of entire CSLL.mp4 | 15.20MB 5. S04 -- Linked List/23. S04 - L23 -- Deletion of entire CSLL.vtt | 4.16KB 5. S04 -- Linked List/24. S04 - L24 -- Time Complexity of CSLL.mp4 | 24.19MB 5. S04 -- Linked List/24. S04 - L24 -- Time Complexity of CSLL.vtt | 4.13KB 5. S04 -- Linked List/24.1 LinkedList.zip.zip | 13.12KB 5. S04 -- Linked List/25. S04 - L25 -- Create Double Linked List (DLL).mp4 | 25.62MB 5. S04 -- Linked List/25. S04 - L25 -- Create Double Linked List (DLL).vtt | 5.80KB 5. S04 -- Linked List/26. S04 - L26 -- Insert node in DLL - Dry Run.mp4 | 35.06MB 5. S04 -- Linked List/26. S04 - L26 -- Insert node in DLL - Dry Run.vtt | 7.78KB 5. S04 -- Linked List/27. S04 - L27 -- Insert node in DLL - Algo.mp4 | 76.56MB 5. S04 -- Linked List/27. S04 - L27 -- Insert node in DLL - Algo.vtt | 13.34KB 5. S04 -- Linked List/28. S04 - L28 -- Traverse DLL.mp4 | 9.39MB 5. S04 -- Linked List/28. S04 - L28 -- Traverse DLL.vtt | 2.50KB 5. S04 -- Linked List/29. S04 - L29 -- Reverse Traversal of DLL.mp4 | 13.29MB 5. S04 -- Linked List/29. S04 - L29 -- Reverse Traversal of DLL.vtt | 3.43KB 5. S04 -- Linked List/3. S04 - L03 -- Components of LinkedList.mp4 | 26.21MB 5. S04 -- Linked List/3. S04 - L03 -- Components of LinkedList.vtt | 6.41KB 5. S04 -- Linked List/30. S04 - L30 -- Search a node in DLL.mp4 | 13.11MB 5. S04 -- Linked List/30. S04 - L30 -- Search a node in DLL.vtt | 3.51KB 5. S04 -- Linked List/31. S04 - L31 -- Delete a node from DLL - Dry Run.mp4 | 29.51MB 5. S04 -- Linked List/31. S04 - L31 -- Delete a node from DLL - Dry Run.vtt | 7.37KB 5. S04 -- Linked List/32. S04 - L32 -- Delete a node from DLL - Algo.mp4 | 65.49MB 5. S04 -- Linked List/32. S04 - L32 -- Delete a node from DLL - Algo.vtt | 9.67KB 5. S04 -- Linked List/33. S04 - L33 -- Delete entire DLL.mp4 | 17.51MB 5. S04 -- Linked List/33. S04 - L33 -- Delete entire DLL.vtt | 4.73KB 5. S04 -- Linked List/34. S04 - L34 -- Time Complexity of DLL.mp4 | 21.30MB 5. S04 -- Linked List/34. S04 - L34 -- Time Complexity of DLL.vtt | 4.14KB 5. S04 -- Linked List/34.1 LinkedList.zip.zip | 13.12KB 5. S04 -- Linked List/35. S04 - L35 -- Create Double Circular LinkedList (CDLL).mp4 | 34.19MB 5. S04 -- Linked List/35. S04 - L35 -- Create Double Circular LinkedList (CDLL).vtt | 7.68KB 5. S04 -- Linked List/36. S04 - L36 -- Insert node in CDLL - Dry Run.mp4 | 51.10MB 5. S04 -- Linked List/36. S04 - L36 -- Insert node in CDLL - Dry Run.vtt | 10.47KB 5. S04 -- Linked List/37. S04 - L37 -- Insert node in CDLL - Algo.mp4 | 59.92MB 5. S04 -- Linked List/37. S04 - L37 -- Insert node in CDLL - Algo.vtt | 9.54KB 5. S04 -- Linked List/38. S04 - L38 -- Traverse CDLL.mp4 | 14.00MB 5. S04 -- Linked List/38. S04 - L38 -- Traverse CDLL.vtt | 3.35KB 5. S04 -- Linked List/39. S04 - L39 -- Reverse traverse CDLL.mp4 | 14.06MB 5. S04 -- Linked List/39. S04 - L39 -- Reverse traverse CDLL.vtt | 3.26KB 5. S04 -- Linked List/4. S04 - L04 -- Types of LinkedList.mp4 | 33.01MB 5. S04 -- Linked List/4. S04 - L04 -- Types of LinkedList.vtt | 6.38KB 5. S04 -- Linked List/40. S04 - L40 -- Search a node in CDLL.mp4 | 18.36MB 5. S04 -- Linked List/40. S04 - L40 -- Search a node in CDLL.vtt | 4.85KB 5. S04 -- Linked List/41. S04 - L41 -- Delete a node from CDLL - Dry Run.mp4 | 38.40MB 5. S04 -- Linked List/41. S04 - L41 -- Delete a node from CDLL - Dry Run.vtt | 8.05KB 5. S04 -- Linked List/42. S04 - L42 -- Delete a node from CDLL - Algo.mp4 | 77.40MB 5. S04 -- Linked List/42. S04 - L42 -- Delete a node from CDLL - Algo.vtt | 10.17KB 5. S04 -- Linked List/43. S04 - L43 -- Delete entire CDLL.mp4 | 25.03MB 5. S04 -- Linked List/43. S04 - L43 -- Delete entire CDLL.vtt | 6.16KB 5. S04 -- Linked List/44. S04 - L44 -- Time Complexity of CDLL.mp4 | 23.99MB 5. S04 -- Linked List/44. S04 - L44 -- Time Complexity of CDLL.vtt | 4.18KB 5. S04 -- Linked List/44.1 LinkedList.zip.zip | 13.12KB 5. S04 -- Linked List/45. S04 - L45 -- SLL vs CSLL vs DLL vs DLL.mp4 | 50.79MB 5. S04 -- Linked List/45. S04 - L45 -- SLL vs CSLL vs DLL vs DLL.vtt | 6.76KB 5. S04 -- Linked List/46. S04 - L46 -- Practical uses of LinkedList.mp4 | 35.92MB 5. S04 -- Linked List/46. S04 - L46 -- Practical uses of LinkedList.vtt | 4.97KB 5. S04 -- Linked List/5. S04 - L05 -- Why so many types of LinkedList.mp4 | 57.21MB 5. S04 -- Linked List/5. S04 - L05 -- Why so many types of LinkedList.vtt | 7.78KB 5. S04 -- Linked List/6. S04 - L06 -- How is LinkedList stored in Memory.mp4 | 24.34MB 5. S04 -- Linked List/6. S04 - L06 -- How is LinkedList stored in Memory.vtt | 4.43KB 5. S04 -- Linked List/7. S04 - L07 -- Creation of Single LinkedList (SLL).mp4 | 19.65MB 5. S04 -- Linked List/7. S04 - L07 -- Creation of Single LinkedList (SLL).vtt | 5.77KB 5. S04 -- Linked List/8. S04 - L08 -- Insertion in SLL - Dry Run.mp4 | 32.34MB 5. S04 -- Linked List/8. S04 - L08 -- Insertion in SLL - Dry Run.vtt | 6.85KB 5. S04 -- Linked List/9. S04 - L09 -- Insertion in SLL - Algo.mp4 | 66.72MB 5. S04 -- Linked List/9. S04 - L09 -- Insertion in SLL - Algo.vtt | 10.64KB 6. S05 -- Stack/1. L01 -- What and Why of Stack.mp4 | 27.82MB 6. S05 -- Stack/1. L01 -- What and Why of Stack.vtt | 5.33KB 6. S05 -- Stack/2. L02 -- ARRAY - Create & Push.mp4 | 22.64MB 6. S05 -- Stack/2. L02 -- ARRAY - Create & Push.vtt | 7.29KB 6. S05 -- Stack/3. L03 -- ARRAY - Pop, Peek, isEmpty, isFull, Delete.mp4 | 30.38MB 6. S05 -- Stack/3. L03 -- ARRAY - Pop, Peek, isEmpty, isFull, Delete.vtt | 8.80KB 6. S05 -- Stack/3.1 Stack.zip.zip | 15.46KB 6. S05 -- Stack/4. L04 -- LinkedList - Create, Push, Pop.mp4 | 28.73MB 6. S05 -- Stack/4. L04 -- LinkedList - Create, Push, Pop.vtt | 7.64KB 6. S05 -- Stack/5. L05 -- LinkedList - Peek, Delete.mp4 | 23.86MB 6. S05 -- Stack/5. L05 -- LinkedList - Peek, Delete.vtt | 6.10KB 6. S05 -- Stack/5.1 Stack.zip.zip | 15.46KB 6. S05 -- Stack/6. L06 -- When to use or avoid Stack.mp4 | 12.85MB 6. S05 -- Stack/6. L06 -- When to use or avoid Stack.vtt | 4.14KB 7. S06 -- Queue/1. S06 - L01 -- What and Why of Queue.mp4 | 27.87MB 7. S06 -- Queue/1. S06 - L01 -- What and Why of Queue.vtt | 4.46KB 7. S06 -- Queue/10. S06 - L10 -- LINEAR QUEUE(LL) - Peek, isEmpty, Delete.mp4 | 17.50MB 7. S06 -- Queue/10. S06 - L10 -- LINEAR QUEUE(LL) - Peek, isEmpty, Delete.vtt | 4.79KB 7. S06 -- Queue/10.1 LinearQueue_LinkedList.zip.zip | 7.21KB 7. S06 -- Queue/11. S06 - L11 -- Array vs LinkedList Implementation.mp4 | 22.59MB 7. S06 -- Queue/11. S06 - L11 -- Array vs LinkedList Implementation.vtt | 4.96KB 7. S06 -- Queue/2. S06 - L02 -- LINEAR QUEUE(Array) - Create, Enqueue.mp4 | 25.57MB 7. S06 -- Queue/2. S06 - L02 -- LINEAR QUEUE(Array) - Create, Enqueue.vtt | 7.97KB 7. S06 -- Queue/3. S06 - L03 -- LINEAR QUEUE((Array)) - deQueue, isEmpty, isFull, Delete.mp4 | 31.08MB 7. S06 -- Queue/3. S06 - L03 -- LINEAR QUEUE((Array)) - deQueue, isEmpty, isFull, Delete.vtt | 8.61KB 7. S06 -- Queue/3.1 LinearQueueArray.zip.zip | 1.40KB 7. S06 -- Queue/4. S06 - L04 -- Why Circular Queue.mp4 | 17.80MB 7. S06 -- Queue/4. S06 - L04 -- Why Circular Queue.vtt | 5.16KB 7. S06 -- Queue/5. S06 - L05 -- CIRCULAR QUEUE(Array) - Enqueue.mp4 | 24.46MB 7. S06 -- Queue/5. S06 - L05 -- CIRCULAR QUEUE(Array) - Enqueue.vtt | 6.70KB 7. S06 -- Queue/6. S06 - L06 -- CIRCULAR QUEUE(Array) - Dequeue.mp4 | 18.04MB 7. S06 -- Queue/6. S06 - L06 -- CIRCULAR QUEUE(Array) - Dequeue.vtt | 3.70KB 7. S06 -- Queue/7. S06 - L07 -- CIRCULAR QUEUE(Array) - Peek, isEmpty, isFull, Delete.mp4 | 23.95MB 7. S06 -- Queue/7. S06 - L07 -- CIRCULAR QUEUE(Array) - Peek, isEmpty, isFull, Delete.vtt | 6.07KB 7. S06 -- Queue/7.1 CircularQueueArray.zip.zip | 1.66KB 7. S06 -- Queue/8. S06 - L08 -- LINEAR QUEUE(LL) - Enqueue.mp4 | 27.17MB 7. S06 -- Queue/8. S06 - L08 -- LINEAR QUEUE(LL) - Enqueue.vtt | 6.56KB 7. S06 -- Queue/9. S06 - L09 -- LINEAR QUEUE(LL) - DeQueue.mp4 | 15.87MB 7. S06 -- Queue/9. S06 - L09 -- LINEAR QUEUE(LL) - DeQueue.vtt | 3.72KB 8. S08.01 -- Binary Tree/1. S08.01 - L01 -- What is Tree.mp4 | 38.56MB 8. S08.01 -- Binary Tree/1. S08.01 - L01 -- What is Tree.vtt | 8.75KB 8. S08.01 -- Binary Tree/10. S08.01 - L09 -- In-order traversal Binary Tree(LL).mp4 | 29.15MB 8. S08.01 -- Binary Tree/10. S08.01 - L09 -- In-order traversal Binary Tree(LL).vtt | 6.24KB 8. S08.01 -- Binary Tree/11. S08.01 - L10 -- Post-order traversal Binary Tree(LL).mp4 | 28.58MB 8. S08.01 -- Binary Tree/11. S08.01 - L10 -- Post-order traversal Binary Tree(LL).vtt | 6.35KB 8. S08.01 -- Binary Tree/12. S08.01 - L11 -- Level-order traversal Binary Tree(LL).mp4 | 35.90MB 8. S08.01 -- Binary Tree/12. S08.01 - L11 -- Level-order traversal Binary Tree(LL).vtt | 7.63KB 8. S08.01 -- Binary Tree/13. S08.01 - L12 -- Search for value in Binary Tree(LL).mp4 | 35.66MB 8. S08.01 -- Binary Tree/13. S08.01 - L12 -- Search for value in Binary Tree(LL).vtt | 8.05KB 8. S08.01 -- Binary Tree/14. S08.01 - L13 -- Insert value in Binary Tree(LL).mp4 | 25.19MB 8. S08.01 -- Binary Tree/14. S08.01 - L13 -- Insert value in Binary Tree(LL).vtt | 6.34KB 8. S08.01 -- Binary Tree/15. S08.01 - L14 -- Delete value from Binary Tree(LL).mp4 | 29.19MB 8. S08.01 -- Binary Tree/15. S08.01 - L14 -- Delete value from Binary Tree(LL).vtt | 6.86KB 8. S08.01 -- Binary Tree/16. S08.01 - L15 -- Delete Binary Tree(LL).mp4 | 14.86MB 8. S08.01 -- Binary Tree/16. S08.01 - L15 -- Delete Binary Tree(LL).vtt | 4.10KB 8. S08.01 -- Binary Tree/17. S08.01 - L16 -- Create Binary Tree(Array).mp4 | 19.65MB 8. S08.01 -- Binary Tree/17. S08.01 - L16 -- Create Binary Tree(Array).vtt | 5.04KB 8. S08.01 -- Binary Tree/18. S08.01 - L17 -- Insert value in Binary Tree(Array).mp4 | 26.68MB 8. S08.01 -- Binary Tree/18. S08.01 - L17 -- Insert value in Binary Tree(Array).vtt | 5.76KB 8. S08.01 -- Binary Tree/19. S08.01 - L18 -- Search for value in Binary Tree(Array).mp4 | 16.06MB 8. S08.01 -- Binary Tree/19. S08.01 - L18 -- Search for value in Binary Tree(Array).vtt | 3.61KB 8. S08.01 -- Binary Tree/2. S08.01 - L02 -- Why learn Tree.mp4 | 8.63MB 8. S08.01 -- Binary Tree/2. S08.01 - L02 -- Why learn Tree.vtt | 1.95KB 8. S08.01 -- Binary Tree/20. S08.01 - L19 -- Inorder traversal of Binary Tree(Array).mp4 | 31.84MB 8. S08.01 -- Binary Tree/20. S08.01 - L19 -- Inorder traversal of Binary Tree(Array).vtt | 5.85KB 8. S08.01 -- Binary Tree/21. S08.01 - L20 -- Pre-order traversal of Binary Tree(Array).mp4 | 19.18MB 8. S08.01 -- Binary Tree/21. S08.01 - L20 -- Pre-order traversal of Binary Tree(Array).vtt | 3.88KB 8. S08.01 -- Binary Tree/22. S08.01 - L21 -- Post-order traversal of Binary Tree(Array).mp4 | 21.83MB 8. S08.01 -- Binary Tree/22. S08.01 - L21 -- Post-order traversal of Binary Tree(Array).vtt | 4.71KB 8. S08.01 -- Binary Tree/23. S08.01 - L22 -- Level-order traversal of Binary Tree(Array).mp4 | 11.19MB 8. S08.01 -- Binary Tree/23. S08.01 - L22 -- Level-order traversal of Binary Tree(Array).vtt | 2.74KB 8. S08.01 -- Binary Tree/24. S08.01 - L23 -- Delete node from Binary Tree(Array).mp4 | 24.94MB 8. S08.01 -- Binary Tree/24. S08.01 - L23 -- Delete node from Binary Tree(Array).vtt | 5.65KB 8. S08.01 -- Binary Tree/25. S08.01 - L24 -- Delete Binary Tree(Array).mp4 | 14.53MB 8. S08.01 -- Binary Tree/25. S08.01 - L24 -- Delete Binary Tree(Array).vtt | 3.45KB 8. S08.01 -- Binary Tree/25.1 BinaryTree.zip.zip | 8.25KB 8. S08.01 -- Binary Tree/26. S08.01 - L25 -- Binary Tree (Array vs Linked List).mp4 | 30.66MB 8. S08.01 -- Binary Tree/26. S08.01 - L25 -- Binary Tree (Array vs Linked List).vtt | 4.47KB 8. S08.01 -- Binary Tree/3. S08.01 - L03 -- Tree Terminologies - Part#1.mp4 | 40.41MB 8. S08.01 -- Binary Tree/3. S08.01 - L03 -- Tree Terminologies - Part#1.vtt | 8.44KB 8. S08.01 -- Binary Tree/4. S08.01 - L03 -- Tree Terminologies - Part#2.mp4 | 19.70MB 8. S08.01 -- Binary Tree/4. S08.01 - L03 -- Tree Terminologies - Part#2.vtt | 4.28KB 8. S08.01 -- Binary Tree/5. S08.01 - L04 -- What & Why of Binary Ttree.mp4 | 14.12MB 8. S08.01 -- Binary Tree/5. S08.01 - L04 -- What & Why of Binary Ttree.vtt | 3.73KB 8. S08.01 -- Binary Tree/6. S08.01 - L05 -- Types of Binary Tree.mp4 | 24.31MB 8. S08.01 -- Binary Tree/6. S08.01 - L05 -- Types of Binary Tree.vtt | 5.13KB 8. S08.01 -- Binary Tree/7. S08.01 - L06 -- How is Tree Represented in Code.mp4 | 38.34MB 8. S08.01 -- Binary Tree/7. S08.01 - L06 -- How is Tree Represented in Code.vtt | 7.97KB 8. S08.01 -- Binary Tree/8. S08.01 - L07 -- Create blank Binary Tree(LL).mp4 | 9.08MB 8. S08.01 -- Binary Tree/8. S08.01 - L07 -- Create blank Binary Tree(LL).vtt | 3.01KB 8. S08.01 -- Binary Tree/9. S08.01 - L08 -- Pre-order traversal Binary Tree(LL).mp4 | 76.12MB 8. S08.01 -- Binary Tree/9. S08.01 - L08 -- Pre-order traversal Binary Tree(LL).vtt | 14.57KB 9. S08.02 -- Binary Search Tree (BST)/1. S08.02 - L01 -- What & Why of BST.mp4 | 18.39MB 9. S08.02 -- Binary Search Tree (BST)/1. S08.02 - L01 -- What & Why of BST.vtt | 4.34KB 9. S08.02 -- Binary Search Tree (BST)/2. S08.02 - L02 -- Creation & Searching in BST.mp4 | 40.19MB 9. S08.02 -- Binary Search Tree (BST)/2. S08.02 - L02 -- Creation & Searching in BST.vtt | 10.27KB 9. S08.02 -- Binary Search Tree (BST)/3. S08.02 - L03 -- Traversing a BST.mp4 | 31.95MB 9. S08.02 -- Binary Search Tree (BST)/3. S08.02 - L03 -- Traversing a BST.vtt | 7.73KB 9. S08.02 -- Binary Search Tree (BST)/4. S08.02 - L04 -- Inserting a node in BST.mp4 | 70.09MB 9. S08.02 -- Binary Search Tree (BST)/4. S08.02 - L04 -- Inserting a node in BST.vtt | 13.17KB 9. S08.02 -- Binary Search Tree (BST)/5. S08.02 - L05 -- Deleting a node from BST.mp4 | 80.93MB 9. S08.02 -- Binary Search Tree (BST)/5. S08.02 - L05 -- Deleting a node from BST.vtt | 14.76KB 9. S08.02 -- Binary Search Tree (BST)/6. S08.02 - L06 -- Deleting a BST.mp4 | 13.47MB 9. S08.02 -- Binary Search Tree (BST)/6. S08.02 - L06 -- Deleting a BST.vtt | 3.51KB 9. S08.02 -- Binary Search Tree (BST)/6.1 BST.zip.zip | 6.91KB