To solve this problem, you'll have to open it on the computer

Valid Parentheses

Stacks
easy
Score: 10

You are given a string s containing just the characters in an order '(' , ')' , ‘{’ , ‘}’ , '[' and ']' , determine if the input string is valid. Return 1 if valid else 0 if invalid.

An input string is said to be valid iff:

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

2.)Open brackets must be closed in the correct order.

Input Format:

First Parameter - String s

Output Format:

Return the number.

Sample Tests

Case1:
Input: s = "()"
Output: 1
Case2:
Input: s = "()[]{}"
Output: 1
Case3:
Input: s = "(]"
Output: 0

Constraints:-

  • 1 <= s.length <= 104
  • s consists of parentheses only '()[]{}’.
  • Expected Time Complexity: O(n)
  • Expected Space Complexity: O(n)
Submit code to see the your result here