1 - Introduction/1 - Curriculum Walkthrough.mp436.68MB

1 - Introduction/2 - What are Data Structures.mp420.74MB

1 - Introduction/3 - What is an algorithm.mp47.92MB

1 - Introduction/4 - Why are Data Structures and Algorithms important.mp49.42MB

1 - Introduction/5 - Types of Data Structures.mp44.35MB

1 - Introduction/6 - Types of Algorithms.mp46.12MB

1 - Introduction/9 - Code Editor.mp410.01MB

10 - Cracking ArrayList Interview Questions Amazon Facebook Apple and Microsoft/90 - Question 1.mp48.72MB

10 - Cracking ArrayList Interview Questions Amazon Facebook Apple and Microsoft/91 - Question 2.mp412.39MB

10 - Cracking ArrayList Interview Questions Amazon Facebook Apple and Microsoft/92 - Question 3.mp46.87MB

10 - Cracking ArrayList Interview Questions Amazon Facebook Apple and Microsoft/93 - Question 4.mp411.98MB

10 - Cracking ArrayList Interview Questions Amazon Facebook Apple and Microsoft/94 - Question 5.mp48.25MB

10 - Cracking ArrayList Interview Questions Amazon Facebook Apple and Microsoft/95 - Question 6.mp411.73MB

10 - Cracking ArrayList Interview Questions Amazon Facebook Apple and Microsoft/96 - Question 7.mp422.14MB

12 - Dictionaries/105 - What is a Dictionary.mp412.02MB

12 - Dictionaries/106 - Create a Dictionary.mp411.48MB

12 - Dictionaries/107 - Dictionaries in memory.mp45.77MB

12 - Dictionaries/108 - Insert Update an element in a Dictionary.mp48.55MB

12 - Dictionaries/109 - Traverse through a Dictionary.mp48.24MB

12 - Dictionaries/110 - Search for an element in a Dictionary.mp49.25MB

12 - Dictionaries/111 - Delete Remove an element from a Dictionary.mp412.08MB

12 - Dictionaries/112 - Dictionary Methods.mp436.42MB

12 - Dictionaries/113 - Dictionary operations built in functions.mp429.95MB

12 - Dictionaries/114 - Dictionary vs List.mp43.44MB

12 - Dictionaries/115 - Time and Space Complexity of a Dictionary.mp47.04MB

13 - Tuples/118 - What is a Tuple How to create it.mp410.44MB

13 - Tuples/119 - Tuples in Memory Accessing an element of Tuple.mp410.66MB

13 - Tuples/120 - Traversing a Tuple.mp44.68MB

13 - Tuples/121 - Search for an element in Tuple.mp411.32MB

13 - Tuples/122 - Tuple OperationsFunctions.mp410.13MB

13 - Tuples/123 - Tuple vs List.mp418.76MB

13 - Tuples/124 - Time and Space complexity of Tuples.mp43.12MB

14 - Linked List/127 - What is a Linked List.mp438.64MB

14 - Linked List/128 - Linked List vs Arrays.mp46.29MB

14 - Linked List/129 - Types of Linked List.mp417.17MB

14 - Linked List/130 - Linked List in the Memory.mp45.06MB

14 - Linked List/131 - Creation of Singly Linked List.mp412.7MB

14 - Linked List/132 - Insertion in Singly Linked List in Memory.mp46.01MB

14 - Linked List/133 - Insertion in Singly Linked List Algorithm.mp414.11MB

14 - Linked List/134 - Insertion Method in Singly Linked List.mp429.88MB

14 - Linked List/135 - Traversal of Singly Linked List.mp411.89MB

14 - Linked List/136 - Search for a value in Single Linked List.mp414.32MB

14 - Linked List/137 - Deletion of node from Singly Linked List.mp415.84MB

14 - Linked List/138 - Deletion Method in Singly Linked List.mp423.96MB

14 - Linked List/139 - Deletion of entire Singly Linked List.mp49.18MB

14 - Linked List/140 - Time and Space Complexity of Singly Linked List.mp45.27MB

14 - Linked List/141 - Time Complexity of Linked List vs Arrays.mp413.29MB

15 - Circular Singly Linked List/144 - Creation of Circular Singly Linked List.mp413.49MB

15 - Circular Singly Linked List/145 - Insertion in Circular Singly Linked List.mp49.9MB

15 - Circular Singly Linked List/146 - Insertion Algorithm in Circular Singly Linked List.mp45.74MB

