LATE COMERS

CodeChefOpen on judge ↗

You are given a **string** consisting of lowercase and uppercase characters only. You have to print the maximum lcm possible of frequencies of any two distinct characters (if possible). ### Input - The first and only line of input contains a string **s**. ### Output - Print the maximum lcm possible. or else if there is only 1 distinct character print '?' (without quotes). ### Constraints - 1 ≤

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