← All problemsSign in

Operation on string

Problem description. You are given a string, in one operation, you have to delete any pair of adjacent letters with same value. For example, string "aabcc" would become either "aab" or "bcc" after operation. you have to reduce the string as much as possible. To do this, you will repeat the above operation as many times as it can be performed. Note: If the final string is empty, print Empty Stri

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