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.
Min sum of elements after xor for each permutations.
Example: If you have (1,3,2) and after xor in each permutation you get: List((2, 1), (3, 1), (2, 3), (1, 3), (3, 2), (1, 2)). Get the tuple with min sum and after max value in tuple. if you have more then one tuple with min sum you get max in any of those tuples. That is result.
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 →
Min sum of elements after xor for each permutations. Example: If you have (1,3,2) and after xor in each permutation you get: List((2, 1), (3, 1), (2, 3), (1, 3), (3, 2), (1, 2)). Get the tuple with min sum and after max value in tuple. if you have more then one tuple with min sum you get max in any of those tuples. That is result.