longest-valid-parentheses

malipramod · malipramod · commit 0db683b13044 · 2019-07-26T09:57:45.000+05:30
diff --git a/hard/0032 longest-valid-parentheses/longest-valid-parentheses.js b/hard/0032 longest-valid-parentheses/longest-valid-parentheses.js
@@ -0,0 +1,28 @@
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var longestValidParentheses = function (s) {
+    let maxLength = 0;
+    let stack = [];
+    stack.push(-1);
+    for (let i = 0; i < s.length; i++) {
+        if (s[i] == '(') {
+            stack.push(i);
+        } else {
+            stack.pop();
+            if (stack.length == 0) {
+                stack.push(i)
+            } else {
+                maxLength = Math.max(maxLength, i - stack[stack.length - 1])
+            }
+        }
+    }
+    return maxLength;
+};
+
+
+
+console.log(longestValidParentheses("(()"));
+console.log(longestValidParentheses(")()())"));
+console.log(longestValidParentheses(")("));
diff --git a/hard/0032 longest-valid-parentheses/readme.md b/hard/0032 longest-valid-parentheses/readme.md
@@ -0,0 +1,23 @@
+# Longest Valid Parentheses
+
+Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.
+
+## Example 1
+
+Input: "(()"
+
+Output: 2
+
+Explanation: The longest valid parentheses substring is "()"
+
+## Example 2
+
+Input: ")()())"
+
+Output: 4
+
+Explanation: The longest valid parentheses substring is "()()"
+
+## More info
+
+<https://leetcode.com/problems/longest-valid-parentheses/>
