Valid Parentheses — LeetCode 20 Python Solution
- Problem
- #20
- Pattern
- Stack
- Reading time
- 2 min
- Source
- leetcode.com
The problem
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.
Python solution
class Solution:
def isValid(self, s: str) -> bool:
stk = []
d = {'()', '[]', '{}'}
for c in s:
if c in '({[':
stk.append(c)
elif not stk or stk.pop() + c not in d:
return False
return not stkComplexity
| Measure | Complexity |
|---|---|
| Time | O(n) |
| Space | O(n) auxiliary |
Pattern: Stack
When the most recent unresolved thing is the one that matters, use a stack. LeetCode 20. Valid Parentheses is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Stack.
The stack guide has the Python template for the pattern and the 194 LeetCode problems that use it.
Related problems
On study lists
This problem is on Blind 75, NeetCode 150, Grind 75 and Top Interview 150.
Frequently asked questions
- How hard is LeetCode 20. Valid Parentheses?
- LeetCode 20. Valid Parentheses is rated Easy on LeetCode.
- What is the time complexity of LeetCode 20. Valid Parentheses?
- The Python solution on this page runs in O(n).
- What is the space complexity of LeetCode 20. Valid Parentheses?
- The Python solution on this page uses O(n) auxiliary space.
- What topics does LeetCode 20. Valid Parentheses cover?
- LeetCode 20. Valid Parentheses is tagged Stack and String on LeetCode.