Dunzo OA | Array Reduction Game: Maximizing XOR Sums |

Question · Posted Apr 2026

Problem Statement: Array Reduction Game A new game has been launched in HackerLand. The goal is simple: given an array of integers, you must maximize your total score by reducing the array to a single element through a series of operations. The Rules of the Game: Given an array arr of length n, you must perform exactly n−1 operations until only one element remains. In each operation: Select any two indices x and y (1≤x,y≤current length of arr). Calculate the bitwise XOR (⊕) ...

The full answer & interview discussion are available to premium members.

Log in Create a free account