Grandmaster Choice
Reported by candidates from Eat Club's online assessment. Pattern, common pitfall, and the honest play if you blank under the timer.
Eat Club's August OA included a problem called Grandmaster Choice, and you're likely staring at it right now wondering if there's a hidden trick. The title alone suggests strategy and selection. This is a greedy or optimization problem dressed up in game-theory language. StealthCoder will read the exact constraints and feed you the pattern in real time if you blank on the approach during the live assessment. You've got 24-72 hours; knowing the shape of the problem now saves mental energy later.
Pattern and pitfall
Grandmaster Choice almost certainly asks you to make a sequence of optimal selections under some constraint. The core pattern is likely greedy: pick the locally best option at each step, or it's a minimax / game-theory setup where you're choosing against an opponent. The trap candidates fall into is over-thinking the problem. They build a recursive solution or brute force when a single pass with a priority queue or simple sort wins. The trick is identifying what 'best' means in context: highest value, lowest cost, or earliest finish time. If this is two-player, expect the second player to also play optimally. During the live OA, if you blank, StealthCoder will show you the problem state and suggest the pattern; you code the greedy or selection logic.
If this hits your live OA and you blank, StealthCoder solves it in seconds, invisible to the proctor.
You can drill Grandmaster Choice 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 would have shipped this the night before his JPMorgan OA if he'd had it.
Get StealthCoderRelated leaked OAs
You've seen the question.
Make sure you actually pass Eat Club's OA.
Eat Club reuses patterns across OAs. Built by an Amazon engineer who would have shipped this the night before his JPMorgan OA if he'd had it. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Grandmaster Choice FAQ
Is this a greedy problem or a game-theory problem?+
Most likely greedy. If the problem asks you to pick items or make choices to maximize or minimize a metric, greedy usually wins. If it's explicitly two-player or adversarial, it's minimax. The problem title hints at choice, not conflict, so greedy is your first bet.
What if I can't figure out the optimal strategy in 10 minutes?+
Write a brute-force solution that explores all possibilities. It will time out on large inputs, but it proves correctness on small cases. Then optimize by sorting or using a priority queue. Eat Club values working code over a slow one.
Should I use recursion with memoization or iteration?+
Iteration with sorting and a greedy pass is faster to code and debug under pressure. Memoization adds mental overhead. Test with iteration first. If you need DP, you'll sense it from the constraints and problem structure.
What's the most common pitfall on this type of problem?+
Not reading what you're optimizing for. Candidates pick the 'obvious' best choice and miss that the problem wants something else. Re-read the objective sentence twice before coding.
How do I prepare in 48 hours if I don't have the full problem text?+
Study greedy problems: interval scheduling, huffman coding, activity selection. Understand sorting tricks and priority queues. Know the difference between greedy and DP. The pattern will click once you see the constraints.