InterviewBit Academy is now Scaler!
InterviewBit Academy is now Scaler Academy!

Equal Average Partition

Given an array with non negative numbers, divide the array into two parts such that the average of both the parts is equal.
Return both parts (If exist).
If there is no solution. return an empty list.


[1 7 15 29 11 9]

[9 15] [1 7 11 29]

The average of part is (15+9)/2 = 12,
average of second part elements is (1 + 7 + 11 + 29) / 4 = 12

NOTE 1: If a solution exists, you should return a list of exactly 2 lists of integers A and B which follow the following condition :

  • numElements in A <= numElements in B
  • If numElements in A = numElements in B, then A is lexicographically smaller than B ( )

NOTE 2: If multiple solutions exist, return the solution where length(A) is minimum. If there is still a tie, return the one where A is lexicographically smallest.

NOTE 3: Array will contain only non negative numbers.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Equal Average Partition on Interview Code Editor
Sign Up
to access hints and editorial solutions for Equal Average Partition
Asked In:


Click here to start solving coding interview questions