You are given an array arr containing values equal to $0$ or $1$. Divide the array into $3$ non empty contiguous segments such that all three segments represent the same binary value.

Formally, find indices i and j with $i + 1 < j$ such that:

• arr[0] through arr[i] forms the first part,

• arr[i + 1] through arr[j - 1] forms the second part, and

• arr[j] through arr[arr.length - 1] forms the third part.

All three parts, when evaluated as binary numbers, must represent the same value. Leading zeros are ignored when evaluating the binary value.

Return [i, j] if such a partition is possible, or [-1, -1] otherwise.

Note: A segment containing only $0$ elements represents the numerical value $0$.

Constraints:

• $3 \leq$ arr.length $\leq 3 imes 10^4$

• arr[i] is $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.