15 - Circular Singly Linked List/147 - Insertion method in Circular Singly Linked List.mp422.17MB

15 - Circular Singly Linked List/148 - Traversal of Circular Singly Linked List.mp411.79MB

15 - Circular Singly Linked List/149 - Searching a node in Circular Singly Linked List.mp416.2MB

15 - Circular Singly Linked List/150 - Deletion of a node from Circular Singly Linked List.mp410.85MB

15 - Circular Singly Linked List/151 - Deletion Algorithm in Circular Singly Linked List.mp46.89MB

15 - Circular Singly Linked List/152 - Delete Method in Circular Singlu Linked List.mp430.2MB

15 - Circular Singly Linked List/153 - Deletion of entire Circular Singly Linked List.mp49.92MB

15 - Circular Singly Linked List/154 - Time and Space Complexity of Circular Singly Linked List.mp48.15MB

16 - Doubly Linked List/155 - Creation of Doubly Linked List.mp417.02MB

16 - Doubly Linked List/156 - Insertion in Doubly Linked List.mp49.69MB

16 - Doubly Linked List/157 - Insertion Algorithm in Doubly Linked List.mp48.51MB

16 - Doubly Linked List/158 - Insertion Method in Doubly Linked List.mp424.57MB

16 - Doubly Linked List/159 - Traversal of Doubly Linked List.mp410.32MB

16 - Doubly Linked List/160 - Reverse Traversal of Doubly Linked List.mp49.7MB

16 - Doubly Linked List/161 - Searching for a node in Doubly Linked List.mp412.23MB

16 - Doubly Linked List/162 - Deletion of a node in Doubly Linked List.mp410.9MB

16 - Doubly Linked List/163 - Deletion Algorithm in Doubly Linked List.mp45.76MB

16 - Doubly Linked List/164 - Deletion Method in Doubly Linked List.mp424.16MB

16 - Doubly Linked List/165 - Deletion of entire Doubly Linked List.mp413.35MB

16 - Doubly Linked List/166 - Time and Space Complexity of Doubly Linked List.mp47.85MB

17 - Circular Doubly Linked List/167 - Creation of Circular Doubly Linked List.mp417.85MB

17 - Circular Doubly Linked List/168 - Insertion in Circular Doubly Linked List.mp414.55MB

17 - Circular Doubly Linked List/169 - Insertion Algorithm in Circular Doubly Linked List.mp48.41MB

17 - Circular Doubly Linked List/170 - Insertion Method in Circular Doubly Linked List.mp426.52MB

17 - Circular Doubly Linked List/171 - Traversal of Circular Doubly Linked List.mp414.42MB

17 - Circular Doubly Linked List/172 - Reverse Traversal of Circular Doubly Linked List.mp413.25MB

17 - Circular Doubly Linked List/173 - Search for a node in Circular Doubly Linked List.mp416.22MB

17 - Circular Doubly Linked List/174 - Delete a node from Circular Doubly Linked List.mp415.19MB

17 - Circular Doubly Linked List/175 - Deletion Algorithm in Circular Doubly Linked List.mp48.68MB

17 - Circular Doubly Linked List/176 - Deletion Method in Circular Doubly Linked List.mp428.39MB

17 - Circular Doubly Linked List/177 - Delete Entire Circular Doubly Linked List.mp417.76MB

17 - Circular Doubly Linked List/178 - Time and Space Complexity of Circular Doubly Linked List.mp46.31MB

18 - Cracking Linked List Interview Questions Amazon Facebook Apple and Microsoft/179 - Linked List Class.mp459.2MB

18 - Cracking Linked List Interview Questions Amazon Facebook Apple and Microsoft/180 - Question 1.mp427.54MB

18 - Cracking Linked List Interview Questions Amazon Facebook Apple and Microsoft/181 - Question 2.mp413.79MB

18 - Cracking Linked List Interview Questions Amazon Facebook Apple and Microsoft/182 - Question 3.mp416.81MB

18 - Cracking Linked List Interview Questions Amazon Facebook Apple and Microsoft/183 - Question 4.mp415.36MB

18 - Cracking Linked List Interview Questions Amazon Facebook Apple and Microsoft/184 - Question 5.mp423.57MB

18 - Cracking Linked List Interview Questions Amazon Facebook Apple and Microsoft/185 - Q4SumLists.py677B

