Valid Parentheses Problem

Valid Parentheses Problem — ExecCode Easy DSA Practice

Solve the Valid Parentheses problem on ExecCode. Free online easy DSA practice in Stack. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: 1. Open brackets must be closed by the same type of brackets. 2. Open brackets must be closed in the correct order. 3. Every close bracket has a corresponding open bracket of the same type.

Examples

Input s = "({[()]})"; Output true. Input s = "()[]{}"; Output true. Input s = "(]"; Output false

Constraints

1 ≤ s.length ≤ 10⁴ s consists of parentheses only '()[]{}'

Practice Valid Parentheses free on ExecCode. Browse DSA problems, topic map, and placement guides.