Search results
Jul 27, 2021 · HackerRank Counter game problem solution. YASH PAL July 27, 2021. In this HackerRank Counter game problem solution, Louise and Richard have developed a numbers game. They pick a number and check to see if it is a power of 2. If it is, they divide it by 2.
def counterGame(n): turn = True while n > 1: turn = not turn if n and n & (n - 1) != 0: for i in range(63): if n < 1 << i: break n -= 1 << i - 1 else: n >>= 1 if turn: return "Richard" else: return "Louise". 0 |. Permalink. Louise and Richard play a game, find the winner of the game.
Function Description. Complete the counterGame function in the editor below. counterGame has the following parameter (s): int n: the initial game counter value. Returns. string: either Richard or Louise. Input Format. The first line contains an integer , the number of testcases.
317 efficient solutions to HackerRank problems. Contribute to RodneyShag/HackerRank_solutions development by creating an account on GitHub.
Jul 21, 2015 · Short Problem Definition: Louise and Richard play a game. They have a counter set to N. Louise gets the first turn and the turns alternate thereafter. In the game, they perform the following operations. If N is not a power of 2, reduce the counter by the largest power of 2 less than N.
Oct 19, 2021 · ⭐️ Content Description ⭐️In this video, I have explained on how to solve counter game using count of set bits in python. This hackerrank problem is a part of...
Saved searches Use saved searches to filter your results more quickly
