Leetcode 927. 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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 927. Three Equal Parts

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact