Given a $0$ indexed binary array nums of length n.

You can partition nums at any index i (where $0 \leq$ i $\leq$ n) into two subarrays:

• nums_left, which contains elements from index $0$ to i $- 1$ (empty if i $= 0$).

• nums_right, which contains elements from index i to n $- 1$ (empty if i $=$ n).

The division score at index i is defined as the sum of:

• The number of $0$s in nums_left.

• The number of $1$s in nums_right.

Return all distinct indices i that yield the highest possible division score. You may return the indices in any order.

Note: The returned indices can be presented in any order.

Constraints:

• n $==$ nums.length

• $1 \leq$ n $\leq 10^5$

• nums[i] is either $0$ or $1$.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.