Nim Game LeetCode Solution

Problem – Nim Game LeetCode Solution

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 assuming both you and your friend play optimally, otherwise return false.

Example 1:

Input: n = 4
Output: false
Explanation: These are the possible outcomes:
1. You remove 1 stone. Your friend removes 3 stones, including the last stone. Your friend wins.
2. You remove 2 stones. Your friend removes 2 stones, including the last stone. Your friend wins.
3. You remove 3 stones. Your friend removes the last stone. Your friend wins.
In all outcomes, your friend wins.

Example 2:

Input: n = 1
Output: true

Example 3:

Input: n = 2
Output: true

Constraints:

• 1 <= n <= 231 - 1

Nim Game LeetCode Solution in C++

class Solution {
public:
    bool canWinNim(int n) {
        return n%4 ;
    }
};

Nim Game LeetCode Solution in Python

class Solution(object):
def canWinNim(self, n):
    """
    :type n: int
    :rtype: bool
    """
    return bool(n % 4)

Nim Game LeetCode Solution in Java

public boolean canWinNim(int n) {
    if (n <= 0) {return false;}
    return n % 4 != 0;
}

Nim Game LeetCode Solution Review:

In our experience, we suggest you solve this Nim Game LeetCode Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Nim Game LeetCode Solution

Find on Leetcode

Conclusion:

I hope this Nim Game LeetCode Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Coding Solutions >>

LeetCode Solutions

Hacker Rank Solutions

CodeChef Solutions