Playing with char(s)

CodeChefOpen on judge ↗

Consider a string of length n. Each character is either 'a', 'b' or 'c'. Select any two characters $s[i]$ and $s[j]$ such that $s[i]$ != $s[j]$ and $i,j$ are valid indexes. Find the maximum value of the absolute difference between $i$ and $j$ i.e $abs(i-j)$. i.e., find the maximum distance where distance is the maximum value of absolute difference between $i$ and $j$ i.e $abs(i-j)$ ### Input The

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