Leetcode 20. Valid Parentheses

Valid Parentheses - LeetCode

class Solution:
    def isValid(self, s: str) -> bool:
        stack = []
        for char in s:
            if char in ['(','{','[']:
                stack.append(char)
            else:
                if not stack:
                    return False
                cp = stack.pop()
                if cp == '(':
                    if char != ')':
                        return False
                elif cp == '{':
                    if char != '}':
                        return False
                if cp == '[':
                    if char != ']':
                        return False
        if stack:
            return False
        return True

i sloved it using Stack and its operations like append and pop. i used list data structure in Python3

Stack in Python - GeeksforGeeks

Check for Balanced Brackets in an expression (well-formedness) - GeeksforGeeks