← All problemsSign in

292. Nim Game

LeetCodeMathBrainteaserGame TheoryOpen on judge ↗

You are playing the following Nim Game with your friend: - Initially, there is a heap of stones on the table. - You and your friend will alternate taking turns, and you go first. - On each turn, the person whose turn it is will remove 1 to 3 stones from the heap. - The one who removes the last stone is the winner. Given n, the number of stones in the heap, return true if you can win the game

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start