CodingMediumcod-g487

Subject Game theoryLevel Mid–Senior~25 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

A single pile has `n` stones. On each turn a player must remove a number of stones equal to one of the allowed values in `moves`. Players alternate; the player who cannot move loses (normal play). With optimal play and the first player to move, return True if the first player wins.

Implement

subtraction_game_win(n: int, moves: list[int]) → bool

Examples

in[10,[1,3,4]]outtrue

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.