19 - Stack/187 - What is a Stack.mp47.62MB

19 - Stack/188 - Stack Operations.mp46.58MB

19 - Stack/189 - Create Stack using List without size limit.mp45.32MB

19 - Stack/190 - Operations on Stack using List push pop peek isEmpty Delete.mp419.27MB

19 - Stack/191 - Create Stack with limit pop push peek isFull isEmpty delete.mp418.73MB

19 - Stack/192 - Create Stack using Linked List.mp46.52MB

19 - Stack/193 - Operation on Stack using Linked List pop push peek isEmpty delete.mp421.46MB

19 - Stack/194 - Time and Space Complexity of Stack using Linked List.mp45.15MB

19 - Stack/195 - When to useavoid Stack.mp42.24MB

2 - Recursion/10 - What is Recursion.mp456.76MB

2 - Recursion/11 - Why do we need recursion.mp45.82MB

2 - Recursion/12 - How Recursion works.mp417.37MB

2 - Recursion/13 - Recursive vs Iterative Solutions.mp47.67MB

2 - Recursion/14 - When to useavoid Recursion.mp412.13MB

2 - Recursion/15 - How to write Recursion in 3 steps.mp432.48MB

2 - Recursion/16 - How to find Fibonacci numbers using Recursion.mp427.74MB

20 - Queue/198 - What is Queue.mp419.02MB

20 - Queue/199 - Queue using Python List.mp49.36MB

20 - Queue/200 - Queue using Python List.mp431.61MB

20 - Queue/201 - Circular Queue.mp48.92MB

20 - Queue/202 - Circular Queue.mp440.6MB

20 - Queue/203 - Queue.mp411.3MB

20 - Queue/204 - Queue.mp418.05MB

20 - Queue/205 - Queue.mp419.04MB

20 - Queue/206 - Time and Space complexity of Queue using Linked List.mp44.43MB

20 - Queue/207 - List vs Linked List Implementation.mp47.52MB

20 - Queue/208 - Collections Module.mp49.92MB

20 - Queue/209 - Queue Module.mp410.2MB

20 - Queue/210 - Multiprocessing module.mp44.45MB

21 - Cracking Stack and Queue Interview Questions AmazonFacebook Apple Microsoft/213 - Question 1 Three in One.mp462.25MB

21 - Cracking Stack and Queue Interview Questions AmazonFacebook Apple Microsoft/214 - Question 2.mp420.26MB

21 - Cracking Stack and Queue Interview Questions AmazonFacebook Apple Microsoft/215 - Question 3.mp418.69MB

21 - Cracking Stack and Queue Interview Questions AmazonFacebook Apple Microsoft/216 - Question 4.mp412.85MB

21 - Cracking Stack and Queue Interview Questions AmazonFacebook Apple Microsoft/217 - Question 5.mp416.87MB

22 - Tree Binary Tree/220 - What is a Tree.mp427.24MB

22 - Tree Binary Tree/221 - Why Tree.mp43.89MB

22 - Tree Binary Tree/222 - Tree Terminology.mp49.22MB

22 - Tree Binary Tree/223 - How to create basic tree in Python.mp414.12MB

22 - Tree Binary Tree/224 - Binary Tree.mp43.21MB

22 - Tree Binary Tree/225 - Types of Binary Tree.mp44.79MB

22 - Tree Binary Tree/226 - Binary Tree Representation.mp47.76MB

22 - Tree Binary Tree/227 - Create Binary Tree Linked List.mp46.86MB

22 - Tree Binary Tree/228 - PreOrder Traversal Binary Tree Linked List.mp422.7MB

22 - Tree Binary Tree/229 - InOrder Traversal Binary Tree Linked List.mp417.03MB

22 - Tree Binary Tree/230 - PostOrder Traversal Binary Tree Linked List.mp416.59MB

22 - Tree Binary Tree/231 - LevelOrder Traversal Binary Tree Linked List.mp424.88MB

22 - Tree Binary Tree/232 - Searching for a node in Binary Tree Linked List.mp416.73MB

22 - Tree Binary Tree/233 - Inserting a node in Binary Tree Linked List.mp425.04MB

22 - Tree Binary Tree/234 - Delete a node from Binary Tree Linked List.mp438.95MB

22 - Tree Binary Tree/235 - Delete entire Binary Tree Linked List.mp47.33MB

22 - Tree Binary Tree/236 - Create Binary Tree Python List.mp410.02MB

