921. Minimum Add to Make Parentheses Valid - LeetCode Solution


Stack Greedy

Python Code:

class Solution:
    def minAddToMakeValid(self, S: str) -> int:
        a = []

        count = 0

        for i in range(len(S)):
            if(S[i] == "("):
                a.append(S[i])
            else:
                if(len(a) == 0):
                    count+=1
                else:
                    a.pop()

        count+= len(a)
        
        return count


Comments

Submit
0 Comments
More Questions

1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs
1367A - Short Substrings
87A - Trains
664A - Complicated GCD
1635D - Infinite Set
1462A - Favorite Sequence
1445B - Elimination
1656C - Make Equal With Mod
567A - Lineland Mail
1553A - Digits Sum
1359B - New Theatre Square
766A - Mahmoud and Longest Uncommon Subsequence
701B - Cells Not Under Attack
702A - Maximum Increase
1656D - K-good
1426A - Floor Number
876A - Trip For Meal
1326B - Maximums
1635C - Differential Sorting
961A - Tetris
1635B - Avoid Local Maximums
20A - BerOS file system
1637A - Sorting Parts
509A - Maximum in Table
1647C - Madoka and Childish Pranks
689B - Mike and Shortcuts