CT893

Farhan's inscriptions Reckoning

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

In the otter slides of Sleekwater, Farhan the dispatch writer keeps careful count of the inscriptions. Prepare the guildmaster's brief, every figure matters. Task: Read a lowercase string s and print the character that occurs most often. If several tie, print the alphabetically smallest. Input format: One line with a single lowercase string s. Output format: Print a single character. Constraints: 1 <= |s| <= 179; s contains lowercase English letters.

Example 1:

Input: xxknhgtgplqaejfaahkqudpifntrhcvstgbwedepchqyrqkchsuuhaxlwtcdcaiiidsovmuimsfwllodknvlluayhknbsztnnwwlsnffvconodtiwnr
Output: n

Example 2:

Input: nxiaaucoqahvvnyyqqgxpdflngoucgseebievjavxjrebejsvsecpodavmoeelcdndmjitqyxrcongypktbkwtnrazyyuuiq
Output: e

Example 3:

Input: kzsufpmbjqjyrqbrgrbkyypqwjvaitgmktvtoqywxchbeuskitn
Output: b

Constraints:

1 <= |s| <= 179; s contains lowercase English letters.

Loading...
Test Cases:No test cases
No test cases available.
Farhan's inscriptions Reckoning - EASY Coding Problem | CodeTikki