Create 1190_Reverse_Substrings_Between_Each_Pair_of_Parentheses.md

Author: koji

1190_Reverse_Substrings_Between_Each_Pair_of_Parentheses.md

@@ -0,0 +1,65 @@
+## 1190. Reverse Substrings Between Each Pair of Parentheses
+
+```
+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.
+
+ 
+
+Example 1:
+
+Input: s = "(abcd)"
+Output: "dcba"
+Example 2:
+
+Input: s = "(u(love)i)"
+Output: "iloveu"
+Explanation: The substring "love" is reversed first, then the whole string is reversed.
+Example 3:
+
+Input: s = "(ed(et(oc))el)"
+Output: "leetcode"
+Explanation: First, we reverse the substring "oc", then "etco", and finally, the whole string.
+Example 4:
+
+Input: s = "a(bcdefghijkl(mno)p)q"
+Output: "apmnolkjihgfedcbq"
+ 
+
+Constraints:
+
+0 <= s.length <= 2000
+s only contains lower case English characters and parentheses.
+It's guaranteed that all parentheses are balanced.
+```
+
+
+
+```python
+class Solution:
+ def reverseParentheses(self, s: str) -> str:
+ st = []
+ for c in s:
+ if c == '(':
+ st.append(c)
+
+ elif c == ')':
+ res = []
+ while st and st[-1] != '(':
+ res.append(st.pop())
+ st.pop()
+ st += res
+ else:
+ st.append(c)
+
+ return "".join(st)
+```
+
+
+```
+Runtime: 36 ms, faster than 30.44% of Python3 online submissions for Reverse Substrings Between Each Pair of Parentheses.
+Memory Usage: 14.2 MB, less than 78.52% of Python3 online submissions for Reverse Substrings Between Each Pair of Parentheses.
+```