Get Min Time
Reported by candidates from IBM's online assessment. Pattern, common pitfall, and the honest play if you blank under the timer.
IBM's "Get Min Time" question hit the assessment circuit in February 2024, and it's the kind of problem that looks deceptively simple until you realize the trick. You're being asked to find a minimum time value, which usually means either simulation, optimization, or a search pattern hiding underneath. Without the full problem text, candidates are walking in blind, which is exactly when StealthCoder becomes your safety net. If you freeze on the live OA, the overlay will read the problem and hand you the pattern you need in real time.
Pattern and pitfall
Time-optimization problems at IBM typically hinge on either binary search ("is it possible to complete X in T time?") or greedy logic ("what's the earliest moment Y happens?"). The common trap is brute force: iterating through every possible time value instead of narrowing the search space. Most candidates waste 15 minutes on the wrong approach before pivoting. The pattern is usually binary search on the answer, where you define a feasibility check and hunt for the minimum threshold. StealthCoder will surface this pattern instantly if you blank during the assessment, letting you code with confidence instead of guessing.
If you see this problem in your OA tomorrow, the play is to recognize the pattern in 30 seconds. StealthCoder buys you that recognition.
You can drill Get Min Time cold, or you can hedge it. StealthCoder runs invisibly during screen share and surfaces a working solution in under 2 seconds. The proctor sees the IDE. They don't see what's behind it. Built by an Amazon engineer who passed his OA cold and still thinks the filter is broken.
Get StealthCoderRelated leaked OAs
This OA pattern shows up on LeetCode as capacity to ship packages within d days. If you have time before the OA, drill that.
You've seen the question.
Make sure you actually pass IBM's OA.
IBM reuses patterns across OAs. Built by an Amazon engineer who passed his OA cold and still thinks the filter is broken. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Get Min Time FAQ
Is 'Get Min Time' a binary search problem?+
Very likely. IBM loves binary search dressed as optimization. If the problem asks for the minimum time to achieve X, you're almost always looking for a feasibility check (can we do it in time T?) and then narrowing bounds. Watch for constraints that make brute force impossible.
What's the most common mistake on this question?+
Iterating through every possible time value instead of binary searching. Candidates burn 10-15 minutes on simulation when the intended solution is O(log N) with a feasibility function. Read carefully for hints about constraints.
How do I prepare for this in 24 hours if I haven't seen it?+
Study binary search on the answer (not on the array). Practice LeetCode 1011 (Capacity to Ship) and 875 (Koko Eating Bananas). These follow the exact pattern IBM loves. Then sleep. Don't cram edge cases.
Will the problem give me the full constraints?+
IBM usually does. Constraints are your roadmap. If N is up to 10^5 or 10^9, brute force dies. That signals binary search or mathematical insight. Read them first, not last.
What if I blank on the feasibility check?+
That's where StealthCoder helps. It reads the problem and gives you the pattern. The feasibility function is always the hard part. With the overlay, you get unstuck instantly instead of spiraling for 20 minutes.