22 - Tree Binary Tree/237 - Insert a value Binary Tree Python List.mp412.24MB

22 - Tree Binary Tree/238 - Search for a node in Binary Tree Python List.mp411.48MB

22 - Tree Binary Tree/239 - PreOrder Traversal Binary Tree Python List.mp412.61MB

22 - Tree Binary Tree/240 - InOrder Traversal Binary Tree Python List.mp410.06MB

22 - Tree Binary Tree/241 - PostOrder Traversal Binary Tree Python List.mp49.73MB

22 - Tree Binary Tree/242 - Level Order Traversal Binary Tree Python List.mp47.7MB

22 - Tree Binary Tree/243 - Delete a node from Binary Tree Python List.mp413.34MB

22 - Tree Binary Tree/244 - Delete Entire Binary Tree Python List.mp45.91MB

22 - Tree Binary Tree/245 - Linked List vs Python List Binary Tree.mp49.15MB

23 - Binary Search Tree/248 - What is a Binary Search Tree Why do we need it.mp410.87MB

23 - Binary Search Tree/249 - Create a Binary Search Tree.mp45.55MB

23 - Binary Search Tree/250 - Insert a node to BST.mp441.43MB

23 - Binary Search Tree/251 - Traverse BST.mp437.34MB

23 - Binary Search Tree/252 - Search in BST.mp411.88MB

23 - Binary Search Tree/253 - Delete a node from BST.mp433.65MB

23 - Binary Search Tree/254 - Delete entire BST.mp47.24MB

23 - Binary Search Tree/255 - Time and Space complexity of BST.mp45.28MB

24 - AVL Tree/258 - What is an AVL Tree.mp421.69MB

24 - AVL Tree/259 - Why AVL Tree.mp46.81MB

24 - AVL Tree/260 - Common Operations on AVL Trees.mp424.66MB

24 - AVL Tree/261 - Insert a node in AVL Left Left Condition.mp418.18MB

24 - AVL Tree/262 - Insert a node in AVL Left Right Condition.mp414.98MB

24 - AVL Tree/263 - Insert a node in AVL Right Right Condition.mp410.75MB

24 - AVL Tree/264 - Insert a node in AVL Right Left Condition.mp411.4MB

24 - AVL Tree/265 - Insert a node in AVL all together.mp422.48MB

24 - AVL Tree/266 - Insert a node in AVL method.mp435.72MB

24 - AVL Tree/267 - Delete a node from AVL LL LR RR RL.mp410.64MB

24 - AVL Tree/268 - Delete a node from AVL all together.mp48.35MB

24 - AVL Tree/269 - Delete a node from AVL method.mp427.93MB

24 - AVL Tree/270 - Delete entire AVL.mp48.91MB

24 - AVL Tree/271 - Time and Space complexity of AVL Tree.mp47.26MB

25 - Binary Heap/274 - What is Binary Heap Why do we need it.mp432.3MB

25 - Binary Heap/275 - Common operations Creation Peek sizeofheap on Binary Heap.mp424.06MB

25 - Binary Heap/276 - Insert a node in Binary Heap.mp433.35MB

25 - Binary Heap/277 - Extract a node from Binary Heap.mp440.21MB

25 - Binary Heap/278 - Delete entire Binary Heap.mp44.36MB

25 - Binary Heap/279 - Time and space complexity of Binary Heap.mp46.91MB

26 - Trie/282 - What is a Trie Why we need it.mp429.12MB

26 - Trie/283 - Common Operations on Trie Creation.mp46.02MB

26 - Trie/284 - Insert a string in Trie.mp414.47MB

26 - Trie/285 - Search for a string in Trie.mp411.15MB

26 - Trie/286 - Delete a string from Trie.mp430.32MB

26 - Trie/287 - Practical use of Trie.mp43.27MB

27 - Hashing/290 - What is Hashing Why we need it.mp416.78MB

27 - Hashing/291 - Hashing Terminology.mp46.81MB

27 - Hashing/292 - Hash Functions.mp412.19MB

27 - Hashing/293 - Types of Collision Resolution Techniques.mp417.74MB

27 - Hashing/294 - Hash Table is Full.mp45.02MB

27 - Hashing/295 - Pros and Cons of Resolution Techniques.mp47.62MB

27 - Hashing/296 - Practical Use of Hashing.mp47.68MB

27 - Hashing/297 - Hashing vs Other DS.mp44.31MB

