Dividing Bunty

CodeChefOpen on judge ↗

Bunty was checking the assignments given to his goons and wants to check the forrmed teams for each task. Each task consist of 4 specialised members which are given as a 4- Charactered String $S$ to you. As Bunty is very aggresive he wants that each team consist exactly of 2 kinds of specialised goons. Thus, help Bunty to determine if $S$ consists of exactly two kinds of characters which both app

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