Search
⌘K

Leetcode 1437. Check If All 1's Are at Least Length K Places Away

Check whether every 1 in a binary array is separated from the next 1 by at least k positions—i.e., ensure there are at least k zeros between any two consecutive 1s.


Question Timeline

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

Comments

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