2025-08-03 10:22:53 +0000 UTC

Check If All 1’s Are at Least Length K Places Away
Categories:
Tags:

Code

class Solution:
    def kLengthApart(self, nums: List[int], k: int) -> bool:
        prev = -k - 1
        for i, num in enumerate(nums):
            if num == 0:
                continue
            if i - prev - 1 >= k:
                prev = i
            else:
                return False
        return True