Back to Plans

90-Day Thorough

Starting early. Deep coverage of every track, comfortable daily load.

30 Days60 Days90 Days
Day 1— Sliding Window
DSA PatternsEasy

Alternating Groups I

DSA PatternsMedium

Alternating Groups II

Day 2— Sliding Window
DSA PatternsHard

Apply Operations to Maximize Frequency Score

DSA PatternsMedium

Arithmetic Slices

Day 3— Sliding Window
DSA PatternsMedium

Best Time to Buy and Sell Stock using Strategy

DSA PatternsMedium

Binary String With Substrings Representing 1 To N

Day 4— Sliding Window
DSA PatternsMedium

Binary Subarrays With Sum

DSA PatternsMedium

Continuous Subarrays

Development

Git Basics & Workflow

Learn commit, push, pull, branch, and merge strategies.

Day 5— Sliding Window
DSA PatternsMedium

Count Complete Subarrays in an Array

DSA PatternsMedium

Count Number of Nice Subarrays

Day 6— Sliding Window
DSA PatternsEasy

Alternating Groups I

DSA PatternsMedium

Alternating Groups II

Aptitude

Quantitative: Percentages & Ratios

Core math foundations often tested in screening rounds.

Day 7— Sliding Window
DSA PatternsHard

Apply Operations to Maximize Frequency Score

DSA PatternsMedium

Arithmetic Slices

Day 8— Sliding Window
DSA PatternsMedium

Best Time to Buy and Sell Stock using Strategy

DSA PatternsMedium

Binary String With Substrings Representing 1 To N

Development

JavaScript ES6+ Essentials

Arrow functions, destructuring, promises, and async/await.

Day 9— Sliding Window
DSA PatternsMedium

Binary Subarrays With Sum

DSA PatternsMedium

Continuous Subarrays

Day 10— Sliding Window
DSA PatternsMedium

Count Complete Subarrays in an Array

DSA PatternsMedium

Count Number of Nice Subarrays

Day 11— Two Pointers
DSA PatternsEasy

Apply Operations to an Array

DSA PatternsMedium

3Sum Closest

Day 12— Two Pointers
DSA PatternsHard

Checking Existence of Edge Length Limited Paths

DSA PatternsMedium

3Sum Smaller

Development

REST APIs & Fetch

Understand HTTP methods, status codes, and fetching data.

Aptitude

Quantitative: Time & Work

Classic problems involving rates and combined efforts.

Day 13— Two Pointers
DSA PatternsMedium

3Sum With Multiplicity

DSA PatternsMedium

3Sum

Day 14— Two Pointers
DSA PatternsMedium

4Sum

DSA PatternsMedium

Add Two Polynomials Represented as Linked Lists

Day 15— Two Pointers
DSA PatternsMedium

Adding Spaces to a String

DSA PatternsMedium

Advantage Shuffle

Day 16— Two Pointers
DSA PatternsEasy

Apply Operations to an Array

DSA PatternsMedium

3Sum Closest

Development

SQL Fundamentals

SELECT, JOIN, GROUP BY, and basic indexing concepts.

Day 17— Two Pointers
DSA PatternsHard

Checking Existence of Edge Length Limited Paths

DSA PatternsMedium

3Sum Smaller

Day 18— Two Pointers
DSA PatternsMedium

3Sum With Multiplicity

DSA PatternsMedium

3Sum

Aptitude

Logical Reasoning: Syllogisms

Deductive reasoning and statement validity.

Day 19— Two Pointers
DSA PatternsMedium

4Sum

DSA PatternsMedium

Add Two Polynomials Represented as Linked Lists

Day 20— Two Pointers
DSA PatternsMedium

Adding Spaces to a String

DSA PatternsMedium

Advantage Shuffle

Development

React/Next.js Foundations

Components, state, props, and simple routing.

Day 21— Prefix Sum
DSA PatternsEasy

Ant on the Boundary

DSA PatternsMedium

Apply Operations to Make All Array Elements Equal to Zero

Day 22— Prefix Sum
DSA PatternsHard

Apply Operations to Maximize Frequency Score

DSA PatternsMedium

Average Height of Buildings in Each Segment

Day 23— Prefix Sum
DSA PatternsMedium

Best Time to Buy and Sell Stock using Strategy

