Matchsticks game
Medium Accuracy: 46.44% Submissions: 28 Points: 4

Two friends, A and B, are playing the game of matchsticks. In this game, a group of N matchsticks is placed on the table. The players can pick any number of matchsticks from 1 to 4 (both inclusive) during their chance. The player who takes the last match stick wins the game. If A starts first, how many matchsticks should he pick such that he is guaranteed to win the game or determine if it's impossible for him to win.
Note : Consider both A and B play the game optimally.


Example 1:

N = 48
Player A is guaranteed a win if he
picks 3 matchsticks first.

Example 2:

N = 15
Player A is guaranteed a loss no matter
how many matches he picks at first.


Your Task:
You don't need to read input or print anything. Your task is to complete the function matchGame() which takes an Integer N as input and returns the answer.


Expected Time Complexity: O(1)
Expected Auxiliary Space: O(1)


1 <= N <= 1019

to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.