20. Valid Parentheses - LeetCode Solution


Stack String

Python Code:

class Solution:
    def isValid(self, s: str) -> bool:
        s = list(s)
        stack = []

        c = {"(": ")" , "{":"}", "[": "]"}
        for i in s:
            if(i =="[" or i=="{" or i=="("):
                stack.append(i)
            else:
                if(len(stack) ==0 ):
                    return False

                if(c[stack.pop()] != i ):
                    return False
                
        if(len(stack) == 0):
            return True
        else:
            return False
            
        


Comments

Submit
0 Comments
More Questions

151A - Soft Drinking
1352A - Sum of Round Numbers
281A - Word Capitalization
1646A - Square Counting
266A - Stones on the Table
61A - Ultra-Fast Mathematician
148A - Insomnia cure
1650A - Deletions of Two Adjacent Letters
1512A - Spy Detected
282A - Bit++
69A - Young Physicist
1651A - Playoff
734A - Anton and Danik
1300B - Assigning to Classes
1647A - Madoka and Math Dad
710A - King Moves
1131A - Sea Battle
118A - String Task
236A - Boy or Girl
271A - Beautiful Year
520B - Two Buttons
231A - Team
479C - Exams
1030A - In Search of an Easy Problem
158A - Next Round
71A - Way Too Long Words
160A - Twins
1A - Theatre Square
1614B - Divan and a New Project
791A - Bear and Big Brother