Hello everybody , Yesterday night i participated in hacker rank contest and i solved one problem , VROOK My approach was something like this .
I got Wrong answer , Please anybody who took participate in Last night Hackerrank contest please suggest me your approach . You can view my solution here Happy Coding!!! asked 25 Aug '13, 11:52

The solution is to consider each of the columns as a pile in a nim game . The pile size will be abs(p1[i] p2[i])1 , And answer will be xor of these values. If it is non zero , player 2 wins , else player 1 wins. answered 26 Aug '13, 01:26
1
@javadecoder thanks a lot now i got it .. if you have any other questions links please share with us so we can practice on nim game problems.
(26 Aug '13, 10:03)
