Disturb and Destroy

CodeChefOpen on judge ↗

You are given a string of length $N$ consisting only of $A, B, C$ and $D$. You can disturb the relative order of the string by rearranging the letters, as many times as needed. The substrings **"ABC"** and **"BCD"** are considered *corrupted*, and get destroyed wherever formed. Determine if the string can be completely destroyed after any number of steps. ### Input - The first line of input will

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