Day Topic
1 Java setup, Hello World, variables, data types, operators
2 Input/Output (Scanner), type casting, Math class
3 If-else, switch-case, loops
4 Nested loops, break/continue, patterns (stars, numbers)
5 Methods, parameters, return values
6 Method overloading, scope, recursion intro
7 OOP basics — Classes, objects, constructors
8 this, super, static, final keywords
9 Inheritance + polymorphism
10 Abstraction (abstract class, interface)
11 Strings — basics, StringBuilder, palindrome check
12 Arrays — creation, traversal, min/max
13 Reverse array, rotate array
14 Searching — linear search
15 Binary search — iterative, recursive
16 Sorting — bubble, selection
17 Sorting — insertion, merge sort
18 Sorting — quick sort
19 Prefix sum basics
20 Sliding window basics
21 Recursion — factorial, Fibonacci
22 Recursion — sum of digits, reverse number
23 Backtracking basics
24 Array problems — Two-sum, missing number
25 String problems — anagram check, count frequency
26 Bitwise basics — AND, OR, XOR
27 GCD, LCM, sieve of Eratosthenes
28 Practice — Arrays + Strings mixed problems
29 Practice — Recursion problems
30 Phase 1 Revision + Mini Contest (LeetCode easy set)
31 Linked List — intro, insert, delete
32 Linked List — reverse (iterative, recursive)
33 Middle of LL, detect cycle (Floyd’s algorithm)
34 Stack using array + LL
35 Stack problems — valid parentheses, next greater element
36 Queue — simple + circular
37 Queue problems — sliding window max
38 Deque + Java Deque
39 Priority Queue + Heap basics
40 Min heap, Max heap operations
41 HashMap + frequency map
42 HashSet + set problems
43 Binary Tree — intro, DFS (inorder, preorder, postorder)
44 Binary Tree BFS + level order
45 Height & diameter of tree
46 Binary Search Tree — insert, search
47 BST problems — delete node, validate BST
48 Graph — adjacency list/matrix
49 BFS in graph
50 DFS in graph
51 Dijkstra’s algorithm
52 Topological sort
53 Disjoint set (Union-Find)
54 Tries intro
55 Array pattern problems — two pointers, sliding window
56 String pattern problems — longest substring without repeat
57 Matrix problems — spiral, rotate matrix
58 Linked list + stack problems mixed
59 Tree problems mixed
60 Phase 2 Revision + Mini Contest (LeetCode medium set)
61 Two pointers — sorted array pair sum, move zeroes
62 Sliding window — variable size window problems
63 Prefix sum + hashing problems
64 Binary search on answer — minimum days, aggressive cows
65 Greedy — activity selection
66 Greedy — min coins
67 Backtracking — N-Queens
68 Backtracking — Rat in a maze
69 DP — intro, Fibonacci memoization/tabulation
70 DP — knapsack
71 DP — coin change
72 DP — longest common subsequence
73 DP — LIS (Longest Increasing Subsequence)
74 DP — grid paths
75 Graph patterns — connected components
76 Graph patterns — shortest path variants
77 Bitmasking — subset generation
78 Bitmask DP basics
79 Mix problems — arrays + strings
80 Mix problems — trees + graphs
81 Mix problems — DP
82 LeetCode medium daily set
83 LeetCode medium-hard daily set
84 Mock interview — random 3 problems
85 Mock interview — random 3 problems
86 Revision — arrays, strings, recursion
87 Revision — linked list, stack, queue
88 Revision — tree, graph
89 Revision — DP, greedy
90 Final Mock Contest (LeetCode + Codeforces set)
