Three Equal Parts

Given a binary array, find indices to split it into three non-empty contiguous parts that represent the same binary value (leading zeros allowed), or return [-1, -1] if impossible. The core challenge is determining whether the three parts can match the same bit pattern (considering trailing zeros and total ones) and producing valid split indices.