feat: add JS solution to lc problem: No.1562

Author: Jaran F

solution/1500-1599/1562.Find Latest Group of Size M/README.md

@@ -289,6 +289,25 @@ func findLatestStep(arr []int, m int) int {
 }
 ```
 
+#### JavaScript
+
+```javascript
+const findLatestStep = function (arr, m) {
+    let result = -1;
+    const len = arr.length;
+    const reOnes = new RegExp(`\\b1{${m}}\\b`);
+    arr.reduce( (accum, item, iIndex) => { 
+        accum[item-1] = '1';
+        iIndex++;
+        if (iIndex >= m && reOnes.test(accum.join(''))) { 
+            result = iIndex;
+        }
+        return accum
+    },  [...(" ".repeat(len))] );
+    return result
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1500-1599/1562.Find Latest Group of Size M/README_EN.md

@@ -269,6 +269,25 @@ func findLatestStep(arr []int, m int) int {
 }
 ```
 
+#### JavaScript
+
+```javascript
+const findLatestStep = function (arr, m) {
+    let result = -1;
+    const len = arr.length;
+    const reOnes = new RegExp(`\\b1{${m}}\\b`);
+    arr.reduce( (accum, item, iIndex) => { 
+        accum[item-1] = '1';
+        iIndex++;
+        if (iIndex >= m && reOnes.test(accum.join(''))) { 
+            result = iIndex;
+        }
+        return accum
+    },  [...(" ".repeat(len))] );
+    return result
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1500-1599/1562.Find Latest Group of Size M/Solution.js

@@ -0,0 +1,19 @@
+/**
+ * @param {number[]} arr
+ * @param {number} m
+ * @return {number}
+ */
+const findLatestStep = function (arr, m) {
+    let result = -1;
+    const len = arr.length;
+    const reOnes = new RegExp(`\\b1{${m}}\\b`);
+    arr.reduce( (accum, item, iIndex) => { 
+        accum[item-1] = '1';
+        iIndex++;
+        if (iIndex >= m && reOnes.test(accum.join(''))) { 
+            result = iIndex;
+        }
+        return accum
+    },  [...(" ".repeat(len))] );
+    return result
+}