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.
Well, the problem is that if the best you can come up with is O(n!) algorithm then there is a big gap between what you know and what you need to know :) Start with 2 random numbers, let's say 5 and 9, write them in binary form, try to xor them and look at the result. Try to make some conclusions what does exactly xor do. Then go to some small examples with let's say 4,5 numbers in an array and solve it with your O(n!) algorithm. Try to write the numbers in the binary form and try to guess why the answer looks like this. I have one hint in mind, but it may be too big, so I don't know if I should write it already. If you want to receive it just send me private message or ask to write it here.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Yet Another Minimax Problem
You are viewing a single comment's thread. Return to all comments →
Well, the problem is that if the best you can come up with is O(n!) algorithm then there is a big gap between what you know and what you need to know :) Start with 2 random numbers, let's say 5 and 9, write them in binary form, try to xor them and look at the result. Try to make some conclusions what does exactly xor do. Then go to some small examples with let's say 4,5 numbers in an array and solve it with your O(n!) algorithm. Try to write the numbers in the binary form and try to guess why the answer looks like this. I have one hint in mind, but it may be too big, so I don't know if I should write it already. If you want to receive it just send me private message or ask to write it here.