28 - Sort Algorithms/300 - What is Sorting.mp410.89MB

28 - Sort Algorithms/301 - Types of Sorting.mp410.94MB

28 - Sort Algorithms/302 - Sorting Terminologies.mp48.11MB

28 - Sort Algorithms/303 - Bubble Sort.mp442.17MB

28 - Sort Algorithms/304 - Selection Sort.mp423.56MB

28 - Sort Algorithms/305 - Insertion Sort.mp420.32MB

28 - Sort Algorithms/306 - Bucket Sort.mp428.6MB

28 - Sort Algorithms/307 - Merge Sort.mp430.11MB

28 - Sort Algorithms/308 - Quick Sort.mp444.91MB

28 - Sort Algorithms/309 - Heap Sort.mp427.69MB

28 - Sort Algorithms/310 - Comparison of Sorting Algorithms.mp42.39MB

29 - Searching Algorithms/313 - Introduction to Searching Algorithms.mp44.7MB

29 - Searching Algorithms/314 - Linear Search.mp44.05MB

29 - Searching Algorithms/315 - Linear Search in Python.mp425.42MB

29 - Searching Algorithms/316 - Binary Search.mp43.76MB

29 - Searching Algorithms/317 - Binary Search in Python.mp429.2MB

29 - Searching Algorithms/318 - Time Complexity of Binary Search.mp410.08MB

3 - Cracking Recursion Interview Questions/20 - Question 1 Sum of Digits.mp456.38MB

3 - Cracking Recursion Interview Questions/21 - Question 2.mp418.42MB

3 - Cracking Recursion Interview Questions/22 - Question 3.mp420.4MB

3 - Cracking Recursion Interview Questions/23 - Question 4.mp420.04MB

30 - Graph Algorithms/320 - What is a Graph Why Graph.mp430.81MB

30 - Graph Algorithms/321 - Graph Terminology.mp410.73MB

30 - Graph Algorithms/322 - Types of Graph.mp49.25MB

30 - Graph Algorithms/323 - Graph Representation.mp415.11MB

30 - Graph Algorithms/324 - Create a graph using Python.mp411.4MB

30 - Graph Algorithms/325 - Create Graph using Python.mp426.91MB

30 - Graph Algorithms/326 - Add Edge.mp418.8MB

30 - Graph Algorithms/327 - Remove Edge.mp419.12MB

30 - Graph Algorithms/328 - Remove Vertex.mp418.09MB

31 - Graph Traversal Breadth First Search and Depth First Search/331 - Graph traversal.mp414.51MB

31 - Graph Traversal Breadth First Search and Depth First Search/332 - BFS Traversal in Python.mp416.3MB

31 - Graph Traversal Breadth First Search and Depth First Search/333 - Graph Traversal.mp413.32MB

31 - Graph Traversal Breadth First Search and Depth First Search/334 - DFS Traversal in Python.mp412.89MB

31 - Graph Traversal Breadth First Search and Depth First Search/335 - BFS Traversal vs DFS Traversal.mp46.27MB

32 - Topological Sort Algorithm/337 - Topological Sort.mp45.32MB

32 - Topological Sort Algorithm/338 - Topological Sort Algorithm.mp411.67MB

32 - Topological Sort Algorithm/339 - Topological Sort in Python.mp418.45MB

33 - Single Source Shortest Path/341 - Single Source Shortest Path Problem SSSPP.mp410.72MB

33 - Single Source Shortest Path/342 - BFS for SSSPP.mp412.01MB

33 - Single Source Shortest Path/343 - BFS for SSSPP in Python.mp415.85MB

33 - Single Source Shortest Path/344 - Why does BFS not work with weighted Graph.mp44.04MB

33 - Single Source Shortest Path/345 - Why does DFS not work for SSSP.mp43.09MB

34 - Graph Algorithms Dijsktras Algorithm/347 - Dijkstras Algorithm for SSSP.mp49.79MB

34 - Graph Algorithms Dijsktras Algorithm/348 - Dijkstras Algorithm Visualization.mp422.94MB

34 - Graph Algorithms Dijsktras Algorithm/349 - Dijkstra Implementation Part 1.mp455.65MB

34 - Graph Algorithms Dijsktras Algorithm/350 - Dijkstra Implementation Part 2.mp477MB

34 - Graph Algorithms Dijsktras Algorithm/351 - Dijkstra Algorithm Testing.mp420.5MB

