CT25975

Kavi Counts the charms

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Every season at the mountain city of Highreach, someone must document the rare sighting. This year the task falls to Kavi, armed only with the charms register. 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| <= 674; s contains lowercase English letters.

Example 1:

Input: lerllitjywxioubxzxdfnzebclerskkjkgkghmvhhlhwzgjvnhugosmzmazteticlngipapumpgfdpwjajnmlyrpljgvxlyyuvbtntevsiitmgaummrznhszgbvsfmearlbluodoaojrgrpabmrywuscjoinpeoizlcwsthgrxyesxupndzdpaeypfursoqnqyiysubcdxjlixlwpnzeqfymqejcnkpxcfwkolkxijgodtcrgzhezwsxdwulpkphgrlizejafpsczyejckxrxtehymocnekhjqgpenvlotajbdepcfyrohaznnspddhdaspkecxkrtqdobrgqsyeyjqbhbseyavwsphyzsythgkvuysyntlmykxtrozhsrgzupgszsfxukucwxlktbomevjaxsazdrqjytkkjxolmiduqxlhgyhhizerugydqadjfrcdnjymadqauwfokdytanctpblnqsmetzxkyntfpztbfscvlhkvyygewaiiyjsrdflqwrfpxlpmsnijbtzaaakpltkfmnyfuknaxiollguotpswkzwmjf
Output: y

Example 2:

Input: ngyrjmwzohvzgrvqxrughmssyyertvrihpjgueswmaxixbripruqibryrlgodlrerzwotptphbuxzmnqpxoyvwzbsdexzjzabchvwzrewqtpxpeytltcphicpwocvgdykuxtxcrupuoyxlxyhmisoqlopeddaeudajjbholpzosfwgkuizmyixgzanulmgiwxzlavcymleufldajauaawroeyjuzkokltutyqvxhxfnuobrywygmkyxtlttjvtrkjavharoxqqbmodjuvysqnarzirnmiklhwgklcqmcqjsweycmxxyxiwhmlfqbcqpmnysxtrafmtvzfabjtelsnmzprxzxgjedfhieznzaipivppippvmkhacfgijzhwnnoympnkdtewpsbuehbbrehfqvlodgcarkhvxpvwhadewrcecnvshdbjoemdthzcbwxjmqjsffxiwnxpxdwleplxklcjpwwppydtuapljnbnhkadykuusphictmkfxiyzwvirjgfleqjlwvkdhnxtaakambbfpycmbklsobovvzyqzqcbrjznuxisubmpiutjtohywxtprafluibynvgseszorixukxqtqmuvbbzzzixmwdelnbfitmhnnjrzeaegx
Output: x

Example 3:

Input: hrqvplsgfvnbqyayacbphmknzqnvjramdqftxhicukdavuzonmweiievnqeptnikimlnwpodmvzphcmeeehcuwwsdecizzxurrflgqzeojfopgawjruxbejydfrucwbyjtmjwfdumciwjcpzxssjddihpevwwicdllyglouwomsyrljzwdstrdronbvsoswbocvzfielxrqoowbmjzyituuzeismaexixbtvvourupdkrohgdiimecirfdkmjbkpiruhqmluspemeinxqkmdhpmkkmqotjmrbhezutwmdeiwzwgtkuvmenjrfwgmrhcelaqcctbxljedvgrbvulasrglpwcpctfbelhhrezakguuyviypaqxlucoduixejqamghcfnzwniyfffglijwtetqopjswjbeoynziotmxnqchkpwoqouxfhtmhsypbtgjenkcwpazbmmzctyoifrbtnyaoqpqmechrvqrdzciacjucolfoqtcqjsyqjb
Output: e

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Kavi Counts the charms - EASY Coding Problem | CodeTikki