FreeAllCourse Com Udemy Data Structures Algorithms | FA3F54481C6B4863BBC7AAE18E82BDF8CFB5AAE9

FreeAllCourse Com Udemy Data Structures Algorithms

Name	[FreeAllCourse.Com] Udemy - Data Structures & Algorithms !	DOWNLOAD Copy Link
Total Size	8.8 GB
Total Files	536
Hash	FA3F54481C6B4863BBC7AAE18E82BDF8CFB5AAE9

/1. S01 -- Introduction to Data Structure & Algorithms/
1. S01 - L01 -- Course Breakdown.mp4	28.4 MB
1. S01 - L01 -- Course Breakdown.vtt	7.9 KB
2. S01 - L02 -- What is DS and Algo.mp4	39.7 MB
2. S01 - L02 -- What is DS and Algo.vtt	4.9 KB
3. S01 - L03 -- Why companies ask DS.mp4	17.1 MB
3. S01 - L03 -- Why companies ask DS.vtt	3.9 KB
4. S01 - L04 -- DS in every day life.mp4	21.7 MB
4. S01 - L04 -- DS in every day life.vtt	3.8 KB
5. S01 - L05 -- Types of DS.mp4	10.8 MB
5. S01 - L05 -- Types of DS.vtt	3.8 KB
6. QUIZ-Introduction.html	0.2 KB
/10. S08.03 -- AVL Tree/
1. S08.03 - L01 -- Why learn AVL Tree.mp4	26.9 MB
1. S08.03 - L01 -- Why learn AVL Tree.vtt	6.6 KB
10. S08.03 - L10 -- Delete LL LR RR RL.mp4	41.7 MB
10. S08.03 - L10 -- Delete LL LR RR RL.vtt	11.8 KB
11. S08.03 - L11 -- Delete End to End Case.mp4	67.3 MB
11. S08.03 - L11 -- Delete End to End Case.vtt	12.5 KB
12. S08.03 - L12 -- Delete AVL Tree & Tree Comparison.mp4	29.5 MB
12. S08.03 - L12 -- Delete AVL Tree & Tree Comparison.vtt	7.4 KB
12.1 AVL.zip.zip	7.4 KB
2. S08.03 - L02 -- What is AVL Tree.mp4	38.0 MB
2. S08.03 - L02 -- What is AVL Tree.vtt	10.2 KB
3. S08.03 - L03 -- Create Search Traverse AVL Tree.mp4	24.4 MB
3. S08.03 - L03 -- Create Search Traverse AVL Tree.vtt	6.9 KB
4. S08.03 - L04 -- Insert in AVL_LL Theory.mp4	40.1 MB
4. S08.03 - L04 -- Insert in AVL_LL Theory.vtt	13.5 KB
5. S08.03 - L05 -- Insert in AVL_LL Algorithm.mp4	21.6 MB
5. S08.03 - L05 -- Insert in AVL_LL Algorithm.vtt	5.1 KB
6. S08.03 - L06 -- Insert in AVL LR.mp4	36.1 MB
6. S08.03 - L06 -- Insert in AVL LR.vtt	8.2 KB
7. S08.03 - L07 -- Insert in AVL RR.mp4	32.6 MB
7. S08.03 - L07 -- Insert in AVL RR.vtt	9.0 KB
8. S08.03 - L08 -- Insert in AVL RL.mp4	25.0 MB
8. S08.03 - L08 -- Insert in AVL RL.vtt	6.5 KB
9. S08.03 - L09 -- Insert End to End Case.mp4	67.3 MB
9. S08.03 - L09 -- Insert End to End Case.vtt	14.7 KB
/11. S08.04 -- Binary Heap/
1. S08.04 - L01 -- What Why and Type of Heap.mp4	51.4 MB
1. S08.04 - L01 -- What Why and Type of Heap.vtt	12.6 KB
2. S08.04 - L02 -- Create, Peek, Size of Heap.mp4	17.6 MB
2. S08.04 - L02 -- Create, Peek, Size of Heap.vtt	5.0 KB
3. S08.04 - L03 -- Insert element in Heap.mp4	19.8 MB
3. S08.04 - L03 -- Insert element in Heap.vtt	5.7 KB
4. S08.04 - L04 -- Extract and Delete from Heap.mp4	20.6 MB
4. S08.04 - L04 -- Extract and Delete from Heap.vtt	6.6 KB
4.1 Heap.zip.zip	1.9 KB
5. S08.04 - L05 -- Why avoid Reference based implementation .mp4	16.1 MB
5. S08.04 - L05 -- Why avoid Reference based implementation .vtt	4.0 KB
/12. S08.05 -- Trie/
1. S08.05 - L01 -- What and Why of Trie.mp4	31.0 MB
1. S08.05 - L01 -- What and Why of Trie.vtt	6.7 KB
2. S08.05 - L02 -- Create Insert in Trie.mp4	35.7 MB
2. S08.05 - L02 -- Create Insert in Trie.vtt	7.7 KB
3. S08.05 - L03 -- Search a String in Trie.mp4	12.7 MB
3. S08.05 - L03 -- Search a String in Trie.vtt	3.2 KB
4. S08.05 - L04 -- Delete a String from Trie.mp4	44.9 MB
4. S08.05 - L04 -- Delete a String from Trie.vtt	8.4 KB
4.1 Trie.zip.zip	1.8 KB
5. S08.05 - L05 -- Practical Uses of Trie.mp4	21.6 MB
5. S08.05 - L05 -- Practical Uses of Trie.vtt	3.0 KB
/13. S09 -- Hashing/
1. S09 - L01 -- Introduction to Hashing.mp4	5.8 MB
1. S09 - L01 -- Introduction to Hashing.vtt	3.7 KB
2. S09 - L02 -- Why learn Hashing .mp4	9.3 MB
2. S09 - L02 -- Why learn Hashing .vtt	5.2 KB
3. S09 - L03 -- Introduction to Hash Functions.mp4	14.5 MB
3. S09 - L03 -- Introduction to Hash Functions.vtt	8.5 KB
4. S09 - L04 -- Types of Collision Resolution Techniques.mp4	25.5 MB
4. S09 - L04 -- Types of Collision Resolution Techniques.vtt	14.7 KB
5. S09 - L05 -- What happens when Hash Table is full .mp4	7.4 MB
5. S09 - L05 -- What happens when Hash Table is full .vtt	4.9 KB
6. S09 - L06 -- Collision Resolution Techniques Compared.mp4	14.3 MB
6. S09 - L06 -- Collision Resolution Techniques Compared.vtt	9.3 KB
7. S09 - L07 -- Practical Use of Hashing.mp4	11.9 MB
7. S09 - L07 -- Practical Use of Hashing.vtt	6.7 KB
8. S09 - L08 -- Hashing vs Other DS.mp4	8.2 MB
8. S09 - L08 -- Hashing vs Other DS.vtt	4.7 KB
8.1 Hashing.zip.zip	12.9 KB
/14. S10 -- Sorting/
1. S10 - L01 -- What and Why of Sorting.mp4	15.9 MB
1. S10 - L01 -- What and Why of Sorting.vtt	4.5 KB
10. S10 - L09 -- Quick Sort Part#2.mp4	29.6 MB
10. S10 - L09 -- Quick Sort Part#2.vtt	6.9 KB
10.1 QuickSort.zip.zip	1.0 KB
11. S10 - L10 -- HeapSort.mp4	62.8 MB
11. S10 - L10 -- HeapSort.vtt	15.5 KB
11.1 HeapSort.zip.zip	2.4 KB
12. S10 - L11 -- Sorting Techniques compared.mp4	9.3 MB
12. S10 - L11 -- Sorting Techniques compared.vtt	2.6 KB
2. S10 - L02 -- Types of Sorting Techniques.mp4	37.6 MB
2. S10 - L02 -- Types of Sorting Techniques.vtt	7.8 KB
3. S10 - L03 -- Sorting Terminologies.mp4	19.7 MB
3. S10 - L03 -- Sorting Terminologies.vtt	5.7 KB
4. S10 - L04 -- Bubble Sort.mp4	30.8 MB
4. S10 - L04 -- Bubble Sort.vtt	9.4 KB
4.1 BubbleSort.zip.zip	1.0 KB
5. S10 - L05 -- Selection Sort.mp4	23.7 MB
5. S10 - L05 -- Selection Sort.vtt	7.0 KB
5.1 SelectionSort.zip.zip	1.0 KB
6. S10 - L06 -- Insertion Sort.mp4	34.1 MB
6. S10 - L06 -- Insertion Sort.vtt	10.9 KB
6.1 InsertionSort.zip.zip	1.0 KB
7. S10 - L07 -- Bucket Sort.mp4	48.3 MB
7. S10 - L07 -- Bucket Sort.vtt	9.7 KB
7.1 BucketSort.zip.zip	1.5 KB
8. S10 - L08 -- Merge Sort.mp4	48.2 MB
8. S10 - L08 -- Merge Sort.vtt	13.5 KB
8.1 MergeSort.zip.zip	1.2 KB
9. S10 - L09 -- Quick Sort Part#1.mp4	64.5 MB
9. S10 - L09 -- Quick Sort Part#1.vtt	15.0 KB
/15. S11 -- Graph/
1. S11 - L01 -- What and Why of Graphs.mp4	45.9 MB
1. S11 - L01 -- What and Why of Graphs.vtt	9.7 KB
10. S11 - L10 -- What is Topological Sort.mp4	16.4 MB
10. S11 - L10 -- What is Topological Sort.vtt	4.3 KB
11. S11 - L11 -- Topological Sort Dry Run.mp4	36.7 MB
11. S11 - L11 -- Topological Sort Dry Run.vtt	6.8 KB
12. S11 - L12 -- Why Topological Sort Works.mp4	38.6 MB
12. S11 - L12 -- Why Topological Sort Works.vtt	7.6 KB
13. S11 - L13 -- Topological Sort Algorithm.mp4	41.6 MB
13. S11 - L13 -- Topological Sort Algorithm.vtt	7.6 KB
13.1 TopologicalSort.zip.zip	5.5 KB
14. S11 - L14 -- What is Single Source Shortest Path Problem(SSSP).mp4	37.1 MB
14. S11 - L14 -- What is Single Source Shortest Path Problem(SSSP).vtt	7.2 KB
15. S11 - L15 -- BFS for SSSP.mp4	53.2 MB
15. S11 - L15 -- BFS for SSSP.vtt	8.5 KB
15.1 BFS.zip.zip	9.3 KB
16. S11 - L16 -- Why BFS does not works for Weighted Graph SSSP.mp4	19.1 MB
16. S11 - L16 -- Why BFS does not works for Weighted Graph SSSP.vtt	4.3 KB
17. S11 - L17 -- Why DFS does not works for SSSP.mp4	12.1 MB
17. S11 - L17 -- Why DFS does not works for SSSP.vtt	3.2 KB
18. S11 - L18 -- Dijkstra for SSSP.mp4	64.6 MB
18. S11 - L18 -- Dijkstra for SSSP.vtt	12.8 KB
18.1 Dijkstra.zip.zip	6.5 KB
19. S11 - L19 -- Why Dijkstra does not work for Negative Cycle.mp4	28.7 MB
19. S11 - L19 -- Why Dijkstra does not work for Negative Cycle.vtt	6.9 KB
2. S11 - L02 -- Graph Terminologies.mp4	23.3 MB
2. S11 - L02 -- Graph Terminologies.vtt	5.6 KB
20. S11 - L20 -- BellmanFord Dry run for SSSP.mp4	69.6 MB
20. S11 - L20 -- BellmanFord Dry run for SSSP.vtt	11.0 KB
21. S11 - L21 -- BellanFord Algorithm for SSSP.mp4	25.5 MB
21. S11 - L21 -- BellanFord Algorithm for SSSP.vtt	5.1 KB
21.1 BellmanFord2.zip.zip	144.0 KB
22. S11 - L22 -- How Bellman Ford works for Negative Cycle.mp4	77.3 MB
22. S11 - L22 -- How Bellman Ford works for Negative Cycle.vtt	9.7 KB
23. S11 - L23 -- Why BellmanFord runs for V-1 times.mp4	62.7 MB
23. S11 - L23 -- Why BellmanFord runs for V-1 times.vtt	10.9 KB
24. S11 - L24 -- BFS vs Dijkstra vs BellmanFord.mp4	31.4 MB
24. S11 - L24 -- BFS vs Dijkstra vs BellmanFord.vtt	5.3 KB
25. S11 - L25 -- What is All Pair Shortest Path Problem(APSP).mp4	40.4 MB
25. S11 - L25 -- What is All Pair Shortest Path Problem(APSP).vtt	6.4 KB
26. S11 - L26 -- Dry run of BFS Dijkstra Bellman for APSP.mp4	25.5 MB
26. S11 - L26 -- Dry run of BFS Dijkstra Bellman for APSP.vtt	6.5 KB
27. S11 - L27 -- Floyd Warshall Algorithm for APSP.mp4	69.0 MB
27. S11 - L27 -- Floyd Warshall Algorithm for APSP.vtt	10.9 KB
27.1 FloydWarshall.zip.zip	82.4 KB
28. S11 - L28 -- Why Floyd Warshall Algorithm always works.mp4	47.5 MB
28. S11 - L28 -- Why Floyd Warshall Algorithm always works.vtt	9.3 KB
29. S11 - L29 -- Why Floyd does not works for Negative Cycle.mp4	17.1 MB
29. S11 - L29 -- Why Floyd does not works for Negative Cycle.vtt	4.2 KB
3. S11 - L03 -- Types of Graphs.mp4	16.4 MB
3. S11 - L03 -- Types of Graphs.vtt	4.3 KB
30. S11 - L30 -- BFS vs Dijkstra vs Bellman vs Floys.mp4	37.2 MB
30. S11 - L30 -- BFS vs Dijkstra vs Bellman vs Floys.vtt	5.2 KB
31. S11 - L31 -- What is Minimum Spanning Tree (MST).mp4	30.0 MB
31. S11 - L31 -- What is Minimum Spanning Tree (MST).vtt	5.1 KB
32. S11 - L32.1 -- DisjointSet.mp4	44.1 MB
32. S11 - L32.1 -- DisjointSet.vtt	10.2 KB
32.1 DisjointSet.zip.zip	6.4 KB
33. S11 - L32.2 -- Kruskals Algorithm.mp4	74.4 MB
33. S11 - L32.2 -- Kruskals Algorithm.vtt	14.0 KB
33.1 Kruskal4.zip.zip	8.3 KB
34. S11 - L33 -- Prims Algorithm Dry Run.mp4	31.4 MB
34. S11 - L33 -- Prims Algorithm Dry Run.vtt	7.5 KB
35. S11 - L34 -- Prims Algorithm Explained.mp4	33.5 MB
35. S11 - L34 -- Prims Algorithm Explained.vtt	6.0 KB
35.1 Prims.zip.zip	6.5 KB
36. S11 - L35 -- Prims vs Kruskal.mp4	11.6 MB
36. S11 - L35 -- Prims vs Kruskal.vtt	3.1 KB
4. S11 - L04 -- Graph Representation in Code.mp4	32.6 MB
4. S11 - L04 -- Graph Representation in Code.vtt	7.5 KB
5. S11 - L05 -- BFS Algorithm.mp4	40.5 MB
5. S11 - L05 -- BFS Algorithm.vtt	9.6 KB
6. S11 - L06 -- BFS Time Complexity.mp4	36.5 MB
6. S11 - L06 -- BFS Time Complexity.vtt	7.3 KB
6.1 BFS.zip.zip	9.3 KB
7. S11 - L07 -- DFS Algorithm.mp4	40.6 MB
7. S11 - L07 -- DFS Algorithm.vtt	9.4 KB
8. S11 - L08 -- DFS Time Complexity.mp4	35.0 MB
8. S11 - L08 -- DFS Time Complexity.vtt	6.4 KB
8.1 DFS.zip.zip	7.4 KB
9. S11 - L09 -- BFS vs DFS.mp4	23.5 MB
9. S11 - L09 -- BFS vs DFS.vtt	4.8 KB
/16. S12.1 -- Magic Framework/
1. S12.1 - L01 -- Magic Framework.mp4	16.5 MB
1. S12.1 - L01 -- Magic Framework.vtt	5.2 KB
/17. S12.2 -- Greedy Algorithm/
1. S12.2 - L01 -- Greedy Algo Introduction.mp4	42.2 MB
1. S12.2 - L01 -- Greedy Algo Introduction.vtt	6.6 KB
2. S12.2 - L02 -- Known Algos.mp4	43.5 MB
2. S12.2 - L02 -- Known Algos.vtt	11.0 KB
3. S12.2 - L03 -- Activity Selection Problem.mp4	37.1 MB
3. S12.2 - L03 -- Activity Selection Problem.vtt	8.9 KB
3.1 ActivitySelection.zip.zip	2.0 KB
4. S12.2 - L04 -- Coin Change Problem.mp4	43.2 MB
4. S12.2 - L04 -- Coin Change Problem.vtt	9.8 KB
4.1 CoinChange.zip.zip	1.1 KB
5. S12.2 - L05 -- Fractional Knapsack Problem.mp4	67.5 MB
5. S12.2 - L05 -- Fractional Knapsack Problem.vtt	12.9 KB
5.1 FractionalKnapsack.zip.zip	2.2 KB
/18. S12.3 -- Divide & Conquer/
1. S12.3 - L01 -- What and Why of Divide&Conquer.mp4	30.8 MB
1. S12.3 - L01 -- What and Why of Divide&Conquer.vtt	8.6 KB
10. S12.3 - L10 -- Longest Palindromic Substring.mp4	50.1 MB
10. S12.3 - L10 -- Longest Palindromic Substring.vtt	9.6 KB
10.1 LongestPalindromicSubstring_DC.zip.zip	4.9 KB
11. S12.3 - L11 -- Min Cost to Reach End of Array.mp4	35.5 MB
11. S12.3 - L11 -- Min Cost to Reach End of Array.vtt	7.7 KB
11.1 MinCostToReachLastCellI_in2DArray_DC.zip.zip	4.8 KB
12. S12.3 - L12 -- Number of Paths to reach last cell with given Cost.mp4	58.0 MB
12. S12.3 - L12 -- Number of Paths to reach last cell with given Cost.vtt	11.3 KB
12.1 NumberOfPathsToReachLastCell_DC.zip.zip	4.8 KB
2. S12.3 - L02 -- Binary Search, Quick, Merge Sortt.mp4	22.6 MB
2. S12.3 - L02 -- Binary Search, Quick, Merge Sortt.vtt	6.5 KB
3. S12.3 - L03 -- Fibonacci Series.mp4	13.2 MB
3. S12.3 - L03 -- Fibonacci Series.vtt	3.8 KB
3.1 Fibonacci_DC.zip.zip	4.5 KB
4. S12.3 - L04 -- Number Factor.mp4	46.6 MB
4. S12.3 - L04 -- Number Factor.vtt	10.3 KB
4.1 Number_Factors_DC.zip.zip	4.6 KB
5. S12.3 - L05 -- House thief.mp4	38.0 MB
5. S12.3 - L05 -- House thief.vtt	9.3 KB
5.1 House_Thieft_DC.zip.zip	4.6 KB
6. S12.3 - L06 -- Convert One String to Another.mp4	62.8 MB
6. S12.3 - L06 -- Convert One String to Another.vtt	13.7 KB
6.1 ConvertOneStringToAnother_DC.zip.zip	4.7 KB
7. S12.3 - L07 -- Zero-One Knapsack.mp4	38.0 MB
7. S12.3 - L07 -- Zero-One Knapsack.vtt	8.3 KB
7.1 ZeroOneKnapsack_DC.zip.zip	4.7 KB
8. S12.3 - L08 -- Longest Common Subsequence.mp4	46.5 MB
8. S12.3 - L08 -- Longest Common Subsequence.vtt	9.4 KB
8.1 LongestCommonSubsequence_DC.zip.zip	4.7 KB
9. S12.3 - L09 -- Longest Palindromic Subsequence.mp4	50.9 MB
9. S12.3 - L09 -- Longest Palindromic Subsequence.vtt	9.9 KB
9.1 LongestPalindromicSubsequence_DC.zip.zip	4.8 KB
/19. S12.4 -- Dynamic Programming/
1. S12.4 - L01 -- What and Why of Dynamic Programming.mp4	28.2 MB
1. S12.4 - L01 -- What and Why of Dynamic Programming.vtt	5.4 KB
10. S12.4 - L10 -- Longest Palindromic Subsequence.mp4	92.6 MB
10. S12.4 - L10 -- Longest Palindromic Subsequence.vtt	13.3 KB
10.1 Java Code - LongestPalindromicSubsequence.zip.zip	337.9 KB
11. S12.4 - L11 -- Longest Palindromic Substring.mp4	110.3 MB
11. S12.4 - L11 -- Longest Palindromic Substring.vtt	15.4 KB
11.1 Java Code - LongestPalindromicSubsequence.zip.zip	337.9 KB
12. S12.4 - L12 -- Min Cost to Reach End of Array.mp4	95.8 MB
12. S12.4 - L12 -- Min Cost to Reach End of Array.vtt	15.3 KB
12.1 Java Code - MinCostToReachLastCellI_in2DArray.zip.zip	337.9 KB
13. S12.4 - L13 -- Ways to Reach last cell.mp4	177.8 MB
13. S12.4 - L13 -- Ways to Reach last cell.vtt	27.2 KB
13.1 Java Code - NumberOfPathsToReachLastCell.zip.zip	338.0 KB
13.2 Java Code - NumberOfPathsToReachLastCell_TD.zip.zip	1.7 KB
2. S12.4 - L02 -- Top Down Approach.mp4	29.6 MB
2. S12.4 - L02 -- Top Down Approach.vtt	7.4 KB
3. S12.4 - L03 -- Bottom Up Approach.mp4	36.9 MB
3. S12.4 - L03 -- Bottom Up Approach.vtt	8.6 KB
4. S12.4 - L04 -- Is Merge Sort Dynamic Programming .mp4	18.0 MB
4. S12.4 - L04 -- Is Merge Sort Dynamic Programming .vtt	4.4 KB
5. S12.4 - L05 -- Number Factor Problem.mp4	100.4 MB
5. S12.4 - L05 -- Number Factor Problem.vtt	17.2 KB
5.1 Java Code - Number_Factors.zip.zip	337.3 KB
6. S12.4 - L06 -- HouseThief Problem.mp4	92.9 MB
6. S12.4 - L06 -- HouseThief Problem.vtt	13.1 KB
6.1 Java Code - House_Thieft.zip.zip	337.4 KB
7. S12.4 - L07 -- Convert One String to Another.mp4	87.3 MB
7. S12.4 - L07 -- Convert One String to Another.vtt	13.1 KB
7.1 Java Code - ConvertOneStringToAnother.zip.zip	337.7 KB
8. S12.4 - L08 -- Zero One Knapsack Problem.mp4	101.7 MB
8. S12.4 - L08 -- Zero One Knapsack Problem.vtt	15.4 KB
8.1 Java Code - ZeroOneKnapsack.zip.zip	337.8 KB
9. S12.4 - L09 -- Longest Common Subsequence.mp4	77.8 MB
9. S12.4 - L09 -- Longest Common Subsequence.vtt	12.1 KB
9.1 Java Code - LongestCommonSubsequence.zip.zip	337.7 KB
/2. S01.1 -- Recursion/
1. S01.1-L01--What is Recursion.mp4	61.5 MB
1. S01.1-L01--What is Recursion.vtt	11.4 KB
2. S01.1-L02--Why learn Recursion.mp4	15.8 MB
2. S01.1-L02--Why learn Recursion.vtt	4.4 KB
3. S01.1-L03--Format of Recursion Method.mp4	13.1 MB
3. S01.1-L03--Format of Recursion Method.vtt	3.6 KB
4. S01.1-L04--How Recurssion works internally.mp4	57.4 MB
4. S01.1-L04--How Recurssion works internally.vtt	14.2 KB
5. S01.1-L05--Finding Factorial using Recursion.mp4	27.8 MB
5. S01.1-L05--Finding Factorial using Recursion.vtt	7.6 KB
6. S01.1-L06--Finding Fibonacci using Recursion.mp4	26.3 MB
6. S01.1-L06--Finding Fibonacci using Recursion.vtt	8.0 KB
7. S01.1-L07--Recursion vs Iteration.mp4	10.8 MB
7. S01.1-L07--Recursion vs Iteration.vtt	3.2 KB
8. S01.1-L08--When to Use & Avoid Recursion.mp4	14.2 MB
8. S01.1-L08--When to Use & Avoid Recursion.vtt	4.4 KB
9. S01.1-L09--Practical Uses of Recursion.mp4	8.3 MB
9. S01.1-L09--Practical Uses of Recursion.vtt	3.3 KB
/3. S02 -- Algorithm Run Time Analysis/
1. S02-L01 -- What is Algo Run Time Analysis.mp4	14.4 MB
1. S02-L01 -- What is Algo Run Time Analysis.vtt	3.1 KB
2. S02-L02 -- What are Notations.mp4	79.1 MB
2. S02-L02 -- What are Notations.vtt	9.8 KB
3. S02-L03 -- Examples of Notations.mp4	29.8 MB
3. S02-L03 -- Examples of Notations.vtt	7.3 KB
4. S02-L04 -- Examples of Time Complexity.mp4	36.3 MB
4. S02-L04 -- Examples of Time Complexity.vtt	6.3 KB
5. S02-L05 -- Finding Time Complexity of Iterative Algo.mp4	41.4 MB
5. S02-L05 -- Finding Time Complexity of Iterative Algo.vtt	7.5 KB
6. S02-L06 -- Finding Time Complexity of Recursive Algo#1.mp4	47.2 MB
6. S02-L06 -- Finding Time Complexity of Recursive Algo#1.vtt	11.1 KB
7. S02-L07 -- Finding Time Complexity of Recursive Algo#2.mp4	80.7 MB
7. S02-L07 -- Finding Time Complexity of Recursive Algo#2.vtt	17.4 KB
/4. S03 -- Array/
1. S03 - L01 -- What and Why of Array.mp4	38.0 MB
1. S03 - L01 -- What and Why of Array.vtt	8.2 KB
10. S03 - L10 -- 2D Array operations.mp4	60.8 MB
10. S03 - L10 -- 2D Array operations.vtt	14.1 KB
11. S03 - L11 -- Time Complexity of 2D Array.mp4	16.2 MB
11. S03 - L11 -- Time Complexity of 2D Array.vtt	2.8 KB
12. S03 - L12 -- When to use Array.mp4	19.4 MB
12. S03 - L12 -- When to use Array.vtt	5.9 KB
13. S03 - L13 -- Code 2D Array.mp4	117.9 MB
13. S03 - L13 -- Code 2D Array.vtt	15.4 KB
13.1 2DimentionalArray.zip.zip	1.7 KB
14. S03 - L14 -- Practical uses of Array.mp4	33.5 MB
14. S03 - L14 -- Practical uses of Array.vtt	6.9 KB
2. S03 - L02 -- Types of Array.mp4	55.3 MB
2. S03 - L02 -- Types of Array.vtt	7.0 KB
3. S03 - L03 -- How is Array represented in Memory.mp4	38.6 MB
3. S03 - L03 -- How is Array represented in Memory.vtt	6.0 KB
4. S03 - L04 -- Create an Array.mp4	63.6 MB
4. S03 - L04 -- Create an Array.vtt	10.5 KB
5. S03 - L05 -- Insert Traverse in 1D Array.mp4	25.8 MB
5. S03 - L05 -- Insert Traverse in 1D Array.vtt	6.8 KB
6. S03 - L06 -- Access Search Delete in 1D Array.mp4	66.2 MB
6. S03 - L06 -- Access Search Delete in 1D Array.vtt	16.9 KB
7. S03 - L07 -- Code 1D Array.mp4	97.9 MB
7. S03 - L07 -- Code 1D Array.vtt	14.0 KB
7.1 SingleDimentionalArray.zip.zip	1.7 KB
8. S03 - L08 -- Time Complexity of 1D Array.mp4	20.7 MB
8. S03 - L08 -- Time Complexity of 1D Array.vtt	4.2 KB
9. S03 - L09 -- Create 2D Array.mp4	51.1 MB
9. S03 - L09 -- Create 2D Array.vtt	8.5 KB
/5. S04 -- Linked List/
1. S04 - L01 -- What is linked list.mp4	44.4 MB
1. S04 - L01 -- What is linked list.vtt	8.4 KB
10. S04 - L10 -- Traversal of SLL.mp4	15.4 MB
10. S04 - L10 -- Traversal of SLL.vtt	3.6 KB
11. S04 - L11 -- Search node in SLL.mp4	21.3 MB
11. S04 - L11 -- Search node in SLL.vtt	5.4 KB
12. S04 - L12 -- Deletion of node from SLL - Dry Run.mp4	41.7 MB
12. S04 - L12 -- Deletion of node from SLL - Dry Run.vtt	9.6 KB
13. S04 - L13 -- Deletion of node from SLL - Algo.mp4	58.0 MB
13. S04 - L13 -- Deletion of node from SLL - Algo.vtt	8.7 KB
14. S04 - L14 -- Delete entire SLL.mp4	12.2 MB
14. S04 - L14 -- Delete entire SLL.vtt	3.2 KB
15. S04 - L15 -- Time Complexity of SLL.mp4	20.0 MB
15. S04 - L15 -- Time Complexity of SLL.vtt	3.6 KB
15.1 LinkedList.zip.zip	13.4 KB
16. S04 - L16 -- Creation of Circular Single LinkedList (CSLL).mp4	16.8 MB
16. S04 - L16 -- Creation of Circular Single LinkedList (CSLL).vtt	4.4 KB
17. S04 - L17 -- Insertion of data in CSLL - Dry Run.mp4	29.1 MB
17. S04 - L17 -- Insertion of data in CSLL - Dry Run.vtt	6.1 KB
18. S04 - L18 -- Insertion of data in CSLL - Algo.mp4	46.3 MB
18. S04 - L18 -- Insertion of data in CSLL - Algo.vtt	46.3 MB
19. S04 - L19 -- Traverse CSLL.mp4	10.6 MB
19. S04 - L19 -- Traverse CSLL.vtt	2.6 KB
2. S04 - L02 -- Linked list vs Array.mp4	20.2 MB
2. S04 - L02 -- Linked list vs Array.vtt	3.2 KB
20. S04 - L20 -- Search a node in CSLL.mp4	20.9 MB
20. S04 - L20 -- Search a node in CSLL.vtt	5.5 KB
21. S04 - L21 -- Delete a node from CSLL - Dry Run.mp4	24.6 MB
21. S04 - L21 -- Delete a node from CSLL - Dry Run.vtt	5.3 KB
22. S04 - L22 -- Deletion of node from CSLL - Algo.mp4	50.2 MB
22. S04 - L22 -- Deletion of node from CSLL - Algo.vtt	7.1 KB
23. S04 - L23 -- Deletion of entire CSLL.mp4	15.9 MB
23. S04 - L23 -- Deletion of entire CSLL.vtt	4.3 KB
24. S04 - L24 -- Time Complexity of CSLL.mp4	25.4 MB
24. S04 - L24 -- Time Complexity of CSLL.vtt	4.2 KB
24.1 LinkedList.zip.zip	13.4 KB
25. S04 - L25 -- Create Double Linked List (DLL).mp4	26.9 MB
25. S04 - L25 -- Create Double Linked List (DLL).vtt	5.9 KB
26. S04 - L26 -- Insert node in DLL - Dry Run.mp4	36.8 MB
26. S04 - L26 -- Insert node in DLL - Dry Run.vtt	8.0 KB
27. S04 - L27 -- Insert node in DLL - Algo.mp4	80.3 MB
27. S04 - L27 -- Insert node in DLL - Algo.vtt	13.7 KB
28. S04 - L28 -- Traverse DLL.mp4	9.8 MB
28. S04 - L28 -- Traverse DLL.vtt	2.6 KB
29. S04 - L29 -- Reverse Traversal of DLL.mp4	13.9 MB
29. S04 - L29 -- Reverse Traversal of DLL.vtt	3.5 KB
3. S04 - L03 -- Components of LinkedList.mp4	27.5 MB
3. S04 - L03 -- Components of LinkedList.vtt	6.6 KB
30. S04 - L30 -- Search a node in DLL.mp4	13.7 MB
30. S04 - L30 -- Search a node in DLL.vtt	3.6 KB
31. S04 - L31 -- Delete a node from DLL - Dry Run.mp4	30.9 MB
31. S04 - L31 -- Delete a node from DLL - Dry Run.vtt	7.5 KB
32. S04 - L32 -- Delete a node from DLL - Algo.mp4	68.7 MB
32. S04 - L32 -- Delete a node from DLL - Algo.vtt	9.9 KB
33. S04 - L33 -- Delete entire DLL.mp4	18.4 MB
33. S04 - L33 -- Delete entire DLL.vtt	4.8 KB
34. S04 - L34 -- Time Complexity of DLL.mp4	22.3 MB
34. S04 - L34 -- Time Complexity of DLL.vtt	4.2 KB
34.1 LinkedList.zip.zip	13.4 KB
35. S04 - L35 -- Create Double Circular LinkedList (CDLL).mp4	35.9 MB
35. S04 - L35 -- Create Double Circular LinkedList (CDLL).vtt	7.9 KB
36. S04 - L36 -- Insert node in CDLL - Dry Run.mp4	53.6 MB
36. S04 - L36 -- Insert node in CDLL - Dry Run.vtt	10.7 KB
37. S04 - L37 -- Insert node in CDLL - Algo.mp4	62.8 MB
37. S04 - L37 -- Insert node in CDLL - Algo.vtt	9.8 KB
38. S04 - L38 -- Traverse CDLL.mp4	14.7 MB
38. S04 - L38 -- Traverse CDLL.vtt	3.4 KB
39. S04 - L39 -- Reverse traverse CDLL.mp4	14.7 MB
39. S04 - L39 -- Reverse traverse CDLL.vtt	3.3 KB
4. S04 - L04 -- Types of LinkedList.mp4	34.6 MB
4. S04 - L04 -- Types of LinkedList.vtt	6.5 KB
40. S04 - L40 -- Search a node in CDLL.mp4	19.2 MB
40. S04 - L40 -- Search a node in CDLL.vtt	5.0 KB
41. S04 - L41 -- Delete a node from CDLL - Dry Run.mp4	40.3 MB
41. S04 - L41 -- Delete a node from CDLL - Dry Run.vtt	8.2 KB
42. S04 - L42 -- Delete a node from CDLL - Algo.mp4	81.2 MB
42. S04 - L42 -- Delete a node from CDLL - Algo.vtt	10.4 KB
43. S04 - L43 -- Delete entire CDLL.mp4	26.2 MB
43. S04 - L43 -- Delete entire CDLL.vtt	6.3 KB
44. S04 - L44 -- Time Complexity of CDLL.mp4	25.2 MB
44. S04 - L44 -- Time Complexity of CDLL.vtt	4.3 KB
44.1 LinkedList.zip.zip	13.4 KB
45. S04 - L45 -- SLL vs CSLL vs DLL vs DLL.mp4	53.3 MB
45. S04 - L45 -- SLL vs CSLL vs DLL vs DLL.vtt	6.9 KB
46. S04 - L46 -- Practical uses of LinkedList.mp4	37.7 MB
46. S04 - L46 -- Practical uses of LinkedList.vtt	5.1 KB
5. S04 - L05 -- Why so many types of LinkedList.mp4	60.0 MB
5. S04 - L05 -- Why so many types of LinkedList.vtt	8.0 KB
6. S04 - L06 -- How is LinkedList stored in Memory.mp4	25.5 MB
6. S04 - L06 -- How is LinkedList stored in Memory.vtt	4.5 KB
7. S04 - L07 -- Creation of Single LinkedList (SLL).mp4	20.6 MB
7. S04 - L07 -- Creation of Single LinkedList (SLL).vtt	5.9 KB
8. S04 - L08 -- Insertion in SLL - Dry Run.mp4	33.9 MB
8. S04 - L08 -- Insertion in SLL - Dry Run.vtt	7.0 KB
9. S04 - L09 -- Insertion in SLL - Algo.mp4	70.0 MB
9. S04 - L09 -- Insertion in SLL - Algo.vtt	10.9 KB
/6. S05 -- Stack/
1. L01 -- What and Why of Stack.mp4	29.2 MB
1. L01 -- What and Why of Stack.vtt	5.5 KB
2. L02 -- ARRAY - Create & Push.mp4	23.7 MB
2. L02 -- ARRAY - Create & Push.vtt	7.5 KB
3. L03 -- ARRAY - Pop, Peek, isEmpty, isFull, Delete.mp4	31.9 MB
3. L03 -- ARRAY - Pop, Peek, isEmpty, isFull, Delete.vtt	9.0 KB
3.1 Stack.zip.zip	15.8 KB
4. L04 -- LinkedList - Create, Push, Pop.mp4	30.1 MB
4. L04 -- LinkedList - Create, Push, Pop.vtt	7.8 KB
5. L05 -- LinkedList - Peek, Delete.mp4	25.0 MB
5. L05 -- LinkedList - Peek, Delete.vtt	6.2 KB
5.1 Stack.zip.zip	15.8 KB
6. L06 -- When to use or avoid Stack.mp4	13.5 MB
6. L06 -- When to use or avoid Stack.vtt	4.2 KB
/7. S06 -- Queue/
1. S06 - L01 -- What and Why of Queue.mp4	29.2 MB
1. S06 - L01 -- What and Why of Queue.vtt	4.6 KB
10. S06 - L10 -- LINEAR QUEUE(LL) - Peek, isEmpty, Delete.mp4	18.4 MB
10. S06 - L10 -- LINEAR QUEUE(LL) - Peek, isEmpty, Delete.vtt	4.9 KB
10.1 LinearQueue_LinkedList.zip.zip	7.4 KB
11. S06 - L11 -- Array vs LinkedList Implementation.mp4	23.7 MB
11. S06 - L11 -- Array vs LinkedList Implementation.vtt	5.1 KB
2. S06 - L02 -- LINEAR QUEUE(Array) - Create, Enqueue.mp4	26.8 MB
2. S06 - L02 -- LINEAR QUEUE(Array) - Create, Enqueue.vtt	8.2 KB
3. S06 - L03 -- LINEAR QUEUE((Array)) - deQueue, isEmpty, isFull, Delete.mp4	32.6 MB
3. S06 - L03 -- LINEAR QUEUE((Array)) - deQueue, isEmpty, isFull, Delete.vtt	8.8 KB
3.1 LinearQueueArray.zip.zip	1.4 KB
4. S06 - L04 -- Why Circular Queue.mp4	18.7 MB
4. S06 - L04 -- Why Circular Queue.vtt	5.3 KB
5. S06 - L05 -- CIRCULAR QUEUE(Array) - Enqueue.mp4	25.6 MB
5. S06 - L05 -- CIRCULAR QUEUE(Array) - Enqueue.vtt	6.9 KB
6. S06 - L06 -- CIRCULAR QUEUE(Array) - Dequeue.mp4	18.9 MB
6. S06 - L06 -- CIRCULAR QUEUE(Array) - Dequeue.vtt	3.8 KB
7. S06 - L07 -- CIRCULAR QUEUE(Array) - Peek, isEmpty, isFull, Delete.mp4	25.1 MB
7. S06 - L07 -- CIRCULAR QUEUE(Array) - Peek, isEmpty, isFull, Delete.vtt	6.2 KB
7.1 CircularQueueArray.zip.zip	1.7 KB
8. S06 - L08 -- LINEAR QUEUE(LL) - Enqueue.mp4	28.5 MB
8. S06 - L08 -- LINEAR QUEUE(LL) - Enqueue.vtt	6.7 KB
9. S06 - L09 -- LINEAR QUEUE(LL) - DeQueue.mp4	16.6 MB
9. S06 - L09 -- LINEAR QUEUE(LL) - DeQueue.vtt	3.8 KB
/8. S08.01 -- Binary Tree/
1. S08.01 - L01 -- What is Tree.mp4	40.4 MB
1. S08.01 - L01 -- What is Tree.vtt	9.0 KB
10. S08.01 - L09 -- In-order traversal Binary Tree(LL).mp4	30.6 MB
10. S08.01 - L09 -- In-order traversal Binary Tree(LL).vtt	6.4 KB
11. S08.01 - L10 -- Post-order traversal Binary Tree(LL).mp4	30.0 MB
11. S08.01 - L10 -- Post-order traversal Binary Tree(LL).vtt	6.5 KB
12. S08.01 - L11 -- Level-order traversal Binary Tree(LL).mp4	37.6 MB
12. S08.01 - L11 -- Level-order traversal Binary Tree(LL).vtt	7.8 KB
13. S08.01 - L12 -- Search for value in Binary Tree(LL).mp4	37.4 MB
13. S08.01 - L12 -- Search for value in Binary Tree(LL).vtt	8.2 KB
14. S08.01 - L13 -- Insert value in Binary Tree(LL).mp4	26.4 MB
14. S08.01 - L13 -- Insert value in Binary Tree(LL).vtt	6.5 KB
15. S08.01 - L14 -- Delete value from Binary Tree(LL).mp4	30.6 MB
15. S08.01 - L14 -- Delete value from Binary Tree(LL).vtt	7.0 KB
16. S08.01 - L15 -- Delete Binary Tree(LL).mp4	15.6 MB
16. S08.01 - L15 -- Delete Binary Tree(LL).vtt	4.2 KB
17. S08.01 - L16 -- Create Binary Tree(Array).mp4	20.6 MB
17. S08.01 - L16 -- Create Binary Tree(Array).vtt	5.2 KB
18. S08.01 - L17 -- Insert value in Binary Tree(Array).mp4	28.0 MB
18. S08.01 - L17 -- Insert value in Binary Tree(Array).vtt	5.9 KB
19. S08.01 - L18 -- Search for value in Binary Tree(Array).mp4	16.8 MB
19. S08.01 - L18 -- Search for value in Binary Tree(Array).vtt	3.7 KB
2. S08.01 - L02 -- Why learn Tree.mp4	9.1 MB
2. S08.01 - L02 -- Why learn Tree.vtt	2.0 KB
20. S08.01 - L19 -- Inorder traversal of Binary Tree(Array).mp4	33.4 MB
20. S08.01 - L19 -- Inorder traversal of Binary Tree(Array).vtt	6.0 KB
21. S08.01 - L20 -- Pre-order traversal of Binary Tree(Array).mp4	20.1 MB
21. S08.01 - L20 -- Pre-order traversal of Binary Tree(Array).vtt	4.0 KB
22. S08.01 - L21 -- Post-order traversal of Binary Tree(Array).mp4	22.9 MB
22. S08.01 - L21 -- Post-order traversal of Binary Tree(Array).vtt	4.8 KB
23. S08.01 - L22 -- Level-order traversal of Binary Tree(Array).mp4	11.7 MB
23. S08.01 - L22 -- Level-order traversal of Binary Tree(Array).vtt	2.8 KB
24. S08.01 - L23 -- Delete node from Binary Tree(Array).mp4	26.2 MB
24. S08.01 - L23 -- Delete node from Binary Tree(Array).vtt	5.8 KB
25. S08.01 - L24 -- Delete Binary Tree(Array).mp4	15.2 MB
25. S08.01 - L24 -- Delete Binary Tree(Array).vtt	3.5 KB
25.1 BinaryTree.zip.zip	8.4 KB
26. S08.01 - L25 -- Binary Tree (Array vs Linked List).mp4	32.2 MB
26. S08.01 - L25 -- Binary Tree (Array vs Linked List).vtt	4.6 KB
3. S08.01 - L03 -- Tree Terminologies - Part#1.mp4	42.4 MB
3. S08.01 - L03 -- Tree Terminologies - Part#1.vtt	8.6 KB
4. S08.01 - L03 -- Tree Terminologies - Part#2.mp4	20.7 MB
4. S08.01 - L03 -- Tree Terminologies - Part#2.vtt	4.4 KB
5. S08.01 - L04 -- What & Why of Binary Ttree.mp4	14.8 MB
5. S08.01 - L04 -- What & Why of Binary Ttree.vtt	3.8 KB
6. S08.01 - L05 -- Types of Binary Tree.mp4	25.5 MB
6. S08.01 - L05 -- Types of Binary Tree.vtt	5.3 KB
7. S08.01 - L06 -- How is Tree Represented in Code.mp4	40.2 MB
7. S08.01 - L06 -- How is Tree Represented in Code.vtt	8.2 KB
8. S08.01 - L07 -- Create blank Binary Tree(LL).mp4	9.5 MB
8. S08.01 - L07 -- Create blank Binary Tree(LL).vtt	3.1 KB
9. S08.01 - L08 -- Pre-order traversal Binary Tree(LL).mp4	79.8 MB
9. S08.01 - L08 -- Pre-order traversal Binary Tree(LL).vtt	14.9 KB
/9. S08.02 -- Binary Search Tree (BST)/
1. S08.02 - L01 -- What & Why of BST.mp4	19.3 MB
1. S08.02 - L01 -- What & Why of BST.vtt	4.4 KB
2. S08.02 - L02 -- Creation & Searching in BST.mp4	42.1 MB
2. S08.02 - L02 -- Creation & Searching in BST.vtt	10.5 KB
3. S08.02 - L03 -- Traversing a BST.mp4	33.5 MB
3. S08.02 - L03 -- Traversing a BST.vtt	7.9 KB
4. S08.02 - L04 -- Inserting a node in BST.mp4	73.5 MB
4. S08.02 - L04 -- Inserting a node in BST.vtt	13.5 KB
5. S08.02 - L05 -- Deleting a node from BST.mp4	84.9 MB
5. S08.02 - L05 -- Deleting a node from BST.vtt	15.1 KB
6. S08.02 - L06 -- Deleting a BST.mp4	14.1 MB
6. S08.02 - L06 -- Deleting a BST.vtt	3.6 KB
6.1 BST.zip.zip	7.1 KB
Total files 536