34 - Graph Algorithms Dijsktras Algorithm/352 - Dijkstra Algorithm with negative cycle.mp46.09MB

35 - Graph Algorithms Bellman Ford Algorithm/354 - Bellman Ford Algorithm.mp421.2MB

35 - Graph Algorithms Bellman Ford Algorithm/355 - Bellman Ford Algorithm with negative cycle.mp412.05MB

35 - Graph Algorithms Bellman Ford Algorithm/356 - Why Bellman Ford runs V.mp47.25MB

35 - Graph Algorithms Bellman Ford Algorithm/357 - Bellman Ford in Python.mp416.83MB

35 - Graph Algorithms Bellman Ford Algorithm/358 - BFS vs Dijkstra vs Bellman Ford.mp48.35MB

36 - All Pairs Shortest Path/360 - All pairs shortest path problem.mp410.5MB

36 - All Pairs Shortest Path/361 - Dry run for All pair shortest path.mp46.86MB

37 - Graph Algorithms Floyd Warshall Algorithm/362 - Floyd Warshall Algorithm.mp412.95MB

37 - Graph Algorithms Floyd Warshall Algorithm/363 - Why Floyd Warshall.mp411.16MB

37 - Graph Algorithms Floyd Warshall Algorithm/364 - Floyd Warshall with negative cycle.mp43.34MB

37 - Graph Algorithms Floyd Warshall Algorithm/365 - Floyd Warshall in Python.mp412.04MB

37 - Graph Algorithms Floyd Warshall Algorithm/366 - BFS vs Dijkstra vs Bellman Ford vs Floyd Warshall.mp46.63MB

38 - Minimum Spanning Tree Disjoint Set/368 - Minimum Spanning Tree.mp411.92MB

38 - Minimum Spanning Tree Disjoint Set/369 - Disjoint Set.mp44.61MB

38 - Minimum Spanning Tree Disjoint Set/370 - Disjoint Set in Python.mp417.05MB

39 - Graph Algorithms Kruskal and Prims Algorithms/372 - Kruskal Algorithm.mp423.19MB

39 - Graph Algorithms Kruskal and Prims Algorithms/373 - Kruskal Algorithm in Python.mp416.37MB

39 - Graph Algorithms Kruskal and Prims Algorithms/374 - Prims Algorithm.mp432.74MB

39 - Graph Algorithms Kruskal and Prims Algorithms/375 - Prims Algorithm in Python.mp412.77MB

39 - Graph Algorithms Kruskal and Prims Algorithms/376 - Prims vs Kruskal.mp45.74MB

40 - Cracking Trees and Graphs Top Interview Questions Apple Amazon Facebook/378 - Introduction.mp41015.16KB

40 - Cracking Trees and Graphs Top Interview Questions Apple Amazon Facebook/379 - Solution to Route Between Nodes.mp418.3MB

40 - Cracking Trees and Graphs Top Interview Questions Apple Amazon Facebook/380 - Solution to Minimal Tree.mp441.37MB

40 - Cracking Trees and Graphs Top Interview Questions Apple Amazon Facebook/381 - Solution to List of Depths.mp433.87MB

40 - Cracking Trees and Graphs Top Interview Questions Apple Amazon Facebook/382 - Solution to Check Balanced.mp421.2MB

40 - Cracking Trees and Graphs Top Interview Questions Apple Amazon Facebook/383 - Solution to Validate BST.mp423.01MB

40 - Cracking Trees and Graphs Top Interview Questions Apple Amazon Facebook/384 - Solution to Successor.mp420.39MB

40 - Cracking Trees and Graphs Top Interview Questions Apple Amazon Facebook/385 - Solution to Build Order.mp466.34MB

40 - Cracking Trees and Graphs Top Interview Questions Apple Amazon Facebook/386 - Solution to First Common Ancestor.mp428.02MB

41 - Greedy Algorithms/388 - What is Greedy Algorithm.mp412.65MB

41 - Greedy Algorithms/389 - Greedy Algorithms Insertion Sort Selection Sort Prim Kruskal Topological.mp412.9MB

41 - Greedy Algorithms/390 - Activity Selection Problem.mp410.1MB

41 - Greedy Algorithms/391 - Activity Selection Problem in Python.mp49.9MB

41 - Greedy Algorithms/392 - Coin Change Problem.mp46.82MB

41 - Greedy Algorithms/393 - Coin Change Problem in Python.mp48.31MB

