Paused. Click anywhere to continue
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.
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 pathEvery 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 OAGrow 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.
IIT Madras · Computer Science · Class of 2027
Free for students at eligible colleges, for your whole degree.
Live nowlaunchpad.ccbp.inStart by building your first path in Pathfinder.