Balancing Parentheses

Problem Overview

• Determine the minimum number of insertions needed to balance a parentheses string.
• Input: string s with only '(' and ')'; Output: integer count; 1 ≤ |s| ≤ 1e5.
• Context: string processing and syntax validation used in parsers and editors.
• Asked in Oracle interviews; a classic coding interview problem and interview question.