Available question text
Given several piles of stones and rules for how many stones can be removed each turn, determine whether the first player can force a win (or produce a winning move) under optimal play; model it as an impartial game and use nim-sum/Grundy numbers — a nonzero xor of pile Grundy values implies a winning position.
Related questions
Continue with questions that share topics or the same question type.
- Nim Game
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 1908. Game of Nim
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source