DSA Problems/📚Stack

Valid Parentheses

StringStack

Problem Statement

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.

Approach

Use a stack to track opening brackets. For each closing bracket, check if it matches the top of the stack.

Complexity Analysis

MetricValue
TimeO(n)
SpaceO(n)

Examples

Example 1

Input: s = "()" Output: true

Example 2

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

Example 3

Input: s = "(]" Output: false

Constraints

  • 1 <= s.length <= 10^4
  • s consists of parentheses only ()[]{}}
Loading...
Sign in to run your code...

Asked by companies:

AmazonFacebookBloombergGoogle