← All problemsSign in

MAXIMUM REPEATING CHARACTER

Given string $str$ of length $L$ contains only small alphabets. Mr. Patel wants to find that which character is used maximum in that string. ###Input: - Single line of input contains the string $str$. ###Output: - Maximum repeating character in Input string. ###Constraints - $1 \leq L \leq 10^5$ ###Subtasks - 30 points : $1 \leq L \leq 100$ - 70 points : $1 \leq L \leq 10^5$ #

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

Sign in to chat with the tutor and save your progress.

Sign in to start