Given a parentheses string s containing only the characters '(' and ')'.

A parentheses string is considered balanced when:

• Every open parenthesis '(' is matched with exactly $2$ consecutive closing parentheses '))'.

• Every open parenthesis '(' occurs prior to its corresponding pair of closing parentheses '))'.

You may insert characters '(' or ')' at any position within the string.

Return the minimum number of insertions required to make s balanced.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• s consists of '(' and ')' only.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.