41 - Greedy Algorithms/394 - Fractional Knapsack Problem.mp411.07MB

41 - Greedy Algorithms/395 - Fractional Knapsack Problem in Python.mp416MB

42 - Divide and Conquer Algorithms/397 - What is a Divide and Conquer Algorithm.mp411.55MB

42 - Divide and Conquer Algorithms/398 - Common Divide and Conquer algorithms.mp48.42MB

42 - Divide and Conquer Algorithms/399 - How to solve Fibonacci series using Divide and Conquer approach.mp47.88MB

42 - Divide and Conquer Algorithms/400 - Number Factor.mp49.86MB

42 - Divide and Conquer Algorithms/401 - Number Factor in Python.mp45.45MB

42 - Divide and Conquer Algorithms/402 - House Robber.mp412.87MB

42 - Divide and Conquer Algorithms/403 - House Robber Problem in Python.mp48.69MB

42 - Divide and Conquer Algorithms/404 - Convert one string to another.mp410.55MB

42 - Divide and Conquer Algorithms/405 - Convert One String to another in Python.mp414.3MB

42 - Divide and Conquer Algorithms/406 - Zero One Knapsack problem.mp410.1MB

42 - Divide and Conquer Algorithms/407 - Zero One Knapsack problem in Python.mp415.07MB

42 - Divide and Conquer Algorithms/408 - Longest Common Sequence Problem.mp412.37MB

42 - Divide and Conquer Algorithms/409 - Longest Common Subsequence in Python.mp47.71MB

42 - Divide and Conquer Algorithms/410 - Longest Palindromic Subsequence Problem.mp411.64MB

42 - Divide and Conquer Algorithms/411 - Longest Palindromic Subsequence in Python.mp47.64MB

42 - Divide and Conquer Algorithms/412 - Minimum cost to reach the Last cell problem.mp49.42MB

42 - Divide and Conquer Algorithms/413 - Minimum Cost to reach the Last Cell in 2D array using Python.mp45.82MB

42 - Divide and Conquer Algorithms/414 - Number of Ways to reach the Last Cell with given Cost.mp411.42MB

42 - Divide and Conquer Algorithms/415 - Number of Ways to reach the Last Cell with given Cost in Python.mp49.59MB

43 - Dynamic Programming/417 - What is Dynamic Programming Overlapping property.mp49.47MB

43 - Dynamic Programming/418 - Where does the name of DP come from.mp422.5MB

43 - Dynamic Programming/419 - Top Down with Memoization.mp426.16MB

43 - Dynamic Programming/420 - Bottom Up with Tabulation.mp413.82MB

43 - Dynamic Programming/421 - Top Down vs Bottom Up.mp46.83MB

43 - Dynamic Programming/422 - Is Merge Sort Dynamic Programming.mp47.9MB

43 - Dynamic Programming/423 - Number Factor Problem using Dynamic Programming.mp421.52MB

43 - Dynamic Programming/424 - Number Factor Top Down and Bottom Up.mp415.27MB

43 - Dynamic Programming/425 - House Robber Problem using Dynamic Programming.mp420.49MB

43 - Dynamic Programming/426 - House Robber Top Down and Bottom Up.mp416.29MB

43 - Dynamic Programming/427 - Convert one string to another using Dynamic Programming.mp410.62MB

43 - Dynamic Programming/429 - Zero One Knapsack using Dynamic Programming.mp434.97MB

45 - A Recipe for Problem Solving/442 - Introduction.mp48.68MB

45 - A Recipe for Problem Solving/443 - Step 1.mp411.56MB

45 - A Recipe for Problem Solving/444 - Step 2.mp49.71MB

45 - A Recipe for Problem Solving/445 - Step 3.mp417.23MB

45 - A Recipe for Problem Solving/446 - Step 4.mp422.69MB

45 - A Recipe for Problem Solving/447 - Step 5.mp413.97MB

46 - Backtracking/449 - What is Backtracking.mp416.23MB

46 - Backtracking/450 - Backtracking vs Brute Force Approach.mp48.06MB

46 - Backtracking/451 - N.mp417.73MB

46 - Backtracking/452 - N.mp435.37MB

49 - Old Lectures/484 - Dijkstras Algorithm in Python.mp420.8MB

5 - Big O Notation/31 - Analogy and Time Complexity.mp416.06MB

5 - Big O Notation/32 - Big O Big Theta and Big Omega.mp416.08MB

