Paused. Click anywhere to continue
Know exactly what to do today.
Pick one. You can add more paths later.
From companies that visit your campus.
Your path is paced to this date.
A rough guess is fine. The diagnostic will refine it.
Be honest. Your daily plan depends on it.
Find your real starting point.
A light read of your starting point.
Your DSA readiness, as a score out of 100.
Your best daily mix of learn, practice and recall.
What is the time complexity of this function?
int findMin(vector<int>& a) { int lo = 0, hi = a.size() - 1; while (lo < hi) { int mid = (lo + hi) / 2; if (a[mid] < a[hi]) hi = mid; else lo = mid + 1; } return a[lo]; }
Your roadmap starts here: Graphs and Dynamic Programming go deeper in your path.
Open my pathSee how you're really doing.
One company. Everything you need for it.
Every question this company has asked before, one at a time in the Code Playground. No timer.
Open question bankThe actual OA environment, timed, so you feel the pressure of the real first round.
Start a timed OARehearse with an engineer who's been there.
Get your resume past the filter.
Every live class, on one page.
Revise only what matters.
Grow the window on the right. While it breaks the rule, shrink from the left. Track the best answer as you go. Works when the condition only gets worse as the window grows.
Why prep on Launchpad?
Never miss a class or contest.
Your coding identity, on one link.
IIT Madras · Computer Science · Class of 2027
Stuck? Help is one tap away.
Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals k.
Numbers can be negative.
int subarraySum(vector<int>& a, int k) { int l = 0, sum = 0, ans = 0; for (int r = 0; r < a.size(); r++) { sum += a[r]; while (sum > k && l <= r) sum -= a[l++]; if (sum == k) ans++; } return ans; }
Start by building your first path in Pathfinder.