Javascript Interview Question: Valid Parentheses using regular expression (leetCode)

Problem Statement:

Given a string s containing just the characters

'(', ')', '{', '}', '[' and ']', determine if the

input string is valid.

An input string is valid if:

Open brackets must be closed by the same type of brackets.

Open brackets must be closed in the correct order.

Every close bracket has a corresponding open bracket of

the same type.

Example 1:

Input: s = "()"

Output: true

Example 2:

Input: s = "()[]{}"

Output: true

Example 3:

Input: s = "(]"

Output: false

Constraints:

1 <= s.length <= 104

s consists of parentheses only '()[]{}'.

Solution:

var isValid = function(s) {

//remove non bracket characters

var regexNonBracketPattern = /[^<>{}[\]()]/g;

var bracketOnlyString = s.replace(regexNonBracketPattern, "");

//find if it has any matching bracket

var regexMatchingBracketsPattern = /(\(\)|\[\]|\<\>|\{\})+/;

while (regexMatchingBracketsPattern.test(bracketOnlyString)) {

bracketOnlyString = bracketOnlyString.replace(

regexMatchingBracketsPattern,

""

);

}

return bracketOnlyString.length == 0

}