AlgoUniversity
  • Go Back
Discussion
Valid Parentheses :

Author

Akash

Difficulty Level : Easy

Submissions : 221

Asked In : Qualcomm

Marks :10

: 1 | : 0

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.

Input

The first line contains the string $$$s$$$, $$$(1 \le |s| \le 10^5)$$$.

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

Output

Return $$$true$$$ if the string is valid and $$$false$$$ otherwise.

Examples

Input
()[]{}
Output
true
Input
[}
Output
false

You need to login to view your submissions.

You need to login to view all submissions.

Loading...

Result : Executed

Loading...

Feel something is wrong with the test cases?

Result : Accepted

Test Cases :

You need to Log In
We're glad that you want to attempt this problem!

But to Run or Submit the Problem, you need to Log In.

Continue to Log In
Challenge Submitted!

Your challenge has been submitted successfully.

You will get a response soon via WhatsApp or Email.

Challenge
Facing issue while trying to solve the problem! Don't worry, we got you covered!

Do let us know your issue.

Looks good!
Please enter your issue / feedback.

How do we get in touch with you?
Looks good!
Please enter your phone no.
Looks good!
Please enter your email address.