5 - Big O Notation/33 - Time complexity examples.mp430.63MB

5 - Big O Notation/34 - Space Complexity.mp43.9MB

5 - Big O Notation/35 - Drop the Constants and the non dominant terms.mp46.32MB

5 - Big O Notation/36 - Add vs Multiply.mp42.14MB

5 - Big O Notation/37 - How to measure the codes using Big O.mp412.51MB

5 - Big O Notation/38 - How to find time complexity for Recursive calls.mp418.2MB

5 - Big O Notation/39 - How to measure Recursive Algorithms that make multiple calls.mp48.31MB

6 - Top 10 Big O Interview Questions Amazon Facebook Apple and Microsoft/42 - Question 1.mp45.19MB

6 - Top 10 Big O Interview Questions Amazon Facebook Apple and Microsoft/43 - Question 2.mp42.87MB

6 - Top 10 Big O Interview Questions Amazon Facebook Apple and Microsoft/44 - Question 3.mp45.99MB

6 - Top 10 Big O Interview Questions Amazon Facebook Apple and Microsoft/45 - Question 4.mp43.12MB

6 - Top 10 Big O Interview Questions Amazon Facebook Apple and Microsoft/46 - Question 5.mp42.75MB

6 - Top 10 Big O Interview Questions Amazon Facebook Apple and Microsoft/47 - Question 6.mp44.53MB

6 - Top 10 Big O Interview Questions Amazon Facebook Apple and Microsoft/48 - Question 7.mp45.59MB

6 - Top 10 Big O Interview Questions Amazon Facebook Apple and Microsoft/49 - Question 8.mp47.1MB

6 - Top 10 Big O Interview Questions Amazon Facebook Apple and Microsoft/50 - Question 9.mp45.27MB

6 - Top 10 Big O Interview Questions Amazon Facebook Apple and Microsoft/51 - Question 10.mp44.82MB

7 - Arrays/54 - What is an Array.mp433.32MB

7 - Arrays/55 - Types of Array.mp417.34MB

7 - Arrays/56 - Arrays in Memory.mp49.82MB

7 - Arrays/57 - Create an Array.mp410.01MB

7 - Arrays/58 - Insertion Operation.mp418.46MB

7 - Arrays/59 - Traversal Operation.mp46.5MB

7 - Arrays/60 - Accessing an element of Array.mp414.11MB

7 - Arrays/61 - Searching for an element in Array.mp412.72MB

7 - Arrays/62 - Deleting an element from Array.mp46.11MB

7 - Arrays/63 - Time and Space complexity of One Dimensional Array.mp410.18MB

7 - Arrays/64 - One Dimensional Array Practice.mp465.74MB

7 - Arrays/65 - Create Two Dimensional Array.mp413.39MB

7 - Arrays/66 - Insertion.mp417MB

7 - Arrays/67 - Accessing an element of Two Dimensional Array.mp420.3MB

7 - Arrays/68 - Traversal.mp413.96MB

7 - Arrays/69 - Searching for an element in Two Dimensional Array.mp418.17MB

7 - Arrays/70 - Deletion.mp412.07MB

7 - Arrays/71 - Time and Space complexity of Two Dimensional Array.mp46.9MB

7 - Arrays/72 - When to useavoid array.mp43.54MB

8 - Python Lists/75 - What is a List How to create it.mp419.87MB

8 - Python Lists/76 - AccessingTraversing a list.mp430.11MB

8 - Python Lists/77 - UpdateInsert a List.mp427.24MB

8 - Python Lists/78 - SliceDelete from a List.mp420.41MB

8 - Python Lists/79 - Searching for an element in a List.mp413.16MB

8 - Python Lists/80 - List OperationsFunctions.mp422.62MB

8 - Python Lists/81 - Lists and strings.mp48.85MB

8 - Python Lists/82 - Common List pitfalls and ways to avoid them.mp410.1MB

8 - Python Lists/83 - Lists vs Arrays.mp48.56MB

8 - Python Lists/84 - Time and Space Complexity of List.mp46.48MB

8 - Python Lists/85 - lists.py1.24KB

9 - PROJECT 1 ArraysLists/87 - Goals.mp43.72MB

9 - PROJECT 1 ArraysLists/88 - Calculate Average Temperature.mp410.14MB

9 - PROJECT 1 ArraysLists/89 - Find the Days Above Average Temperature.mp411.47MB