DSA PatternsMedium

Binary Subarrays With Sum

Day 24— Prefix Sum
DSA PatternsMedium

Bitwise OR of All Subsequence Sums

DSA PatternsMedium

Brightest Position on Street

Development

Mini-Project: Todo App

Build a persistent CRUD app to solidify your skills.

Aptitude

Logical Reasoning: Data Interpretation

Extracting insights from charts and tables.

Day 25— Prefix Sum
DSA PatternsMedium

Can Make Palindrome from Substring

DSA PatternsMedium

Can You Eat Your Favorite Candy on Your Favorite Day?

Day 26— Binary Search on Array
DSA PatternsEasy

Arranging Coins

DSA PatternsMedium

132 Pattern

Day 27— Binary Search on Array
DSA PatternsHard

Apply Operations to Maximize Frequency Score

DSA PatternsMedium

3Sum Smaller

Day 28— Binary Search on Array
DSA PatternsMedium

Adjacent Increasing Subarrays Detection II

DSA PatternsMedium

All Elements in Two Binary Search Trees

Day 29— Binary Search on Array
DSA PatternsMedium

Avoid Flood in The City

DSA PatternsMedium

Balance a Binary Search Tree

Day 30— Binary Search on Array
DSA PatternsMedium

Binary Search Tree Iterator II

DSA PatternsMedium

Binary Search Tree Iterator

Aptitude

Verbal: Reading Comprehension

Speed reading and answering derived questions.

Day 31— Binary Search on Answer
DSA PatternsEasy

Arranging Coins

DSA PatternsMedium

132 Pattern

Day 32— Binary Search on Answer
DSA PatternsHard

Apply Operations to Maximize Frequency Score

DSA PatternsMedium

3Sum Smaller

Day 33— Binary Search on Answer
DSA PatternsMedium

Adjacent Increasing Subarrays Detection II

DSA PatternsMedium

All Elements in Two Binary Search Trees

Day 34— Binary Search on Answer
DSA PatternsMedium

Avoid Flood in The City

DSA PatternsMedium

Balance a Binary Search Tree

Day 35— Binary Search on Answer
DSA PatternsMedium

Beautiful Towers I

DSA PatternsMedium

Beautiful Towers II

System Design

Load Balancing

Distributing traffic to prevent single points of failure.

Read article
Day 36— Merge Intervals
DSA PatternsEasy

Apple Redistribution into Boxes

DSA PatternsMedium

3Sum Closest

Day 37— Merge Intervals
DSA PatternsHard

Alien Dictionary

DSA PatternsMedium

3Sum Smaller

Day 38— Merge Intervals
DSA PatternsMedium

3Sum With Multiplicity

DSA PatternsMedium

3Sum

Day 39— Merge Intervals
DSA PatternsMedium

4Sum

DSA PatternsMedium

Accounts Merge

Day 40— Merge Intervals
DSA PatternsMedium

Advantage Shuffle

DSA PatternsMedium

Alert Using Same Key-Card Three or More Times in a One Hour Period

System Design

Caching Strategies

Read-through, write-through, and caching layers.

Read article
Day 41— In-place Reversal (Linked List)
DSA PatternsEasy

Convert Binary Number in a Linked List to Integer

DSA PatternsMedium

Add Two Numbers II

Day 42— In-place Reversal (Linked List)
DSA PatternsHard

