Resources - Data Structures and Algorithms - Prep
| Day | Date | Topic | Duration | Weekday |
|---|---|---|---|---|
| 1 | 1 - Introduction | 31.79 minutes | ||
| 1 | 2 - Recursion | 67.95 minutes | ||
| 1 | 2 - Recursion | 67.95 minutes | ||
| 1 | 3 - Cracking Recursion Interview Questions | 43.99 minutes | ||
| 2 | 5 - Big O Notation | 56.08 minutes | ||
| 3 | 5 - Big O Notation | 56.08 minutes | ||
| 4 | 6 - Top 10 Big O Interview Questions Amazon Facebook Apple and Microsoft | 29.44 minutes | ||
| 5 | 7 - Arrays | 152.11 minutes | ||
| 6 | 7 - Arrays | 152.11 minutes | ||
| 7 | 7 - Arrays | 152.11 minutes | ||
| 7 | 7 - Arrays | 152.11 minutes | ||
| 7 | 7 - Arrays | 152.11 minutes | ||
| 7 | 8 - Python Lists | 68.35 minutes | ||
| 7 | 8 - Python Lists | 68.35 minutes | ||
| 7 | 9 - PROJECT 1 ArraysLists | 12.91 minutes | ||
| 8 | 10 - Cracking ArrayList Interview Questions Amazon Facebook Apple and Microsoft | 40.24 minutes | ||
| 8 | 12 - Dictionaries | 64.05 minutes | ||
| 8 | 12 - Dictionaries | 64.05 minutes | ||
| 8 | 13 - Tuples | 34.78 minutes | ||
| 8 | 14 - Linked List | 104.08 minutes | ||
| 8 | 14 - Linked List | 104.08 minutes | ||
| 9 | 14 - Linked List | 104.08 minutes | ||
| 10 | 15 - Circular Singly Linked List | 73.50 minutes | ||
| 11 | 15 - Circular Singly Linked List | 73.50 minutes | ||
| 12 | 16 - Doubly Linked List | 79.22 minutes | ||
| 13 | 16 - Doubly Linked List | 79.22 minutes | ||
| 14 | 16 - Doubly Linked List | 79.22 minutes | ||
| 14 | 17 - Circular Doubly Linked List | 90.64 minutes | ||
| 14 | 17 - Circular Doubly Linked List | 90.64 minutes | ||
| 14 | 17 - Circular Doubly Linked List | 90.64 minutes | ||
| 14 | 18 - Cracking Linked List Interview Questions Amazon Facebook Apple and Microsoft | 59.85 minutes | ||
| 14 | 18 - Cracking Linked List Interview Questions Amazon Facebook Apple and Microsoft | 59.85 minutes | ||
| 15 | 19 - Stack | 52.47 minutes | ||
| 15 | 19 - Stack | 52.47 minutes | ||
| 15 | 20 - Queue | 96.78 minutes | ||
| 15 | 20 - Queue | 96.78 minutes | ||
| 15 | 20 - Queue | 96.78 minutes | ||
| 15 | 21 - Cracking Stack and Queue Interview Questions AmazonFacebook Apple Microsoft | 44.89 minutes | ||
| 16 | 22 - Tree Binary Tree | 162.99 minutes | ||
| 17 | 22 - Tree Binary Tree | 162.99 minutes | ||
| 18 | 22 - Tree Binary Tree | 162.99 minutes | ||
| 19 | 22 - Tree Binary Tree | 162.99 minutes | ||
| 20 | 22 - Tree Binary Tree | 162.99 minutes | ||
| 21 | 23 - Binary Search Tree | 52.00 minutes | ||
| 22 | 23 - Binary Search Tree | 52.00 minutes | ||
| 23 | 24 - AVL Tree | 117.42 minutes | ||
| 24 | 24 - AVL Tree | 117.42 minutes | ||
| 25 | 24 - AVL Tree | 117.42 minutes | ||
| 25 | 24 - AVL Tree | 117.42 minutes | ||
| 25 | 25 - Binary Heap | 56.25 minutes | ||
| 25 | 25 - Binary Heap | 56.25 minutes | ||
| 25 | 26 - Trie | 44.57 minutes | ||
| 25 | 27 - Hashing | 43.06 minutes | ||
| 26 | 28 - Sort Algorithms | 113.38 minutes | ||
| 26 | 28 - Sort Algorithms | 113.38 minutes | ||
| 26 | 28 - Sort Algorithms | 113.38 minutes | ||
| 26 | 28 - Sort Algorithms | 113.38 minutes | ||
| 26 | 29 - Searching Algorithms | 30.16 minutes | ||
| 26 | 30 - Graph Algorithms | 62.88 minutes | ||
| 27 | 30 - Graph Algorithms | 62.88 minutes | ||
| 28 | 31 - Graph Traversal Breadth First Search and Depth First Search | 31.45 minutes | ||
| 29 | 32 - Topological Sort Algorithm | 18.20 minutes | ||
| 30 | 33 - Single Source Shortest Path | 23.48 minutes | ||
| 31 | 34 - Graph Algorithms Dijsktras Algorithm | 59.19 minutes | ||
| 32 | 34 - Graph Algorithms Dijsktras Algorithm | 59.19 minutes | ||
| 32 | 35 - Graph Algorithms Bellman Ford Algorithm | 31.71 minutes | ||
| 32 | 36 - All Pairs Shortest Path | 8.78 minutes | ||
| 32 | 37 - Graph Algorithms Floyd Warshall Algorithm | 23.52 minutes | ||
| 32 | 38 - Minimum Spanning Tree Disjoint Set | 15.41 minutes | ||
| 32 | 39 - Graph Algorithms Kruskal and Prims Algorithms | 29.28 minutes | ||
| 33 | 40 - Cracking Trees and Graphs Top Interview Questions Apple Amazon Facebook | 101.92 minutes | ||
| 33 | 40 - Cracking Trees and Graphs Top Interview Questions Apple Amazon Facebook | 101.92 minutes | ||
| 33 | 40 - Cracking Trees and Graphs Top Interview Questions Apple Amazon Facebook | 101.92 minutes | ||
| 33 | 41 - Greedy Algorithms | 45.52 minutes | ||
| 33 | 41 - Greedy Algorithms | 45.52 minutes | ||
| 33 | 42 - Divide and Conquer Algorithms | 101.35 minutes | ||
| 34 | 42 - Divide and Conquer Algorithms | 101.35 minutes | ||
| 35 | 42 - Divide and Conquer Algorithms | 101.35 minutes | ||
| 36 | 43 - Dynamic Programming | 81.72 minutes | ||
| 37 | 43 - Dynamic Programming | 81.72 minutes | ||
| 38 | 43 - Dynamic Programming | 81.72 minutes | ||
| 39 | 45 - A Recipe for Problem Solving | 37.02 minutes | ||
| 39 | 46 - Backtracking | 41.69 minutes | ||
| 39 | 49 - Old Lectures | 9.64 minutes |