927. Three Equal Parts

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 i + 1 < j, such that: - arr[0], arr[1], ..., arr[i] is the first part, - arr[i + 1], arr[i + 2], ..., arr[j - 1] is the second part, and - arr[j], arr[j + 1], ..., arr[arr.length - 1