Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 292. Nim Game
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.