Make Pair

CodeChefOpen on judge ↗

A bracket sequence is a string that contains only characters '(' and ')'. You are given a bracket sequence $S(S_1,S_2.....S_n)$, where $S_i$ denotes the type of $i$'s bracket (open or close). You have to find how many perfect pairs of brackets can be formed in the given string. Example - $()$ perfect pair. ### Input The single line contains sequence $S$. ### Output Print the number of possible

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