All O`one Data Structure

DSA PatternsMedium

Add Two Numbers

Day 43— In-place Reversal (Linked List)
DSA PatternsMedium

Add Two Polynomials Represented as Linked Lists

DSA PatternsMedium

Convert Binary Search Tree to Sorted Doubly Linked List

Day 44— In-place Reversal (Linked List)
DSA PatternsMedium

Convert Sorted List to Binary Search Tree

DSA PatternsMedium

Copy List with Random Pointer

Day 45— In-place Reversal (Linked List)
DSA PatternsMedium

Delete Node in a Linked List

DSA PatternsMedium

Delete Nodes From Linked List Present in Array

System Design

Database Sharding & Replication

Scaling databases horizontally vs vertically.

Read article
Day 46— BFS (Level Order Traversal)
DSA PatternsEasy

Average of Levels in Binary Tree

DSA PatternsMedium

Add One Row to Tree

Day 47— BFS (Level Order Traversal)
DSA PatternsHard

Amount of New Area Painted Each Day

DSA PatternsMedium

All Elements in Two Binary Search Trees

Day 48— BFS (Level Order Traversal)
DSA PatternsMedium

All Nodes Distance K in Binary Tree

DSA PatternsMedium

All Possible Full Binary Trees

Day 49— BFS (Level Order Traversal)
DSA PatternsMedium

Amount of Time for Binary Tree to Be Infected

DSA PatternsMedium

Balance a Binary Search Tree

Day 50— BFS (Level Order Traversal)
DSA PatternsMedium

Binary Search Tree Iterator II

DSA PatternsMedium

Binary Search Tree Iterator

System Design

CAP Theorem

Understanding trade-offs in distributed systems.

Read article
Day 51— DFS (Pre/In/Post Traversal)
DSA PatternsEasy

Average of Levels in Binary Tree

DSA PatternsMedium

Add One Row to Tree

Day 52— DFS (Pre/In/Post Traversal)
DSA PatternsHard

Amount of New Area Painted Each Day

DSA PatternsMedium

All Elements in Two Binary Search Trees

Day 53— DFS (Pre/In/Post Traversal)
DSA PatternsMedium

All Nodes Distance K in Binary Tree

DSA PatternsMedium

All Possible Full Binary Trees

Day 54— DFS (Pre/In/Post Traversal)
DSA PatternsMedium

Amount of Time for Binary Tree to Be Infected

DSA PatternsMedium

Balance a Binary Search Tree

Day 55— DFS (Pre/In/Post Traversal)
DSA PatternsMedium

Binary Search Tree Iterator II

DSA PatternsMedium

Binary Search Tree Iterator

System Design

Message Queues

Asynchronous processing with Kafka/RabbitMQ.

Read article
Day 56— BFS (Shortest Path)
DSA PatternsEasy

Find Center of Star Graph

DSA PatternsMedium

All Ancestors of a Node in a Directed Acyclic Graph

Day 57— BFS (Shortest Path)
DSA PatternsHard

Add Edges to Make Degrees of All Nodes Even

DSA PatternsMedium

All Paths from Source Lead to Destination

Day 58— BFS (Shortest Path)
DSA PatternsMedium

All Paths From Source to Target

DSA PatternsMedium

Apply Substitutions

Day 59— BFS (Shortest Path)
DSA PatternsMedium

Cheapest Flights Within K Stops

DSA PatternsMedium

Clone Graph

Day 60— BFS (Shortest Path)
DSA PatternsMedium

Connecting Cities With Minimum Cost

DSA PatternsMedium

Count the Number of Complete Components

Day 61— DFS (Connectivity)
DSA PatternsEasy

Find Center of Star Graph

DSA PatternsMedium

All Ancestors of a Node in a Directed Acyclic Graph

Day 62— DFS (Connectivity)
DSA PatternsHard

Add Edges to Make Degrees of All Nodes Even

DSA PatternsMedium

All Paths from Source Lead to Destination

Day 63— DFS (Connectivity)
DSA PatternsMedium

All Paths From Source to Target

DSA PatternsMedium

Apply Substitutions

Day 64— DFS (Connectivity)
DSA PatternsMedium

Cheapest Flights Within K Stops

DSA PatternsMedium

Clone Graph

Day 65— DFS (Connectivity)
DSA PatternsMedium

Connecting Cities With Minimum Cost

DSA PatternsMedium

Count the Number of Complete Components

Day 66— Topological Sort (Kahn's / DFS)
DSA PatternsEasy

Find Center of Star Graph

DSA PatternsMedium

All Ancestors of a Node in a Directed Acyclic Graph

Day 67— Topological Sort (Kahn's / DFS)
DSA PatternsHard

Add Edges to Make Degrees of All Nodes Even

DSA PatternsMedium

All Paths from Source Lead to Destination

Day 68— Topological Sort (Kahn's / DFS)
DSA PatternsMedium

All Paths From Source to Target

DSA PatternsMedium

Apply Substitutions

Day 69— Topological Sort (Kahn's / DFS)
DSA PatternsMedium

Cheapest Flights Within K Stops

DSA PatternsMedium

Clone Graph

Day 70— Topological Sort (Kahn's / DFS)
DSA PatternsMedium

Connecting Cities With Minimum Cost

DSA PatternsMedium

Count the Number of Complete Components

Day 71— Union-Find (Disjoint Set Union)
DSA PatternsEasy

Find Center of Star Graph

DSA PatternsMedium

Accounts Merge

Day 72— Union-Find (Disjoint Set Union)
DSA PatternsHard

Add Edges to Make Degrees of All Nodes Even

DSA PatternsMedium

All Ancestors of a Node in a Directed Acyclic Graph

Day 73— Union-Find (Disjoint Set Union)
DSA PatternsMedium

All Paths from Source Lead to Destination

DSA PatternsMedium

All Paths From Source to Target

Day 74— Union-Find (Disjoint Set Union)
DSA PatternsMedium

Apply Substitutions

DSA PatternsMedium

Cheapest Flights Within K Stops

Day 75— Union-Find (Disjoint Set Union)
DSA PatternsMedium

Check if There is a Valid Path in a Grid

DSA PatternsMedium

Clone Graph

Day 76— Dijkstra's Algorithm
DSA PatternsEasy

Find Center of Star Graph

DSA PatternsMedium

All Ancestors of a Node in a Directed Acyclic Graph

Soft Skills

Resume Review

Ensure your resume is ATS-friendly and highlights impact (metrics).

Day 77— Dijkstra's Algorithm
DSA PatternsHard

Add Edges to Make Degrees of All Nodes Even

DSA PatternsMedium

All Paths from Source Lead to Destination

Day 78— Dijkstra's Algorithm
DSA PatternsMedium

All Paths From Source to Target

DSA PatternsMedium

Apply Substitutions

HR & Behavioral

The STAR Method

Situation, Task, Action, Result. The framework for behavioral answers.

Day 79— Dijkstra's Algorithm
DSA PatternsMedium

Cheapest Flights Within K Stops

DSA PatternsMedium

Clone Graph

Day 80— Dijkstra's Algorithm
DSA PatternsMedium

Connecting Cities With Minimum Cost

DSA PatternsMedium

Count the Number of Complete Components

Soft Skills

LinkedIn Optimization

Update your headline, summary, and open-to-work settings.

Day 81— Top-K Elements
DSA PatternsEasy

Delete Greatest Value in Each Row

DSA PatternsMedium

Average Height of Buildings in Each Segment

HR & Behavioral

Tell Me About Yourself

Crafting a compelling 2-minute elevator pitch.

Day 82— Top-K Elements
DSA PatternsHard

Car Fleet II

DSA PatternsMedium

Avoid Flood in The City

Day 83— Top-K Elements
DSA PatternsMedium

Campus Bikes

DSA PatternsMedium

Car Pooling

Day 84— Top-K Elements
DSA PatternsMedium

Cheapest Flights Within K Stops

DSA PatternsMedium

Choose K Elements With Maximum Sum

HR & Behavioral

Handling Conflict

Prepare a story about disagreeing with a coworker or manager.

Soft Skills

Mock Interview Practice

Do a recorded mock interview to check your body language and pacing.

Day 85— Top-K Elements
DSA PatternsMedium

Connecting Cities With Minimum Cost

DSA PatternsMedium

Construct String With Repeat Limit

Day 86— Subsets
DSA PatternsEasy

Binary Tree Paths

DSA PatternsMedium

Add Two Numbers

Day 87— Subsets
DSA PatternsHard

24 Game

DSA PatternsMedium

Additive Number

HR & Behavioral

Your Biggest Weakness

How to frame a real weakness and your steps to improve it.

Day 88— Subsets
DSA PatternsMedium

All Paths From Source to Target

DSA PatternsMedium

All Possible Full Binary Trees

Soft Skills

Cold Emailing & Networking

Drafting a concise message for referrals.

Day 89— Subsets
DSA PatternsMedium

Ambiguous Coordinates

DSA PatternsMedium

Android Unlock Patterns

Day 90— Subsets
DSA PatternsMedium

Balanced K-Factor Decomposition

DSA PatternsMedium

Beautiful Arrangement

HR & Behavioral

Questions for the Interviewer

Prepare 3 insightful questions to ask at the end of the interview.