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

Easy • View on LeetCode • View on GitHub

Problem Description

Given an array nums of 0s and 1s and an integer k, return True if all 1's are at least k places away from each other, otherwise return False.

Solution

/**
 * @param {number[]} nums
 * @param {number} k
 * @return {boolean}
 */
var kLengthApart = function(nums, k) {
  let offset = k;
  for (const num of nums) {
    if (num === 0) { offset++; continue; }
    if (offset < k) return false;
    offset = 0;
  }
  return true;
};