chore: [LEETCODE 1437] <> Check If All 1's Are at Least Length K places away

src/main/java/problemset/a1437/CheckAllOnes.java

@@ -0,0 +1,16 @@
+package problemset.a1437;
+
+public class CheckAllOnes {
+    public boolean kLengthApart(int[] nums, int k) {
+        int prev = - (k + 1);
+
+        for (int curr = 0; curr < nums.length; curr++) {
+            if (nums[curr] == 1) {
+                if (curr - prev - 1 < k)
+                    return false;
+                prev = curr;
+            }
+        }
+        return true;
+    }
+}

src/test/java/problemset/a1437/CheckAllOnesTest.java

@@ -0,0 +1,34 @@
+package problemset.a1437;
+
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+class CheckAllOnesTest {
+
+    private CheckAllOnes checkAllOnes;
+    private int[] testcaseOne;
+    private int[] testcaseTwo;
+    private int kOne;
+    private int kTwo;
+
+    @BeforeEach
+    void setUp() {
+        checkAllOnes = new CheckAllOnes();
+        testcaseOne = new int[]{1,0,0,0,1,0,0,1};
+        testcaseTwo = new int[]{1,0,0,1,0,1};
+        kOne = 2;
+        kTwo = 2;
+    }
+
+    @Test
+    void test_kLengthApart_testCaseOne() {
+        assertTrue(checkAllOnes.kLengthApart(testcaseOne, kOne));
+    }
+
+    @Test
+    void test_kLengthApart_testCaseTwo() {
+        assertFalse(checkAllOnes.kLengthApart(testcaseTwo, kTwo));
+    }
+}