Chef and Kabir

CodeChefOpen on judge ↗

Kabir was a very intelligent person in class and jealous by this and to challenge his knowledge Chef gave Kabir a task. The Task is as follows Chef gives Kabir a string of length $N$ and asks him to find out the highest occurrence of the characters and print the character with the highest occurrence in the string if there are two element with the highest occurrence then the lexicography smaller w

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