Binod and Braces

CodeChefOpen on judge ↗

Binod got a special task to do as homework from his maths teacher. Binod was given a sequence of $n$ braces having only $‘(‘$ and $‘)’$. A closed sequence of brace is one where each opening brace is paired with a closing brace (e.g- $(), (()), ()()$ are closed sequence, while $((), )(, ()($ are not) . Binod was given a sequence containing braces, and he was only allowed to change only **ONE** of t

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI