1. Linked Lists
Singly Linked List, Doubly Linked List, Circular Linked List, Fast & Slow Pointers
Master intermediate Data Structures & Algorithms concepts and build the foundation required for coding interviews.
Singly Linked List, Doubly Linked List, Circular Linked List, Fast & Slow Pointers
Stack Operations, Queue, Circular Queue, Deque, Monotonic Stack
Binary Trees, BST, Tree Traversals, Lowest Common Ancestor
Min Heap, Max Heap, Heap Sort, Priority Queue, Top-K Problems
BFS, DFS, Connected Components, Shortest Path Algorithms
Activity Selection, Scheduling Problems, Interval Problems, Huffman Coding
Memoization, Tabulation, 0/1 Knapsack, LCS, LIS Patterns
N-Queens, Sudoku Solver, Permutations, Combinations, Subsets