Easy

Quiz

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

APPROACH

You are given a binary array nums and an integer k. Return true if every pair of 1s in the array is separated by at least k positions, and false otherwise.

Example 1:

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:

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.

1 of 4

1:00

What is the optimal approach for this problem?