Optimal First-Player Card Score
OpenAI● MediumFULLTIMENEW GRADOAProblem statement
Two players play a game with an even-length array cards of positive values. Both players see the full sequence and play optimally.
The players alternate turns, and the first player moves first. On each turn, the current player removes either the leftmost or the rightmost remaining card and adds its value to their score.
The problem statement continues
ProExamples
Example 1
cards = [1,9,10,5,6,4]return = 18Optimal play gives the first player a final score of 18. Any move is evaluated against the opponent's best reply.
Original screenshot from the interview report
ProFastPrep Pro
Reported in 1 OpenAI interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week