Check If All 1's Are at Least Length K Places Away LeetCode solution in JavaScript

1
var kLengthApart = function (nums, k) {
2
  let arr = [];
3

4
  for (let i = 0; i < nums.length; i++) {
5
    if (nums[i] === 1) arr.push(i);
6
  }
7
  for (let i = arr.length - 1; i >= 0; i--) {
8
    if (arr[i] - arr[i - 1] - 1 < k) return false;
9
  }
10
  return true;
11
};