Triangular Swaps

CodeChefRating 2071Open on judge ↗

You are given a string $S$ of length $N$ consisting of lowercase english alphabets. In one operation, you can: - Choose any three **consecutive** characters in $S$; - Apply a **circular left shift** operation on the chosen characters. For example, let the string be `codechef`. In one operation, you can: - Choose characters $S_2, S_3,$ and $S_4$; - Apply a circular left shift to convert $S_2S_3S

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