Track Your Progress
Login / Create
First time? Enter email + password — your progress is saved privately.
6-Month Interview Prep Tracker
DSA + System Design + Behavioral
Logout
Month 1: Refresh Java Basics & Foundational DSA
▶
Week 1: Java Fundamentals & Arrays
Day 1: Review Java basics (variables, loops, conditionals, OOP). Practice:
1. Two Sum
(Easy) – HashMap
Day 2: Arrays in Java. Practice:
283. Move Zeroes
(Easy)
Day 3: String operations. Practice:
1768. Merge Strings Alternately
(Easy)
Day 4: Hashing basics. Practice:
217. Contains Duplicate
(Easy)
Day 5: Basic array problems. Practice:
26. Remove Duplicates from Sorted Array
(Easy)
Day 6: Review – Re-solve Days 1–5 without looking at solutions
Day 7: Behavioral – Prepare "Tell me about yourself" (5 years Java exp)
Week 2: More Arrays & Strings
Day 1: Array rotation/search. Practice:
189. Rotate Array
(Medium)
Day 2: Palindrome checks. Practice:
125. Valid Palindrome
(Easy)
Day 3: Two-pointer intro. Practice:
392. Is Subsequence
(Easy)
Day 4: Prefix sums. Practice:
724. Find Pivot Index
(Easy)
Day 5: Hashing applications. Practice:
383. Ransom Note
(Easy)
Day 6: Review – Time/space complexity of week's problems
Day 7: Behavioral – "Why Google/Microsoft/Apple?"
Week 3: Linked Lists Basics
Day 1: LinkedList intro. Practice:
206. Reverse Linked List
(Easy)
Day 2: Add/remove nodes. Practice:
21. Merge Two Sorted Lists
(Easy)
Day 3: Detect cycle. Practice:
141. Linked List Cycle
(Easy)
Day 4: Middle of list. Practice:
876. Middle of the Linked List
(Easy)
Day 5: Palindrome list. Practice:
234. Palindrome Linked List
(Easy)
Day 6: Review – Implement simple LinkedList class in Java
Day 7: Behavioral – "Describe a challenging project"
Week 4: Stacks & Queues Intro
Day 1: Stack basics. Practice:
20. Valid Parentheses
(Easy)
Day 2: Queue basics. Practice:
933. Number of Recent Calls
(Easy)
Day 3: Next greater element. Practice:
496. Next Greater Element I
(Easy)
Day 4: Monotonic stack. Practice:
739. Daily Temperatures
(Medium)
Day 5: Queue with stack. Practice:
232. Implement Queue using Stacks
(Easy)
Day 6: Review – Solve 2 mixed problems from Weeks 1–3
Day 7: Month recap – Note weak areas (time complexity etc.)
Month 1 Progress: 0%
Month 2: Intermediate DSA (Stacks, Queues, Trees)
▶
Week 1: Advanced Stacks & Queues
Day 1: Infix to postfix. Practice:
150. Evaluate Reverse Polish Notation
(Medium)
Day 2: Sliding window. Practice:
239. Sliding Window Maximum
(Hard)
Day 3: Asteroid collision. Practice:
735. Asteroid Collision
(Medium)
Day 4: Priority queues. Practice:
215. Kth Largest Element in an Array
(Medium)
Day 5: Heap applications. Practice:
703. Kth Largest Element in a Stream
(Easy)
Day 6: Review – Re-solve with optimizations
Day 7: Behavioral – "Teamwork example"
Week 2: Binary Trees Basics
Day 1: Traversals. Practice:
144. Binary Tree Preorder Traversal
(Easy)
Day 2: Level order. Practice:
102. Binary Tree Level Order Traversal
(Medium)
Day 3: Max depth. Practice:
104. Maximum Depth of Binary Tree
(Easy)
Day 4: Symmetric tree. Practice:
101. Symmetric Tree
(Easy)
Day 5: Path sum. Practice:
112. Path Sum
(Easy)
Day 6: Review – Implement tree node class
Day 7: Behavioral – "Failure and learning"
Week 3: Binary Search Trees (BST)
Day 1: BST insert/search. Practice:
700. Search in a Binary Search Tree
(Easy)
Day 2: Delete node. Practice:
450. Delete Node in a BST
(Medium)
Day 3: Validate BST. Practice:
98. Validate Binary Search Tree
(Medium)
Day 4: Kth smallest. Practice:
230. Kth Smallest Element in a BST
(Medium)
Day 5: LCA in BST. Practice:
235. Lowest Common Ancestor of a Binary Search Tree
(Medium)
Day 6: Review – Mixed tree problems
Day 7: Behavioral – "Leadership example"
Week 4: Binary Tree Advanced
Day 1: Right side view. Practice:
199. Binary Tree Right Side View
(Medium)
Day 2: Good nodes. Practice:
1448. Count Good Nodes in Binary Tree
(Medium)
Day 3: Path sum III. Practice:
437. Path Sum III
(Medium)
Day 4: Zigzag path. Practice:
1372. Longest ZigZag Path in a Binary Tree
(Medium)
Day 5: LCA. Practice:
236. Lowest Common Ancestor of a Binary Tree
(Medium)
Day 6: Review – Solve 3 tree problems timed
Day 7: Month recap – Identify patterns (recursion etc.)
Month 2 Progress: 0%
Month 3: Graphs & Searching/Sorting Algorithms
▶
Week 1: Binary Search & Sorting
Day 1: Binary search basics. Practice:
704. Binary Search
(Easy)
Day 2: Rotated array. Practice:
33. Search in Rotated Sorted Array
(Medium)
Day 3: Find peak. Practice:
162. Find Peak Element
(Medium)
Day 4: Koko bananas. Practice:
875. Koko Eating Bananas
(Medium)
Day 5: Merge sort impl. Practice:
88. Merge Sorted Array
(Easy)
Day 6: Review – Binary search variants
Day 7: Behavioral – "Conflict resolution"
Week 2: Graphs Basics (DFS/BFS)
Day 1: Graph representation. Practice:
841. Keys and Rooms
(Medium)
Day 2: DFS intro. Practice:
547. Number of Provinces
(Medium)
Day 3: BFS intro. Practice:
994. Rotting Oranges
(Medium)
Day 4: Maze exit. Practice:
1926. Nearest Exit from Entrance in Maze
(Medium)
Day 5: Reorder routes. Practice:
1466. Reorder Routes to Make All Paths Lead to the City Zero
(Medium)
Day 6: Review – Implement DFS/BFS in Java
Day 7: Behavioral – "Innovation example"
Week 3: Advanced Graphs
Day 1: Shortest path (BFS). Practice:
1091. Shortest Path in Binary Matrix
(Medium)
Day 2: Union-Find. Practice:
200. Number of Islands
(Medium)
Day 3: Evaluate division. Practice:
399. Evaluate Division
(Medium)
Day 4: Clone graph. Practice:
133. Clone Graph
(Medium)
Day 5: Course schedule. Practice:
207. Course Schedule
(Medium)
Day 6: Review – Graph traversal problems
Day 7: Behavioral – "Career goals"
Week 4: Backtracking
Day 1: Backtracking basics. Practice:
17. Letter Combinations of a Phone Number
(Medium)
Day 2: Combinations. Practice:
77. Combinations
(Medium)
Day 3: Subsets. Practice:
78. Subsets
(Medium)
Day 4: Permutations. Practice:
46. Permutations
(Medium)
Day 5: Combination sum. Practice:
216. Combination Sum III
(Medium)
Day 6: Review – Mixed searching/graph
Day 7: Month recap – Full LeetCode 75 progress check
Month 3 Progress: 0%
Month 4: Advanced Algorithms (DP, Greedy, Intervals)
▶
Week 1: Greedy Algorithms
Day 1: Greedy intro. Practice:
53. Maximum Subarray
(Medium)
Day 2: Jump game. Practice:
55. Jump Game
(Medium)
Day 3: Candy distribution. Practice:
135. Candy
(Hard)
Day 4: Task scheduler. Practice:
621. Task Scheduler
(Medium)
Day 5: Non-overlapping intervals. Practice:
435. Non-overlapping Intervals
(Medium)
Day 6: Review – Greedy proofs
Day 7: Behavioral – "Strengths/weaknesses"
Week 2: Dynamic Programming Basics
Day 1: DP intro (fib). Practice:
509. Fibonacci Number
(Easy)
Day 2: Climbing stairs. Practice:
70. Climbing Stairs
(Easy)
Day 3: Min cost stairs. Practice:
746. Min Cost Climbing Stairs
(Easy)
Day 4: House robber. Practice:
198. House Robber
(Medium)
Day 5: Tribonacci. Practice:
1137. N-th Tribonacci Number
(Easy)
Day 6: Review – 1D DP arrays
Day 7: Behavioral – "Work under pressure"
Week 3: Advanced DP
Day 1: Unique paths. Practice:
62. Unique Paths
(Medium)
Day 2: LCS. Practice:
1143. Longest Common Subsequence
(Medium)
Day 3: Edit distance. Practice:
72. Edit Distance
(Hard)
Day 4: Stock buy/sell. Practice:
714. Best Time to Buy and Sell Stock with Transaction Fee
(Medium)
Day 5: Domino tiling. Practice:
790. Domino and Tromino Tiling
(Medium)
Day 6: Review – 2D DP tables
Day 7: Behavioral – "Mentoring experience"
Week 4: Bit Manipulation & Tries
Day 1: Bit basics. Practice:
136. Single Number
(Easy)
Day 2: Counting bits. Practice:
338. Counting Bits
(Easy)
Day 3: Min flips. Practice:
1318. Minimum Flips to Make a OR b Equal to c
(Medium)
Day 4: Trie intro. Practice:
208. Implement Trie (Prefix Tree)
(Medium)
Day 5: Search suggestions. Practice:
1268. Search Suggestions System
(Medium)
Day 6: Review – Mixed DP/greedy
Day 7: Month recap – Start Striver SDE Sheet (Arrays etc.)
Month 4 Progress: 0%
Month 5: System Design & Integration
▶
Week 1: System Design Basics
Day 1: Design TinyURL. Practice: Review previous DSA
Day 2: Load balancers, DBs. Practice:
155. Min Stack
(Easy)
Day 3: API rate limiter. Practice:
146. LRU Cache
(Medium)
Day 4: Design Twitter. Practice:
460. LFU Cache
(Hard)
Day 5: Scalability concepts. Practice: Mixed DSA (2 problems)
Day 6: Review – Draw diagrams for designs
Day 7: Mock interview – 1 DSA problem
Week 2: Advanced System Design
Day 1: Design YouTube. Practice:
380. Insert Delete GetRandom O(1)
(Medium)
Day 2: Consistency models. Practice:
295. Find Median from Data Stream
(Hard)
Day 3: Design Uber. Practice: Mixed graphs (2 problems)
Day 4: Microservices. Practice:
362. Design Hit Counter
(Medium)
Day 5: Caching strategies. Practice: Review LRU
Day 6: Review – System design questions
Day 7: Mock – Behavioral + DSA
Week 3: Behavioral & Java-Specific
Day 1: Java multithreading. Practice:
1114. Print in Order
(Easy)
Day 2: Collections framework. Practice: Review HashMap internals
Day 3: Garbage collection. Practice: LeetCode problems in Java
Day 4: Design patterns. Practice: Implement singleton/factory
Day 5: Behavioral prep (STAR method). Practice: 2 stories
Day 6: Review – Java interview questions
Day 7: Mock – System design
Week 4: Mixed Practice
Day 1: 2–3 problems from Striver SDE Sheet (Greedy / DP)
Day 2: 2–3 problems from Striver SDE Sheet
Day 3: 2–3 problems from Striver SDE Sheet
Day 4: 2–3 problems from Striver SDE Sheet
Day 5: 2–3 problems from Striver SDE Sheet
Day 6: Review – Weak areas
Day 7: Month recap – Full mock interview
Month 5 Progress: 0%
Month 6: Revision, Mocks, & Polish
▶
Week 1: DSA Revision
Day 1: Re-solve 3–4 LeetCode 75 problems (Medium/Hard)
Day 2: Re-solve 3–4 LeetCode 75 problems
Day 3: Re-solve 3–4 LeetCode 75 problems
Day 4: Re-solve 3–4 LeetCode 75 problems
Day 5: Re-solve 3–4 LeetCode 75 problems
Day 6: Timed LeetCode contest
Day 7: Behavioral mock
Week 2: System Design Revision
Day 1: 1 design + 1 DSA (Netflix, Instagram, …)
Day 2: 1 design + 1 DSA
Day 3: 1 design + 1 DSA
Day 4: 1 design + 1 DSA
Day 5: 1 design + 1 DSA
Day 6: Review notes
Day 7: Full mock (DSA + Design)
Week 3: Behavioral & Edge Cases
Day 1: Prepare behavioral stories + edge-case DSA (e.g.
42. Trapping Rain Water
)
Day 2: Behavioral stories + edge cases
Day 3: Behavioral stories + edge cases
Day 4: Behavioral stories + edge cases
Day 5: Behavioral stories + edge cases
Day 6: Mixed revision
Day 7: Mock with friend / online
Week 4: Final Polish
Day 1: Light practice (1 Striver problem – Graphs etc.)
Day 2: Light practice
Day 3: Light practice
Day 4: Light practice
Day 5: Light practice
Day 6: Resume review, company research
Day 7: Rest / light review – You're ready!
Month 6 Progress: 0%