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

Easy

You receive an binary array nums and an integer k, provide true if all 1 's are at least k places away from each other, otherwise provide false.

Example 1

Original illustrative diagram 1 for Check If All 1's Are at Least Length K Places Away

Input: nums = [1,0,0,0,1,0,0,1], k = 2

Output: true

Explanation: Each of the 1s are at least 2 places away from each other.

Example 2

Original illustrative diagram 2 for Check If All 1's Are at Least Length K Places Away

Input: nums = [1,0,0,1,0,1], k = 2

Output: false

Explanation: The second 1 and third 1 are only one apart from each other.

Constraints

1 <= nums.length <= 10^5
0 <= k <= nums.length
nums[i] is 0 or 1

Did this problem appear in one of your interviews?

Responses stay private.

Constraints

Did this problem appear in one of your interviews?

Acceptance rate: 100%