Leetcode 921. Minimum Add to Make Parentheses Valid

Given a string of '(' and ')', return the minimum number of parentheses insertions needed to make the string valid. This is solved greedily by scanning once and counting unmatched closing parentheses and leftover opening parentheses that require insertions.