Solve validParentheses

tests/validParentheses.test.js

@@ -60,6 +60,6 @@ test('{}{}()[] should return true', () => {
   expect(validParentheses('{}{}()[]')).toBeTruthy()
 })
 
-test.only('{}[{}]((){})(){} should return true', () => {
+test('{}[{}]((){})(){} should return true', () => {
   expect(validParentheses('{}[{}]((){})(){}')).toBeTruthy()
 })

validParentheses.js

@@ -15,7 +15,6 @@ function validParentheses(str) {
 }
 
 function isArrayValid(arr) {
-  debugger
   if (!arr.length) return true
   if (arr.length % 2 !== 0) return false
 
@@ -27,24 +26,23 @@ function isArrayValid(arr) {
     return false
   }
 
-  if (arr[1] === closers[initialChar]) {
-    hasFoundCloser = true
-    const clippedArray = arr.slice(2)
-    if (!isArrayValid(clippedArray)) return false
-  } else {
-    // Instead of looping backwards, we have to
-    // 1. Loop forward
-    // 2. Count other openings of the same opener
-    // 3. Count closings too
-    // 4. Once we get to the same number of closers as we had openers, that's the index to slice the array.
-    for (let i = arr.length - 1; i >= 0; i--) {
-      if (arr[i] === closers[initialChar]) {
+  let initialsFound = 1
+
+  for (let i =  1; i <= arr.length; i++) {
+    if (arr[i] === initialChar) {
+      initialsFound++
+    }
+
+    if (arr[i] === closers[initialChar]) {
+      if (initialsFound === 1) {
         hasFoundCloser = true
         const arr1 = arr.slice(1,i)
         const arr2 = arr.slice(i+1)
         if (!isArrayValid(arr1)) return false
         if (!isArrayValid(arr2)) return false
         break;
+      } else {
+        initialsFound--
       }
     }
   }