input
stringlengths 676
686
| output
listlengths 1
1
| id
stringlengths 41
41
|
|---|---|---|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: xyeidipovvrzxaycqdaabrfsxxtffzlkyzuglgsjqugsl
Output:
|
[
"x"
] |
task1188-fa6658b0cb0f4838b12b8be2719f6203
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: uyaavodyjrddlwjkosdqixerrosjegpaisxltkyrkeuuoqgfv
Output:
|
[
"d"
] |
task1188-865be2227a7d4e97947b177c5cae76db
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: qdzwmebntqhpmmyctoiezzgfiwfhonkkverxajtchg
Output:
|
[
"e"
] |
task1188-3c2bbde41c84405da1383692b30c6751
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: buxusrcnirvzpgzlulyazqtnawtregxujvpsfsssjanlaiqjwo
Output:
|
[
"s"
] |
task1188-6d860485636441e482da888f630cf6e1
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: rigabchdgzulwxgylasliyzxykvyyzkwkvfazelhhdd
Output:
|
[
"y"
] |
task1188-dee8067e507b4e7eb11e3d1fd5419309
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: awsqtjxdxafxckkkvrrkovkiegzmixmydnpfarmgoxpwuuxoad
Output:
|
[
"x"
] |
task1188-d6663d85a8e54ad1bd303d31e9af86ea
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: gwrrvxaiuyuxxhtmbmjwkrhzytcbtzdgppusmlxlsc
Output:
|
[
"x"
] |
task1188-5b6043fed16c4b64bad753db831a2999
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: iuofjqlvdsylbdwtpyqspxlbjdussjgveoqfafkzuueap
Output:
|
[
"s"
] |
task1188-43b2ecc9f6f34b77bf8805aa85b377dd
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: meaftnetnciykgvdbtaijurggpelbwrbgxgqskwvjvxcrvghl
Output:
|
[
"g"
] |
task1188-3a077cc553a54f958344579cb591ac18
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: hhkcwykbjbhcoycjgluzwcxfuggmzjybgrbmegswhfuz
Output:
|
[
"g"
] |
task1188-89ac88b6d34f4059a14bc15e061ce207
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: zxtukjqmgjjxgcvxvunmimqzffprfiisqqwciaesirjgkghd
Output:
|
[
"i"
] |
task1188-14922b7191f54417b85ab35a8d8a14dd
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: uaskevgemehvehgiuixjzukwcobtmtuoyfaydguwqn
Output:
|
[
"u"
] |
task1188-f65abd4a7822415799f9ef4a571340a3
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: klopxhkuknaqxhvtoiuorijxvdcmqyntkrripsxuqbkhkdck
Output:
|
[
"k"
] |
task1188-51e1085801a3419aa923609eba6b863a
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: gnkhwmqcnihwyebdrjhhegxrwdhopjrgbiqiwcpbkbpshbfun
Output:
|
[
"h"
] |
task1188-6a014836e90b41b4afad3dd34224c8d3
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: itfnktrtqphsmjigumfwuntnjhsqmxnqiqnccftnwxzg
Output:
|
[
"n"
] |
task1188-28be9866027a4b4a91d74726c0950792
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: pmtvhblbblvmdmhjvxjsmqfxoxrmhpqdibicbozhb
Output:
|
[
"b"
] |
task1188-5d77db9f73b642ca95085a6d8ffb04e0
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: fodvqnkkoyhojrbkyjkahjwtpvcctlzzzipahfpd
Output:
|
[
"k"
] |
task1188-d4efb64bf77e476fac8e7dc7819f835d
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: krzesomikagodqthmvoecdqqamqjwadcurjtkwytqc
Output:
|
[
"q"
] |
task1188-323be63a690b449489b6be24bfb5cb40
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: qvvxymoafajfckssazrhscywhjplqnztkgmbubjfhgqqxzlgp
Output:
|
[
"q"
] |
task1188-b58adc94ff05474ba5ce43b366607e7e
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: djmasmbvrerpjoybnrrksiokagkwrhopvuocuvobqtme
Output:
|
[
"o"
] |
task1188-dd29c8bbeef940deb315445b6a7850c0
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: stzhfrtgqpplhnngelefpgaeqarmrxcxrcqhwdyffrwuf
Output:
|
[
"f"
] |
task1188-fda09cd0450c472c84d572f6203b4153
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: tbvxkkmrxrivkpjvrbhboxfyyqlniiobrebtfunsrcq
Output:
|
[
"b"
] |
task1188-ad65219919aa4e84b3ea223e7dd760be
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: tazddairsngqiuwcrutuudobgryrxyodslunvvvcye
Output:
|
[
"u"
] |
task1188-b0c57b300ef648a68de980ee19781821
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: djewugnkbetbbhpfjteixkncklpqxkqtoltmtfxdjfelz
Output:
|
[
"t"
] |
task1188-27469a32d980461ea06646a43001ed8d
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: qhlvxdhyiwfghciwfkqnfoopcwgxcosgffkgqaayafimfb
Output:
|
[
"f"
] |
task1188-7ef2cb6d4fd848e5b2ab5301d8283272
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: ytxagjoultzwuyuhflpslxkddfgacjsjgghkntohmztpkossu
Output:
|
[
"g"
] |
task1188-9281d8bffd534a2192cc0a59442b2be8
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: bjodsiemdaxikjtmbmogtfhqjdvtdeldlxxgxxsbmz
Output:
|
[
"d"
] |
task1188-c53d6d74ecad485e8f67a1154dc5248a
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: kgbqpjqhmqbwekvbwmhhmywbivvvihdxysfmbjypwqzi
Output:
|
[
"b"
] |
task1188-f9db29dcec924127b4071c6f0b63c800
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: nnfdmjgqitxwoatdhmlcbmpfoafabjnkougafpeyw
Output:
|
[
"a"
] |
task1188-a9aadc5589e6468eab87d2c26b2eeea8
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: nlaltmivwslqulylzopulbkzbhucvnogrfbmpwpvwn
Output:
|
[
"l"
] |
task1188-596575c581304474834db9426051fec6
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: ttqilxnvfjgmlhxtiqkoqetctnjujuokhvxowixj
Output:
|
[
"t"
] |
task1188-85c48da801c647f9ac3d9c19ae62b3dd
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: nzdsgibxkugtesjpkvvncfckisjnlxehhnvfsbnambp
Output:
|
[
"n"
] |
task1188-cf120614b5b04161aa5eb92b72484cf8
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: kgixcxgklpxhiurxvnbmlkvdgdwhktwpwyxoejdko
Output:
|
[
"k"
] |
task1188-0301f6519b374b989b2cb3371730733d
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: rguadowvzfqlktkljtojlzxicbihwzkfktobkxcv
Output:
|
[
"k"
] |
task1188-49f31dfa802c4906b0a6bfbeda6f5fa5
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: hrhqxxztxgbndnuwnzbcrgdjymqglmwhypwexybhxqrnold
Output:
|
[
"x"
] |
task1188-1b6ad0f258924c3ebce2fd79256ac18a
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: bcaupmhhjmizfywxbobwudtmmwelxtftdnrjpffmpsw
Output:
|
[
"m"
] |
task1188-57f38f9af7194586a3807a1b59747714
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: gvqsdptlstesguqiqdigtnlrrjuthnkjiokvxbpmchywxup
Output:
|
[
"t"
] |
task1188-e483377783744ccba966438e1469c867
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: jdnjngrpwwerlrycsgzeuhgtyqaubvmebayiqerzgyfzzipmx
Output:
|
[
"e"
] |
task1188-5581adccfd7647cb8d9b5247ac3f7e2b
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: bjyllmnojmxyyldkyddeuvyncagtxnysuluqgiljaxr
Output:
|
[
"y"
] |
task1188-e35a1bcc0b664f249bc016652c5c3ce5
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: jmjwiaupypmqqlrryzrqvpvmwvbfgpgzcpjmbnqnrilayzkhv
Output:
|
[
"p"
] |
task1188-7970fa9fb6954953a6dd757e17c69c9f
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: gcqulowceqbftbgmnujwyxnfaszchbyfnxxattiow
Output:
|
[
"b"
] |
task1188-f4bf758d7a9a49a1b2854b42582c6dbf
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: kwobnbqvlextyhgjgpllvjfgfnvblpvhhnzxocrtmghcdqhw
Output:
|
[
"h"
] |
task1188-55afb8c007904e279094d92bf4f03ab6
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: qrcjhernnxsqvytbhghxtwddacrnwufbluwogvtwsjxnczzl
Output:
|
[
"n"
] |
task1188-3f08befcdbda42eba77cd8f3f71af4e8
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: honbzjfxsmjdljhzmhaxospnrqvxmeosdhxnpogazcnx
Output:
|
[
"x"
] |
task1188-ee9f1450b72c43ff89b54bfd157046ef
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: gwdtxujzxtlgcbbxiuibqxfdbwfejxokolsvkleoopv
Output:
|
[
"x"
] |
task1188-c3b87a5e1f3f4aceafaa2028bc1f2584
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: fpliulnjysejibnbmvuuhddytsigsijmzseorvxjiqoedw
Output:
|
[
"i"
] |
task1188-7f57148a0c0a473f86546e2a29480d13
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: shsqlqunbrdiqidfgoorvutvibzhdiymppuhwgie
Output:
|
[
"i"
] |
task1188-45a50771888740818aa6d0b98ab1fd43
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: mcdvfovaeeohebnhlditrjfktdnbxbtddulvbcdnkpnddvuhg
Output:
|
[
"d"
] |
task1188-f81ef9f7a39742de8a3a98fc121d75a5
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: gamdzmwgrdtklncavqzebqhsvjqaceozgoyxenzlyocdmbzt
Output:
|
[
"z"
] |
task1188-67c79e62b1ef4e00948301ba8838d6cd
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: eszudurddbdbvvgnuebijuyswglflxnbxnqmskolmofg
Output:
|
[
"b"
] |
task1188-453f080e70b64e39b8ccef4a78c2c594
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: zcbabcihxfbhomwbvwkgfocrvzljentwvjrmugfcnuzpqcer
Output:
|
[
"c"
] |
task1188-be6c6b989bc04c01bc58d472d26ab07c
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: iufxlomsgolnpdgeqbpwuvedwdfcgwqkebmfgzlanjmc
Output:
|
[
"g"
] |
task1188-f4eeb618f4ac46f3876f6056f190e9cb
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: fqhihmuozpfmkhlmdsxqktvneazrigmuufvlseytffvoi
Output:
|
[
"f"
] |
task1188-6f638766a6bc4484b182d38637cd6d17
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: ihhjbxiojfgycqycaiqnwovmjzbtybosieneuymu
Output:
|
[
"i"
] |
task1188-b98751c79b844f5b9cd8079a1d5c6b4d
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: jeypzutiwplmhqdiwcgxyvidizucpfeqrlcgwicvafdzzh
Output:
|
[
"i"
] |
task1188-a4044f2c0477407abf73be53257575c9
|
Definition: In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.
Positive Example 1 -
Input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Output: d
Positive Example 2 -
Input: pmivbvxizgpmhtdcqjhrljcfojxnlrcgfhxterzj
Output: j
Negative Example 1 -
Input: pmofvzvzgetkxrgilalolgprjwwvsrvtznqcqnhxlgwouhp
Output: p
Negative Example 2 -
Input: wkunbbajfnoyqvtoixbljceydlfejducbyhmrgflndvayuy
Output: d
Now complete the following example -
Input: coendyxsbgxbkuhrwcsvtmspdiifterbqanrlgygfzszvpjsru
Output:
|
[
"s"
] |
task1188-682bd600f8f1424ba9b5903d021945ca
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.