Day
Day 1
Day 2
Day 3
Day 4
Day 5
Day 6
Day 7
Day 8
Day 9
Day 10
Topics
Arrays & Strings:
- Basics, 2D Arrays
- Sliding Window, Two Pointers
- Prefix Sum & Kadane’s Algorithm
Recursion & Backtracking:
- Basics, Tail vs Head Recursion
- N-Queens, Sudoku Solver, Subsets
Linked Lists:
- Single, Doubly, Circular
- Reversal, Detect Loop, Intersection
Stacks & Queues:
- Stack Implementation, Infix to Postfix
- Monotonic Stack, Queue via Stack
- Circular Queue
Trees:
- Binary Tree, DFS & BFS
- Inorder/Pre/Post Order Traversal
- Height, Diameter, Balanced Tree
Binary Search Trees:
- Insertion, Deletion, Validation
- Kth Smallest Element, LCA
- AVL Tree Intro
Heap & Priority Queue:
- Max/Min Heap Implementation
- HeapSort, Top K Elements, Median in Stream
Graphs Basics:
- Representation (Adj List/Matrix)
- DFS, BFS, Connected Components
Advanced Graphs:
- Dijkstra’s, Bellman-Ford, Floyd-Warshall
- Topological Sort, Union Find (DSU)
Sorting & Greedy + Review:
- Merge, Quick, Counting Sort
- Activity Selection, Job Sequencing
- Review & Mock Interview Problems
Practice
LeetCode: Two Sum, Best Time to Buy/Sell Stock
GFG: Kadane’s Algo, Matrix Problems
LeetCode: Subsets, Permutations, Word Search
GFG: N-Queens, Rat in Maze
LeetCode: Reverse Linked List, Cycle Detection
GFG: Intersection, Palindrome LL
LeetCode: Valid Parentheses, Daily Temperatures
GFG: Circular Tour, Queue using Stack
LeetCode: Max Depth, Symmetric Tree, Path Sum
GFG: Height, Diameter of Tree
LeetCode: Validate BST, Kth Smallest, LCA
GFG: Floor in BST, AVL Rotations
LeetCode: Top K Frequent, Merge K Sorted Lists
GFG: HeapSort, Median in Stream
LeetCode: Number of Islands, Clone Graph
GFG: BFS of Graph, DFS Traversal
LeetCode: Course Schedule, Dijkstra
GFG: Union-Find, Detect Cycle in Undirected Graph
LeetCode: Merge Intervals, K Closest Points
GFG: Job Sequencing, QuickSort
