Add solution #1437

Author: JoshCrozier

README.md

@@ -149,6 +149,7 @@
 1389|[Create Target Array in the Given Order](./1389-create-target-array-in-the-given-order.js)|Easy|
 1408|[String Matching in an Array](./1408-string-matching-in-an-array.js)|Easy|
 1436|[Destination City](./1436-destination-city.js)|Easy|
+1437|[Check If All 1's Are at Least Length K Places Away](./1437-check-if-all-1s-are-at-least-length-k-places-away.js)|Easy|
 1472|[Design Browser History](./1472-design-browser-history.js)|Medium|
 1598|[Crawler Log Folder](./1598-crawler-log-folder.js)|Easy|
 1880|[Check if Word Equals Summation of Two Words](./1880-check-if-word-equals-summation-of-two-words.js)|Easy|

solutions/1437-check-if-all-1s-are-at-least-length-k-places-away.js

@@ -0,0 +1,23 @@
+/**
+ * 1437. Check If All 1's Are at Least Length K Places Away
+ * https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @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;
+};