Minimum Add To Make Parentheses Valid, is a LeetCode problem. In this post we will see how we can solve this challenge in Python

Problem Description

Given a string S of '(' and ')' parentheses, we add the minimum number of parentheses ( '(' or ')', and in any positions ) so that the resulting parentheses string is valid.

Formally, a parentheses string is valid if and only if:

It is the empty string, or

It can be written as AB (A concatenated with B), where A and B are valid strings, or

It can be writt ....

You can find the full details of the problem Minimum Add to Make Parentheses Valid at LeetCode

Solution: Please check the snippet for the solution.

This solution originally posted at: Github by @kamyu104