← All problemsSign in

Bracketing string

You will be given a string $S$. You have to put round bracket around each character. The number of opening bracket and closing bracket around a character must be equal to its position in alphabetical order. For example: for the string $ABBAB$, output must be $(A(BB)A(B))$ ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains o

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

Sign in to chat with the tutor and save your progress.

Sign in to start