GigaCourse Com Udemy - Java Data Structures and Algorithms Masterclass

1. 01 Introduction/001 Curriculum Walkthrough.mp432.82MB
2. 01 Introduction/002 What is a data structure_.mp423.51MB
3. 01 Introduction/003 What is an algorithm_.mp418.72MB
4. 01 Introduction/004 Why are Data Structures and Algorithms important_.mp420.71MB
5. 01 Introduction/005 Types of Data Structures.mp48.59MB
6. 01 Introduction/006 Types of Algorithms.mp411.12MB
7. 02 Recursion/001 Goals _ what you will learn by the end of this section.mp44.06MB
8. 02 Recursion/002 What is Recursion_.mp432.51MB
9. 02 Recursion/003 Why do we need Recursion_.mp411.39MB
10. 02 Recursion/004 The Logic Behind Recursion.mp430.2MB
11. 02 Recursion/005 Recursive vs Iterative Solution.mp413.85MB
12. 02 Recursion/006 When to Use_Avoid Recursion_.mp422.46MB
13. 02 Recursion/007 How to Write Recursion in 3 Steps_.mp449.04MB
14. 02 Recursion/008 Fibonacci Series using Recursion.mp436.08MB
15. 03 Cracking Recursion Interview Questions/001 Question 1 - Sum of Digits.mp439.42MB
16. 03 Cracking Recursion Interview Questions/002 Question 2 - Power.mp427.74MB
17. 03 Cracking Recursion Interview Questions/003 Question 3 - GCD.mp428.14MB
18. 03 Cracking Recursion Interview Questions/004 Question 4 - Decimal to Binary.mp437.64MB
19. 05 Big O Notation/001 What is Big O_.mp410.95MB
20. 05 Big O Notation/002 Big O Notations (Big O, Big Omega, Big Theta).mp424.31MB
21. 05 Big O Notation/003 Most Common Time Complexities.mp444.45MB
22. 05 Big O Notation/004 Space Complexity.mp46.82MB
23. 05 Big O Notation/005 Drop Constants and Non Dominant Terms.mp415.11MB
24. 05 Big O Notation/006 Addition vs Multiplication.mp47.63MB
25. 05 Big O Notation/007 How to Measure the Code using Big O_.mp421.33MB
26. 05 Big O Notation/008 How to Measure Recursive Algorithm_.mp426.86MB
27. 05 Big O Notation/009 How to Measure Recursive Algorithm with Multiple Calls_.mp414.99MB
28. 06 Cracking Big O Interview Questions/001 Question 1 - Time Complexity of Method that returns Sum and Product of Array.mp425.5MB
29. 06 Cracking Big O Interview Questions/002 Question 2 - Time Complexity of Print Pairs Method.mp423.01MB
30. 06 Cracking Big O Interview Questions/003 Question 3 - Time Complexity of Print Unordered Pairs Method.mp414.47MB
31. 06 Cracking Big O Interview Questions/004 Question 4 - Find Time Complexity for Given Method.mp46.97MB
32. 06 Cracking Big O Interview Questions/005 Question 5 - Find Time Complexity for Given Method.mp44.71MB
33. 06 Cracking Big O Interview Questions/006 Question 6 - Time Complexity of Reverse Array Function.mp424.83MB
34. 06 Cracking Big O Interview Questions/007 Question 7 - Equivalent to O(N).mp412.65MB
35. 06 Cracking Big O Interview Questions/008 Question 8 - Time Complexity of Factorial.mp48.61MB
36. 06 Cracking Big O Interview Questions/009 Question 9 - Time Complexity of Fibonacci.mp48.36MB
37. 06 Cracking Big O Interview Questions/010 Question 10 - Time Complexity Powers Of 2.mp49.21MB
38. 07 Arrays/001 What is an Array_.mp428.02MB
39. 07 Arrays/002 Types of Arrays.mp427.99MB
40. 07 Arrays/003 Arrays in Memory.mp410.3MB
41. 07 Arrays/004 Create an Array.mp431.71MB
42. 07 Arrays/005 Insertion in Array.mp444.59MB
43. 07 Arrays/006 Accessing Elements in Array.mp420.03MB
44. 07 Arrays/007 Array Traversal.mp433.19MB
45. 07 Arrays/008 Search for Array Element.mp435.32MB
46. 07 Arrays/009 Delete Array Element.mp428.6MB
47. 07 Arrays/010 Time and Space Complexity of 1D Arrays.mp412.57MB
48. 07 Arrays/011 Create Two Dimensional Array.mp443.65MB
49. 07 Arrays/012 Insertion - Two Dimensional Array.mp452.33MB
50. 07 Arrays/013 Accessing Two Dimensional Array Element.mp434.98MB
51. 07 Arrays/014 Traverse Two Dimensional Array.mp432.81MB
52. 07 Arrays/015 Searching Two Dimensional Array.mp443.97MB
53. 07 Arrays/016 Delete Two Dimensional Array Element.mp435.09MB
54. 07 Arrays/017 Time and Space Complexity of 1D Arrays.mp411.95MB
55. 07 Arrays/018 When to Use_Avoid Arrays.mp45.6MB
56. 08 PROJECT 1 - Arrays/001 Goals - what you will make by the end of this section.mp47.27MB
57. 08 PROJECT 1 - Arrays/002 Calculate Average Temperature.mp428.13MB
58. 08 PROJECT 1 - Arrays/003 Find the Days Above Average Temperature.mp445.54MB
59. 09 Cracking Array Interview Questions (Amazon, Facebook, Apple and Microsoft)/001 Section Goals.mp41.76MB
60. 09 Cracking Array Interview Questions (Amazon, Facebook, Apple and Microsoft)/002 Solution - Missing Number.mp429.68MB
61. 09 Cracking Array Interview Questions (Amazon, Facebook, Apple and Microsoft)/003 Solution - Pairs.mp434.37MB
62. 09 Cracking Array Interview Questions (Amazon, Facebook, Apple and Microsoft)/004 Solution - Finding a Number in an Array.mp419.43MB
63. 09 Cracking Array Interview Questions (Amazon, Facebook, Apple and Microsoft)/005 Solution - Max Product of Two Integers.mp425.44MB
64. 09 Cracking Array Interview Questions (Amazon, Facebook, Apple and Microsoft)/006 Solution - IsUnique _ Contains Duplicate - LeetCode 217.mp420.66MB
65. 09 Cracking Array Interview Questions (Amazon, Facebook, Apple and Microsoft)/007 Solution - Permutation.mp431.77MB
66. 09 Cracking Array Interview Questions (Amazon, Facebook, Apple and Microsoft)/008 Rotate Matrix _ Image - LeetCode 48.mp451.1MB
67. 11 Linked List/001 What is a Linked List_.mp430.4MB
68. 11 Linked List/002 Linked List vs Array.mp411.02MB
69. 11 Linked List/003 Types of Linked List.mp442.5MB
70. 11 Linked List/004 Linked List in the Memory.mp410.58MB
71. 11 Linked List/005 Creation of Singly Linked List.mp438.56MB
72. 11 Linked List/006 Insertion in Singly Linked List in Memory.mp412.52MB
73. 11 Linked List/007 Insertion Algorithm in Singly Linked List.mp435.13MB
74. 11 Linked List/008 Insertion Method in Singly Linked List.mp479.35MB
75. 11 Linked List/009 Traversal of Singly Linked List.mp450.03MB
76. 11 Linked List/010 Searching in Singly Linked List.mp442MB
77. 11 Linked List/011 Deletion of a Node from Singly Linked List.mp439.34MB
78. 11 Linked List/012 Deletion Method in Singly Linked List.mp482.61MB
79. 11 Linked List/013 Deletion of Entire Singly Linked List.mp426.8MB
80. 11 Linked List/014 Time and Space Complexity of Singly Linked List.mp414.75MB
81. 12 Circular Singly Linked List/001 Create Circular Singly Linked List.mp447.25MB
82. 12 Circular Singly Linked List/002 Insertion in Circular Singly Linked List.mp425.32MB
83. 12 Circular Singly Linked List/003 Insertion Algorithm in Circular Singly Linked List.mp416.88MB
84. 12 Circular Singly Linked List/004 Insertion Method Circular Singly Linked List.mp458.59MB
85. 12 Circular Singly Linked List/005 Traversal of Circular Singly Linked List.mp444.4MB
86. 12 Circular Singly Linked List/006 Searching a Node in Circular Singly Linked List.mp442.91MB
87. 12 Circular Singly Linked List/007 Deletion of a Node from Circular Singly List.mp430.14MB
88. 12 Circular Singly Linked List/008 Deletion Algorithm in Circular Singly Linked List.mp416.47MB
89. 12 Circular Singly Linked List/009 Deletion Method in Circular Singly Linked List.mp453.51MB
90. 12 Circular Singly Linked List/010 Delete Entire Circular Singly Linked List.mp427.2MB
91. 12 Circular Singly Linked List/011 Time and Space Complexity of Circular Singly Linked List.mp420.6MB
92. 13 Doubly Linked List/001 Create Doubly Linked List.mp453.22MB
93. 13 Doubly Linked List/002 Insertion Doubly Linked List.mp433.2MB
94. 13 Doubly Linked List/003 Insertion Algorithm Doubly Linked List.mp424.52MB
95. 13 Doubly Linked List/004 Insertion Method Doubly Linked List.mp480.82MB
96. 13 Doubly Linked List/005 Traversal of Doubly Linked List.mp437.96MB
97. 13 Doubly Linked List/006 Reverse Traversal of Doubly Linked List.mp439.78MB
98. 13 Doubly Linked List/007 Searching for a Node in Doubly Linked List.mp443.33MB
99. 13 Doubly Linked List/008 Deletion of a Node in Doubly Linked List.mp430.24MB
100. 13 Doubly Linked List/009 Deletion Algorithm Doubly Linked List.mp418.85MB
101. 13 Doubly Linked List/010 Deletion Method in Doubly Linked List.mp469.72MB
102. 13 Doubly Linked List/011 Delete Entire Doubly Linked List.mp434.05MB
103. 13 Doubly Linked List/012 Time and Space Complexity of Doubly Linked List.mp421.59MB
104. 14 Circular Doubly Linked List/001 Create Doubly Linked List.mp445.3MB
105. 14 Circular Doubly Linked List/002 Insertion Circular Doubly Linked List.mp437.83MB
106. 14 Circular Doubly Linked List/003 Insertion Algorithm Circular Doubly Linked List.mp426.13MB
107. 14 Circular Doubly Linked List/004 Insertion Method Circular Doubly Linked List.mp467.8MB
108. 14 Circular Doubly Linked List/005 Traversal of Circular Doubly Linked List.mp436.77MB
109. 14 Circular Doubly Linked List/006 Reverse Traversal of Circular Doubly Linked List.mp438.67MB
110. 14 Circular Doubly Linked List/007 Search for a Node in Circular Doubly Linked List.mp441.1MB
111. 14 Circular Doubly Linked List/008 Deletion in Circular Doubly Linked List.mp439.49MB
112. 14 Circular Doubly Linked List/009 Deletion Algorithm in Circular Doubly Linked List.mp423.56MB
113. 14 Circular Doubly Linked List/010 Deletion Method in Circular Doubly Linked List.mp460.73MB
114. 14 Circular Doubly Linked List/011 Delete Entire Circular Doubly Linked List.mp435.5MB
115. 14 Circular Doubly Linked List/012 Time and Space Complexity of Circular Doubly Linked List.mp418.71MB
116. 14 Circular Doubly Linked List/013 Time Complexity of Array vs Linked List.mp429.15MB
117. 15 Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/001 Linked List Class.mp442.5MB
118. 15 Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/002 Solution - Remove Dups.mp449.25MB
119. 15 Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/003 Solution - Return Nth to Last.mp436.28MB
120. 15 Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/004 Solution - Partition.mp444.33MB
121. 15 Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/005 Solution - Sum Lists.mp450.7MB
122. 15 Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/006 Solution - Intersection.mp469.86MB
123. 16 Stack/001 What and Why of Stack_.mp416.6MB
124. 16 Stack/002 Stack Operations.mp416.45MB
125. 16 Stack/003 Stack using Array vs Linked List.mp43.65MB
126. 16 Stack/004 Stack Operations using Array (Create, isEmpty, isFull).mp436.95MB
127. 16 Stack/005 Stack Operations using Array (Push, Pop, Peek, Delete).mp467.49MB
128. 16 Stack/006 Time and Space Complexity of Stack using Array.mp48.12MB
129. 16 Stack/007 Stack Operations using Linked List.mp417.9MB
130. 16 Stack/008 Stack methods - Push , Pop, Peek, Delete and isEmpty using Linked List.mp487.14MB
131. 16 Stack/009 Time and Space Complexity of Stack using Linked List.mp49.88MB
132. 16 Stack/010 When to Use_Avoid Stack.mp45.55MB
133. 17 Queue/001 What is a Queue_.mp425.65MB
134. 17 Queue/002 Linear Queue Operations using Array.mp419.99MB
135. 17 Queue/003 Create, isFull, isEmpty and enQueue methods using Linear Queue Array.mp476.68MB
136. 17 Queue/004 Dequeue, Peek and Delete Methods using Linear Queue Array.mp459.83MB
137. 17 Queue/005 Time and Space Complexity of Linear Queue using Array.mp411.55MB
138. 17 Queue/006 Why Circular Queue_.mp413.08MB
139. 17 Queue/007 Circular Queue Operations using Array.mp423.04MB
140. 17 Queue/008 Create, Enqueue, isFull and isEmpty Methods in Circular Queue using Array.mp490.6MB
141. 17 Queue/009 Dequeue, Peek and Delete Methods in Circular Queue using Array.mp465.63MB
142. 17 Queue/010 Time and Space Complexity of Circular Queue using Array.mp412.18MB
143. 17 Queue/011 Queue Operations using Linked List.mp423.58MB
144. 17 Queue/012 Create, Enqueue and isEmpty Methods in Queue using Linked List.mp455.21MB
145. 17 Queue/013 Dequeue, Peek and Delete Methods in Queue using Linked List.mp459.26MB
146. 17 Queue/014 Time and Space Complexity of Queue using Linked List.mp48.89MB
147. 17 Queue/015 Array vs Linked List Implementation.mp48.51MB
148. 17 Queue/016 When to Use_Avoid Queue_.mp44.8MB
149. 18 Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/001 Goals.mp43.78MB
150. 18 Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/002 Solution - Three in One.mp488.99MB
151. 18 Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/003 Solution - Stack Minimum.mp444.86MB
152. 18 Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/004 Solution Part 1 - Stack of Plates.mp456.33MB
153. 18 Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/005 Solution Part 2 - Stack of Plates.mp442.43MB
154. 18 Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/006 Solution Part 3 - Follow UP.mp436.1MB
155. 18 Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/007 Solution - Queue via Stacks.mp440.1MB
156. 18 Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/008 Solution - Animal Shelter.mp4111.14MB
157. 19 Tree _ Binary Tree/001 What is a Tree_.mp427MB
158. 19 Tree _ Binary Tree/002 Why Tree_.mp46.61MB
159. 19 Tree _ Binary Tree/003 Tree Terminology.mp418.1MB
160. 19 Tree _ Binary Tree/004 Creating a Basic Tree in Java.mp443.66MB
161. 19 Tree _ Binary Tree/005 What is A Binary Tree_.mp49.02MB
162. 19 Tree _ Binary Tree/006 Types of Binary Tree.mp410.37MB
163. 19 Tree _ Binary Tree/007 Binary Tree Representation.mp421.62MB
164. 19 Tree _ Binary Tree/008 Create Binary Tree using Linked List.mp421MB
165. 19 Tree _ Binary Tree/009 PreOrder Traversal in Binary Tree using Linked List.mp457.15MB
166. 19 Tree _ Binary Tree/010 InOrder Traversal in Binary Tree using Linked List.mp447.3MB
167. 19 Tree _ Binary Tree/011 PostOrder Traversal in Binary Tree using Linked List.mp434.88MB
168. 19 Tree _ Binary Tree/012 LevelOrder Traversal in Binary Tree using Linked List.mp446.55MB
169. 19 Tree _ Binary Tree/013 Search Method in Binary Tree (Linked List).mp450.14MB
170. 19 Tree _ Binary Tree/014 Insert Method in Binary Tree (Linked List).mp465.68MB
171. 19 Tree _ Binary Tree/015 Delete a Node in Binary Tree (Linked List).mp4133.28MB
172. 19 Tree _ Binary Tree/016 Delet Entire Binary Tree (Linked List).mp415.17MB
173. 19 Tree _ Binary Tree/017 Create Binary Tree (Array).mp432.12MB
174. 19 Tree _ Binary Tree/018 Insert Method Binary Tree (Array).mp446.61MB
175. 19 Tree _ Binary Tree/019 PreOrder Traversal Binary Tree (Array).mp444.9MB
176. 19 Tree _ Binary Tree/020 InOrder Traversal Binary Tree (Array).mp438.11MB
177. 19 Tree _ Binary Tree/021 PostOrder Traversal Binary Tree (Array).mp432.14MB
178. 19 Tree _ Binary Tree/022 levelOrder Traversal Binary Tree (Array).mp435.18MB
179. 19 Tree _ Binary Tree/023 Search Method Binary Tree (Array).mp442.41MB
180. 19 Tree _ Binary Tree/024 Delete a Node Binary Tree (Array).mp436.73MB
181. 19 Tree _ Binary Tree/025 Delete Binary Tree (Array).mp417.51MB
182. 19 Tree _ Binary Tree/026 Array vs Linked List in Binary Tree Implementation.mp429.89MB
183. 20 Binary Search Tree/001 What is a Binary Search Tree_ Why do we need it_.mp411.49MB
184. 20 Binary Search Tree/002 Create Binary Search Tree.mp416.22MB
185. 20 Binary Search Tree/003 Insert a Node to Binary Search Tree.mp465.07MB
186. 20 Binary Search Tree/004 PreOrder Traversal Binary Search Tree.mp426.68MB
187. 20 Binary Search Tree/005 InOrder Traversal Binary Search Tree.mp420.32MB
188. 20 Binary Search Tree/006 PostOrder Traversal Binary Search Tree.mp418.82MB
189. 20 Binary Search Tree/007 Level Order Traversal Binary Search Tree.mp425.75MB
190. 20 Binary Search Tree/008 Search in Binary Search Tree.mp434.13MB
191. 20 Binary Search Tree/009 Delete a Node in Binary Search Tree.mp487.08MB
192. 20 Binary Search Tree/010 Delete BST.mp412.45MB
193. 20 Binary Search Tree/011 Time and Space Complexity of BST.mp412.47MB
194. 21 AVL Tree/001 What is an AVL Tree_.mp426.35MB
195. 21 AVL Tree/002 Why Do We Need AVL Tree_.mp412.15MB
196. 21 AVL Tree/003 Common Operations on AVL Tree.mp451.35MB
197. 21 AVL Tree/004 Insert a Node in AVL (Left Left Condition).mp445.8MB
198. 21 AVL Tree/005 Insert a Node in AVL (Left Right Condition).mp431.85MB
199. 21 AVL Tree/006 Insert a Node in AVL (Right Right Condition).mp426.52MB
200. 21 AVL Tree/007 Insert a Node in AVL (Right Left Condition).mp423.19MB
201. 21 AVL Tree/008 Insert a Node in AVL (All Together).mp448.33MB
202. 21 AVL Tree/009 Insert a Node in AVL (Method in Practice).mp4114.19MB
203. 21 AVL Tree/010 Delete a Node from AVL (LL, LR, RR, RR).mp434.25MB
204. 21 AVL Tree/011 Delete a Node from ALL (All Together).mp426.94MB
205. 21 AVL Tree/012 Delete a Node from AVL (Method in practice).mp472.11MB
206. 21 AVL Tree/013 Delete Entire AVL Tree.mp49.65MB
207. 21 AVL Tree/014 Time and Space Complexity of AVL.mp49.33MB
208. 21 AVL Tree/015 Binary Search Tree vs AVL.mp48.44MB
209. 22 Binary Heap/001 What is Binary Heap_ Why do we need Binary Heap_.mp431.93MB
210. 22 Binary Heap/002 Common Operations on Binary Heap.mp477.58MB
211. 22 Binary Heap/003 Insert a Node in Binary Heap.mp462.06MB
212. 22 Binary Heap/004 Extract a Node from Binary Heap.mp487.62MB
213. 22 Binary Heap/005 Delete Entire Binary Heap.mp415.16MB
214. 22 Binary Heap/006 Time and Space Complexity of Binary Heap.mp418.37MB
215. 23 Trie/001 What is a Trie_ Why we need Trie_.mp439.36MB
216. 23 Trie/002 Common Operations on a Trie (Creation).mp424.54MB
217. 23 Trie/003 Insert a String in Trie.mp452.34MB
218. 23 Trie/004 Search for a String in Trie.mp454.3MB
219. 23 Trie/005 Delete a String from Trie.mp465.97MB
220. 23 Trie/006 Practical Uses of Trie.mp46.73MB
221. 24 Hashing/001 What is Hashing_ Why we need it_.mp416.19MB
222. 24 Hashing/002 Hashing Terminology.mp417.21MB
223. 24 Hashing/003 Hash Functions.mp427.17MB
224. 24 Hashing/004 Types of Collision Resolution Techniques - Direct Chaining (Insert).mp464.44MB
225. 24 Hashing/005 Direct Chaining Implementation - (Search, Delete).mp444MB
226. 24 Hashing/006 Hash Table is Full.mp412.21MB
227. 24 Hashing/007 Collision Resolution Technique - Linear Probing (Insert).mp476.75MB
228. 24 Hashing/008 Collision Resolution Technique - Linear Probing (Search, Delete).mp450.89MB
229. 24 Hashing/009 Collision Resolution Technique - Open Addressing _ Quadratic Probing.mp447.1MB
230. 24 Hashing/010 Collision Resolution Technique - Open Addressing _ Double Hashing.mp463.91MB
231. 24 Hashing/011 Pros and Cons of Resolution Techniques.mp415.22MB
232. 24 Hashing/012 Practical Use of Hashing.mp416.46MB
233. 24 Hashing/013 Hashing vs Other DS.mp46.96MB
234. 25 Sorting Algorithms/001 What is Sorting_.mp410.52MB
235. 25 Sorting Algorithms/002 Types of Sorting.mp422.91MB
236. 25 Sorting Algorithms/003 Sorting Terminology.mp416.96MB
237. 25 Sorting Algorithms/004 Bubble Sort.mp452.1MB
238. 25 Sorting Algorithms/005 Selection Sort.mp441.53MB
239. 25 Sorting Algorithms/006 Insertion Sort.mp446.64MB
240. 25 Sorting Algorithms/007 Bucket Sort.mp488.62MB
241. 25 Sorting Algorithms/008 Merge Sort.mp458.18MB
242. 25 Sorting Algorithms/009 Quick Sort.mp485.11MB
243. 25 Sorting Algorithms/010 Heap Sort.mp469.61MB
244. 25 Sorting Algorithms/011 Comparison of Sorting Algorithms.mp44.8MB
245. 26 Searching Algorithms/001 Introduction To Search Algorithms.mp45.3MB
246. 26 Searching Algorithms/002 Linear Search.mp48.09MB
247. 26 Searching Algorithms/003 Linear Search in Java.mp426.04MB
248. 26 Searching Algorithms/004 Binary Search.mp47.94MB
249. 26 Searching Algorithms/005 Binary Search in Java.mp462.28MB
250. 26 Searching Algorithms/006 Time Complexity of Binary Search.mp422.04MB
251. 27 Graphs/001 What you will learn.mp45.34MB
252. 27 Graphs/002 What is a Graph_ Why do we need Graph.mp430.87MB
253. 27 Graphs/003 Graph Terminology.mp419.17MB
254. 27 Graphs/004 Types of Graph.mp416.55MB
255. 27 Graphs/005 Graph Representation.mp434.6MB
256. 27 Graphs/006 Graph in Java using Adjacency Matrix.mp460.54MB
257. 27 Graphs/007 Graph in Java using Adjacency List.mp448.12MB
258. 28 Graph Traversal - Breadth First Search and Depth First Search Algorithms/001 Breadth First Search Algorithm (BFS).mp438.71MB
259. 28 Graph Traversal - Breadth First Search and Depth First Search Algorithms/002 Breadth First Search Algorithm (BFS) in Java - Adjacency Matrix.mp459.46MB
260. 28 Graph Traversal - Breadth First Search and Depth First Search Algorithms/003 Breadth First Search Algorithm (BFS) in Java - Adjacency List.mp436.9MB
261. 28 Graph Traversal - Breadth First Search and Depth First Search Algorithms/004 Time Complexity of Breadth First Search (BFS) Algorithm.mp411.6MB
262. 28 Graph Traversal - Breadth First Search and Depth First Search Algorithms/005 Depth First Search (DFS) Algorithm.mp426.17MB
263. 28 Graph Traversal - Breadth First Search and Depth First Search Algorithms/006 Depth First Search (DFS) Algorithm in Java - Adjacency List.mp432.94MB
264. 28 Graph Traversal - Breadth First Search and Depth First Search Algorithms/007 Depth First Search (DFS) Algorithm in Java - Adjacency Matrix.mp439.43MB
265. 28 Graph Traversal - Breadth First Search and Depth First Search Algorithms/008 Time Complexity of Depth First Search (DFS) Algorithm.mp410.57MB
266. 28 Graph Traversal - Breadth First Search and Depth First Search Algorithms/009 BFS Traversal vs DFS Traversal.mp413.4MB
267. 29 Topological Sort/001 What is Topological Sort_.mp410.15MB
268. 29 Topological Sort/002 Topological Sort Algorithm.mp431.14MB
269. 29 Topological Sort/003 Topological Sort using Adjacency List.mp461.02MB
270. 29 Topological Sort/004 Topological Sort using Adjacency Matrix.mp442.83MB
271. 29 Topological Sort/005 Time and Space Complexity of Topological Sort.mp413.85MB
272. 30 Single Source Shortest Path Problem (SSSPP)/001 What is Single Source Shortest Path Problem_.mp421.8MB
273. 30 Single Source Shortest Path Problem (SSSPP)/002 Breadth First Search (BFS) for Single Source Shortest Path Problem (SSSPP).mp425.64MB
274. 30 Single Source Shortest Path Problem (SSSPP)/003 BFS for SSSPP in Java using Adjacency List.mp455.01MB
275. 30 Single Source Shortest Path Problem (SSSPP)/004 BFS for SSSPP in Java using Adjacency Matrix.mp439.25MB
276. 30 Single Source Shortest Path Problem (SSSPP)/005 Time and Space Complexity of BFS for SSSPP.mp410.09MB
277. 30 Single Source Shortest Path Problem (SSSPP)/006 Why does BFS not work with Weighted Graph_.mp410.94MB
278. 30 Single Source Shortest Path Problem (SSSPP)/007 Why does DFS not work for SSSP_.mp47.39MB
279. 31 Dijkstra's Algorithm/001 Dijkstra's Algorithm for SSSPP.mp419.17MB
280. 31 Dijkstra's Algorithm/002 Dijkstra's Algorithm in Java - 1.mp457.38MB
281. 31 Dijkstra's Algorithm/003 Dijkstra's Algorithm in Java - 2.mp451.3MB
282. 31 Dijkstra's Algorithm/004 Dijkstra's Algorithm with Negative Cycle.mp411.72MB
283. 32 Bellman Ford Algorithm/001 Bellman Ford Algorithm for SSSPP.mp444.08MB
284. 32 Bellman Ford Algorithm/002 Bellman Ford Algorithm with Negative Cycle.mp434.99MB
285. 32 Bellman Ford Algorithm/003 Why Bellman Ford runs V-1 times_.mp417.92MB
286. 32 Bellman Ford Algorithm/004 Bellman Ford Algorithm Implementation in Java.mp466.66MB
287. 32 Bellman Ford Algorithm/005 BFS vs Dijkstra vs Bellman Ford.mp424.42MB
288. 33 All Pairs Shortest Path Problem/001 What is All Pairs Shortest Path Problem_.mp437.61MB
289. 33 All Pairs Shortest Path Problem/002 Dry Run for All Pairs Shortest Path Problem.mp417.3MB
290. 34 Floyd Warshall Algorithm/001 Floyd Warshall Algorithm.mp431.33MB
291. 34 Floyd Warshall Algorithm/002 Why Floyd Warshall Algorithm_.mp427.31MB
292. 34 Floyd Warshall Algorithm/003 Floyd Warshall with Negative Cycle.mp46.48MB
293. 34 Floyd Warshall Algorithm/004 Floyd Warshall in Java.mp463.62MB
294. 34 Floyd Warshall Algorithm/005 BFS vs Dijkstra vs Bellman Ford vs Floyd Warshall Algorithms.mp416.23MB
295. 35 Minimum Spanning Tree (Disjoint Set)/001 What is Minimum Spanning Tree_.mp439.58MB
296. 35 Minimum Spanning Tree (Disjoint Set)/002 What is Disjoint Set_.mp49.75MB
297. 35 Minimum Spanning Tree (Disjoint Set)/003 Disjoint Set in Java.mp453.85MB
298. 36 Kruskal and Prim's Algorithms/001 Kruskal Algorithm.mp431.32MB
299. 36 Kruskal and Prim's Algorithms/002 Kruskal Algorithm in Java.mp476.78MB
300. 36 Kruskal and Prim's Algorithms/003 Prim's Algorithm.mp432.74MB
301. 36 Kruskal and Prim's Algorithms/004 Prim's Algorithm in Java.mp455.73MB
302. 36 Kruskal and Prim's Algorithms/005 Kruskal vs Prim's Algorithms.mp414.28MB
303. 37 Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/001 Introduction.mp42.64MB
304. 37 Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/002 Solution to Route Between Nodes.mp456.43MB
305. 38 Greedy Algorithms/001 What is Greedy Algorithm_.mp432.02MB
306. 38 Greedy Algorithms/002 Known Greedy Algorithms.mp426.55MB
307. 38 Greedy Algorithms/003 Activity Selection Problem.mp421.07MB
308. 38 Greedy Algorithms/004 Activity Selection Problem in Java.mp486.15MB
309. 38 Greedy Algorithms/005 Coin Change Problem.mp413.89MB
310. 38 Greedy Algorithms/006 Coin Change Problem in Java.mp437.25MB
311. 38 Greedy Algorithms/007 Fractional Knapsack Problem.mp424.26MB
312. 38 Greedy Algorithms/008 Fractional Knapsack Problem in Java.mp483.94MB
313. 39 Divide and Conquer Algorithms/001 What is a Divide and Conquer Algorithm_.mp425.18MB
314. 39 Divide and Conquer Algorithms/002 Common Divide and Conquer Algorithms.mp417.15MB
315. 39 Divide and Conquer Algorithms/003 How to solve Fibonacci series using Divide and Conquer approach_.mp416.69MB
316. 39 Divide and Conquer Algorithms/004 Number Factor.mp420.99MB
317. 39 Divide and Conquer Algorithms/005 Number Factor in Java.mp418.44MB
318. 39 Divide and Conquer Algorithms/006 House Robber.mp428.26MB
319. 39 Divide and Conquer Algorithms/007 House Robber in Java.mp423.18MB
320. 39 Divide and Conquer Algorithms/008 Convert One String to Another.mp423.14MB
321. 39 Divide and Conquer Algorithms/009 Convert One String to Another in Java.mp434.63MB
322. 39 Divide and Conquer Algorithms/010 Zero One Knapsack Problem.mp423.23MB
323. 39 Divide and Conquer Algorithms/011 Zero One Knapsack Problem in Java.mp433.3MB
324. 39 Divide and Conquer Algorithms/012 Longest Common Subsequence Problem.mp428.37MB
325. 39 Divide and Conquer Algorithms/013 Longest Common Subsequence Problem in Java.mp426.72MB
326. 39 Divide and Conquer Algorithms/014 Longest Palindromic Subsequence Problem.mp427.02MB
327. 39 Divide and Conquer Algorithms/015 Longest Palindromic Subsequence Problem in Java.mp426.06MB
328. 39 Divide and Conquer Algorithms/016 Minimum Cost to Reach Last Cell.mp421.44MB
329. 39 Divide and Conquer Algorithms/017 Minimum Cost to Reach Last Cell in Java.mp420.68MB
330. 39 Divide and Conquer Algorithms/018 Number of Paths To Reach The Last Cell with Given Cost.mp427.07MB
331. 39 Divide and Conquer Algorithms/019 Number of Paths To Reach The Last Cell with Given Cost in Java.mp423.52MB
332. 40 Dynamic Programming/001 What is Dynamic Programming_ (Overlapping property).mp422.24MB
333. 40 Dynamic Programming/002 Where Does the Name of DP Come From_.mp422.47MB
334. 40 Dynamic Programming/003 Top Down with Memoization.mp455.89MB
335. 40 Dynamic Programming/004 Bottom Up with Tabulation.mp436.57MB
336. 40 Dynamic Programming/005 Top Down vs Bottom Up.mp413.41MB
337. 40 Dynamic Programming/006 Is Merge Sort Dynamic Programming_.mp416.63MB
338. 40 Dynamic Programming/007 Number Factor Problem using Dynamic Programming.mp445.12MB
339. 40 Dynamic Programming/008 Number Factor _ Top Down and Bottom Up.mp436.24MB
340. 40 Dynamic Programming/009 House Robber Problem using Dynamic Programming.mp446.3MB
341. 40 Dynamic Programming/010 Convert one string to another using Dynamic Programming.mp423.73MB
342. 42 A Recipe for Problem Solving/002 Introduction.mp410.48MB
343. 42 A Recipe for Problem Solving/003 Step 1 - Understand the Problem.mp421.88MB
344. 42 A Recipe for Problem Solving/004 Step 2 - Examples.mp422.07MB
345. 42 A Recipe for Problem Solving/005 Step 3 - Break it Down.mp428.11MB
346. 42 A Recipe for Problem Solving/006 Step 4 - Solve or Simplify.mp451.79MB
347. 42 A Recipe for Problem Solving/007 Step 5 - Look Back and Refactor.mp431.31MB