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

Easy

557

212

Given an binary array `nums`

and an integer `k`

, return `true`

* if all *`1`

*'s are at least *`k`

* places away from each other, otherwise return *`false`

.

**Example 1:**

Input:nums = [1,0,0,0,1,0,0,1], k = 2Output:trueExplanation:Each of the 1s are at least 2 places away from each other.

**Example 2:**

Input:nums = [1,0,0,1,0,1], k = 2Output:falseExplanation: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`

Accepted

67.9K

Submissions

116.2K

Acceptance Rate

58.5%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved