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.
HackerRank Number
HackerRank Number
Sort by
recency
|
6 Discussions
|
Please Login in order to post a comment
Another dumb Python3 solution, but at least I did it by myself.
Python3 solution
how should I optimize my code, it is able to pass only two test cases and in rest time exceeded
I write the code and code works in eclipse. And it works under 1 sec its like minisec but when i test code here i get timeout error. Is this a bug. Code is not long or not efficient by anyway its a normal clear code. Help pls. Edit: Just realize that my code is actualy not efficient for long numbers :D. So no problem in hackerRank. I just be overdefensive coz i work on code long time. And thought it is a perfect code. But its just working code not efficient. :D. I know why they called this expert level now.
The xor I am familiar with yields a boolean value. What does this mean: "The right value can be one of {1^1,1^2,1^3,1^4,2^1,2^2,2^3,2^4} which is {0, 3, 2, 5, 3, 0, 1, 6} and the distinct values are {0, 1, 2, 3, 5, 6} " ?????????