← Google questions

Minimum '+' insertions to ensure each bracket pair encloses a '+'

Filed under Google

Given a balanced bracket sequence S consisting of '(' and ')', find the minimum number of '+' characters that must be inserted into S such that every matched pair of brackets encloses at least one '+'…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.