Problem Statement

Maximum Binary Sum Problem Description Given n binary numbers of fixed length, you can perform at most maximumOperationsAllowed operations. In one operation, you can change any number to its 1's complement (change 0s to 1s and 1s to 0s). Find the maximum possible sum of all numbers after operations, expressed as a binary number without leading zeros. Note: The 1's complement of any number means changing every 1 to 0 and every 0 to 1 in the given bit representation of the number. Complete the function maximumBinary in the editor with the following parameter(s): int numberOfBits: the length of each string int maximumOperationsAllowed: the maximum number of operations that we are allowed to do. string arr[n]: a string array, containing all the binary strings, where the length of each string will be numberOfBits. Returns: string: a binary string denoting the maximum possible sum that can be achieved. string maximumBinary(int numberOfBits, int maximumOperationsAllowed, vector arr) Examples