MafiaK#####

CodeChefOpen on judge ↗

'***Mafia***' claims that all the girls named '***k#####***' are nice, but his friends '***Akatsuki***' disagree. To prove him wrong, his friends decided to test ***T*** girls named ***k#####***. They gave each girl a string of length N consisting of characters '***a***', '***b***', and '***c***' and asked them to calculate the ***maximum distance between two similar characters***. His friends kn

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