Section 1 - Introduction
Section 2 - Recursion
Section 3 - Cracking Recursion Interview Questions
Section 4 - Bonus CHALLENGING Recursion Problems (Exercises)
Section 5 - Big O Notation
Section 6 - Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)
Section 7 - Arrays
Section 8 - Cracking Array Interview Questions (Amazon, Facebook, Apple and Microsoft)
Section 9 - CHALLENGING Array Problems (Exercises)
Section 10 - Linked List
Section 11 - Circular Singly Linked List
Section 12 - Doubly Linked List
Section 13 - Circular Doubly Linked List
Section 15 - Stack
Section 16 - Queue
Section 19 - Binary Search Tree
Section 20 - AVL Tree
Section 21 - Binary Heap
Section 22 - Trie
Section 23 - Hashing
Section 24 - Sort Algorithms
Section 25 - Searching Algorithms
Section 26 - Graph Algorithms
Section 27 - Graph Traversal
Section 28 - Topological Sort
Section 29 - Single Source Shortest Path Problem
Section 30 - Dijkstra's Algorithm
Section 31 - Bellman Ford Algorithm
Section 32 - All Pairs Shortest Path Problem
Section 33 - Floyd Warshall
Section 34 - Minimum Spanning Tree
Section 35 - Kruskal's and Prim's Algorithms
Section 37 - Greedy Algorithms
Section 38 - Divide and Conquer Algorithms
Section 39 - Dynamic Programming
Section 40 - CHALLENGING Dynamic Programming Problems
Section 41 - A Recipe for Problem Solving
Section 41 - Wild West