Most ever Easy Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def minAddToMakeValid(self, s: str) -> int:\n        open_count = 0 \n        close_count = 0  \n\n        for char in s:\n            if char == \'(\':\n                open_count += 1\n            elif char == \')\':\n                if open_count > 0:\n                    open_count -= 1\n                else:\n                    close_count += 1\n\n        return open_count + close_count\n```
['String', 'Stack', 'Greedy', 'Python3']