Added test cases for LongestValidParentheses

Author: omkarnathparida

Dynamic-Programming/LongestValidParentheses.js

@@ -5,7 +5,7 @@
   find the length of the longest valid (well-formed) parentheses substring.
 */
 
-const longestValidParentheses = (s) => {
+export const longestValidParentheses = (s) => {
   const n = s.length
   const stack = []
 
@@ -33,11 +33,3 @@ const longestValidParentheses = (s) => {
   res.push(0)
   return Math.max(...res)
 }
-
-const main = () => {
-  console.log(longestValidParentheses(')()())')) // output -> 4
-  console.log(longestValidParentheses('')) // output -> 0
-  console.log(longestValidParentheses('(()')) // output -> 2
-}
-
-main()

Dynamic-Programming/tests/LongestValidParentheses.test.js

@@ -0,0 +1,19 @@
+import { longestValidParentheses } from '../LongestValidParentheses'
+
+describe('longestValidParentheses', () => {
+  it('expects to return 0 as longest valid parentheses substring', () => {
+    expect(longestValidParentheses('')).toBe(0)
+  })
+
+  it('expects to return 2 as longest valid parentheses substring', () => {
+    expect(longestValidParentheses('(()')).toBe(2)
+  })
+
+  it('expects to return 2 as longest valid parentheses substring', () => {
+    expect(longestValidParentheses(')()())')).toBe(4)
+  })
+
+  it('expects to return 2 as longest valid parentheses substring', () => {
+    expect(longestValidParentheses('(((')).toBe(0)
+  })
+})