Nim Game Problem

Nim Game Problem — ExecCode Easy DSA Practice

Solve the Nim Game problem on ExecCode. Free online easy DSA practice in Math. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given n, the number of stones in the heap, return true if you can win the game assuming both you and your friend play optimally, otherwise return false. Your task is to 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. Return the required answer exactly as shown in the examples.

Examples

Input {"n": 4}; Output False. Input {"n": 1}; Output True

Constraints

1 <= n <= 2^31 - 1

Practice Nim Game free on ExecCode. Browse DSA problems, topic map, and placement guides.