Get Potential of Winners
Reported by candidates from IBM's online assessment. Pattern, common pitfall, and the honest play if you blank under the timer.
IBM sent you a problem called 'Get Potential of Winners' in March 2024, and you've got a day or two to figure out the pattern. This one doesn't broadcast itself as a standard algorithm drill. It's a simulation or counting problem disguised as something about ranking or scoring. The trick is understanding what 'potential' means in context and how to aggregate it correctly across a winner set. StealthCoder will catch you if the wording trips you up during the live OA.
Pattern and pitfall
The problem likely asks you to compute some cumulative or derived metric for a subset of candidates or entities that 'win' under certain conditions. Common traps: assuming a greedy approach works (it might not), miscounting edge cases, or misunderstanding whether order matters. The 'potential' calculation probably involves summing, ranking, or applying a formula to winners only. Pattern-wise, this feels like a counting or simulation problem with conditional logic. If you blank on the exact formula during the OA, StealthCoder reads the problem statement in real time and shows you the solution path without the proctor seeing it. Focus on parsing the input format and testing with a small example to reverse-engineer the formula.
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 Potential of Winners 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
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 Potential of Winners FAQ
Is this a math problem or a data structure problem?+
It's primarily a counting or simulation problem. You're likely computing a metric based on rules, not balancing trees or hashing. Understand the rule first, then code it. Math formula problems don't require fancy structures.
What's the most common mistake candidates make?+
Misreading what 'potential' means. Is it a sum of ranks? A formula applied to each winner? Does order matter? Read the problem twice and test with the sample input before coding.
How do I prepare for this in 48 hours?+
You can't drill this pattern in 48 hours without the exact problem text. Focus on clarity: parse input cleanly, write the logic step by step, and test edge cases. That covers 80% of IBM OA questions.
Will there be a large dataset or a tricky runtime constraint?+
IBM OA problems rarely have extreme performance requirements. Assume O(n log n) or O(n^2) is fine unless stated otherwise. Get it right first, optimize if you hit a time limit.
Is this problem still being asked in 2024?+
It was reported in March 2024, so yes. IBM reuses themes. If you see a problem about ranking, scoring, or aggregating metrics for a subset, this is the pattern you're facing.