Challenge: Valid Parentheses

Try to solve the Valid Parentheses problem.

We'll cover the following

Statement

Given a string, exp, which may consist of opening and closing parentheses. Your task is to check whether or not the string contains valid parenthesization.

The conditions to validate are as follows:

  1. Every opening parenthesis should be closed by the same kind of parenthesis. Therefore, {) and [(]) strings are invalid.

  2. Every opening parenthesis must be closed in the correct order. Therefore, )( and ()(() are invalid.

Constraints:

  • 11 \leq exp.length 103\leq 10^3

  • The string will only contain the following characters: (, ), [, ], {, and }.

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.