292. Nim Game LeetCode Solution

In this guide, you will get 292. Nim Game LeetCode Solution with the best time and space complexity. The solution to Nim Game problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

1. Problem Statement
2. Complexity Analysis
3. Nim Game solution in C++
4. Nim Game solution in Java
5. Nim Game solution in Python
6. Additional Resources

Problem Statement of Nim Game

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

Complexity Analysis

• Time Complexity: O(1)
• Space Complexity: O(1)

292. Nim Game LeetCode Solution in C++

class Solution {
 public:
  bool canWinNim(int n) {
    return n % 4 != 0;
  }
};
/* code provided by PROGIEZ */

292. Nim Game LeetCode Solution in Java

class Solution {
  public boolean canWinNim(int n) {
    return n % 4 != 0;
  }
}
// code provided by PROGIEZ

292. Nim Game LeetCode Solution in Python

class Solution:
  def canWinNim(self, n: int) -> bool:
    return n % 4 != 0
 # code by PROGIEZ

Additional Resources

• Explore all LeetCode problem solutions at Progiez here
• Explore all problems on LeetCode website here

Happy Coding! Keep following PROGIEZ for more updates and solutions.