INVASION OF WHITEWALKERS

CodeChefOpen on judge ↗

Whitewalkers are invading WINTERFELL. NIGHT KING wants the intelligent whitewalkers to lead the army. So, they have to solve the question.Those who solve the question can lead the army. Whitewalkers are given an array $A$ with $N$ characters. The set $S$={'a','b','c'}. Find the length of maximum sub-array in which frequency of any two elements of $S$ is $equal$. Help him to solve the question.

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