Friends!

CodeChefOpen on judge ↗

Harry is given names of two people S1 and S2, help Harry find if they are “Best Friends” or “Just Friends”. S1 and S2 are Best Friends if the frequency of the most occurring character and the least occurring character are the same in both the names. Note: • Both the names will be given in lower case. • Both the names will be of only one word. ###Input: - First line will contain $T$, n

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