Available question text
Determine whether the first player can force a win in a two-player game where players alternately remove 1–3 stones from a heap under optimal play. The core observation is that positions with n % 4 == 0 are losing for the starter, while all others are winning.
Related questions
Continue with questions that share topics or the same question type.
- Game of Nim
Coding
- 2048 Game Backend
Coding
- 24 Game
Coding
- Alice and Bob Playing Flower Game
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 292. Nim Game
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source