You are given an array arr which consists of only zeros and ones, divide the array into three non$-$empty parts

such that all of these parts represent the same binary value.

If it is possible, return any $i,j$ with arr$[i+1],$arr$[i+2],$dots,arr$[j-1]$