| https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/description/ | Easy |
|---|
class Solution {
fun kLengthApart(nums: IntArray, k: Int): Boolean {
var prevOne = -k - 1
for (i in nums.indices) {
if (nums[i] == 1) {
if (i - prevOne - 1 < k) {
return false
}
prevOne = i
}
}
return true
}
}