Add solution #1190

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,173 LeetCode solutions in JavaScript
+# 1,174 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -922,6 +922,7 @@
 1186|[Maximum Subarray Sum with One Deletion](./solutions/1186-maximum-subarray-sum-with-one-deletion.js)|Medium|
 1187|[Make Array Strictly Increasing](./solutions/1187-make-array-strictly-increasing.js)|Hard|
 1189|[Maximum Number of Balloons](./solutions/1189-maximum-number-of-balloons.js)|Easy|
+1190|[Reverse Substrings Between Each Pair of Parentheses](./solutions/1190-reverse-substrings-between-each-pair-of-parentheses.js)|Medium|
 1200|[Minimum Absolute Difference](./solutions/1200-minimum-absolute-difference.js)|Easy|
 1206|[Design Skiplist](./solutions/1206-design-skiplist.js)|Hard|
 1207|[Unique Number of Occurrences](./solutions/1207-unique-number-of-occurrences.js)|Easy|

solutions/1190-reverse-substrings-between-each-pair-of-parentheses.js

@@ -0,0 +1,32 @@
+/**
+ * 1190. Reverse Substrings Between Each Pair of Parentheses
+ * https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/
+ * Difficulty: Medium
+ *
+ * You are given a string s that consists of lower case English letters and brackets.
+ *
+ * Reverse the strings in each pair of matching parentheses, starting from the innermost one.
+ *
+ * Your result should not contain any brackets.
+ */
+
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var reverseParentheses = function(s) {
+  const stack = [[]];
+
+  for (const char of s) {
+    if (char === '(') {
+      stack.push([]);
+    } else if (char === ')') {
+      const reversed = stack.pop().reverse();
+      stack[stack.length - 1].push(...reversed);
+    } else {
+      stack[stack.length - 1].push(char);
+    }
+  }
+
+  return stack[0].join('');
+};