We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Unfair Game
Unfair Game
Sort by
recency
|
16 Discussions
|
Please Login in order to post a comment
Here is my solution in java, javascript, python, C, C++, Csharp HackerRank Unfair Game Problem Solution
Here is Unfair Game problem solution in Python Java C++ and C programming - https://programs.programmingoneonone.com/2021/07/hackerrank-unfair-game-problem-solution.html
The game is simple, all you have to do is make the xor of all the piles equal to zero if they are not already. The main thing is finding the algorithm for this.
Look at the the bitwise xor of all the elements
For example: piles = [10,4,5,1]
if I draw its bitwise map then (Symbol "x" equates to 1) :
(Initial)
(Step - 1) (We correct for row 1)
(Step - 2)(We correct for row 2)
(Step - 3) and (Step - 4) are not necessary to show as they are already corrected.
Let's take another example for the case of piles = [1,1,1]
(Initial)
(Step - 1) In this there is an excess of 1 so we shift that one ahead and start with that row again
(Step - 2) Now, we need to apply correction to the row that we just shifted.
(Step - 3) Now first row has been corrected and the second row needs correction. If there is no other way to add an 1 the we introduce the 1 in the last row
Now, you just need to convert the rows to their respective integers and subtract and add the difference in the count and return the count
For example:
and
and
That is how to solve this question I guess. I will try it.
Python 3 solution
Solution In python2: https://notepad.pw/share/tbbo2eehq
NEED AT 4 Hours to understand