input
stringlengths 676
686
| output
sequencelengths 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: swsgfdnhsowyuyftknwvpbzmuzsocznezifqfoiqmeoiiygmxq
Output:
| [
"f"
] | task1188-127cd52671044c20a260427f0c0b8933 |
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: adfuaeqlkiofguplnmognamabrifkhktmvukqjypjftftzwbv
Output:
| [
"f"
] | task1188-505b2effa40d40b6866b7a822b80a47a |
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: svplpmqecpkpsovlluundievqprydthpooonwfkkypxzf
Output:
| [
"p"
] | task1188-7748033e325c4d5b8f88a69800c585cc |
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: aidsqyawuvenjzkansacvfqentxwgxbfkssnjmwsxzg
Output:
| [
"s"
] | task1188-bfb19c897500403fb1b052e2ab093b20 |
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: qekbvmekevgdnulwgucivjkxaxoukcgscrveknjndhvl
Output:
| [
"k"
] | task1188-81b41b3a25c94e4bb546d7de7669be21 |
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: gkxvgmuhnhtinsreexrecvndihnsszpsaqpeoavi
Output:
| [
"e"
] | task1188-430f92b1b08a4a5fb78a52ff5a161422 |
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: tbdxarhissrryahvraydizopbqhoymcyikdwvewjszsv
Output:
| [
"r"
] | task1188-02c1303693234bf390cd78ec965f89fe |
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: vvbnezdtsjsrzgqluapxfgrkavghmcqovwuogqtndrbrvpv
Output:
| [
"v"
] | task1188-04df53323a74427ca26f662dfc802fc7 |
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: okvldasygwpvvduxtincxrisdvdcupnkebvbbevqecwxqutn
Output:
| [
"v"
] | task1188-da51f7da35d6470d8eb6b79a0f948992 |
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: pdeybavafjbnqexylvgrqqmlptxlsbcwgswantiv
Output:
| [
"a"
] | task1188-4dd290afe6004f5ea48d0a36d7f3e053 |
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: vgzfyrhdqhuhweetafsahumbxlduxjvkidgvpatkxnpmprjl
Output:
| [
"h"
] | task1188-2a502e33308e4f4e807312be6550e1a5 |
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: ltgwtdtejzwhkoigpoaldaehnevbicqmcfthfkhdgwqmz
Output:
| [
"h"
] | task1188-b6dcf773efe24cffba39a22596a929b1 |
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: wmtybdzopccxtvhujjzxbdmcdfznvyueafxvlhmfueqqf
Output:
| [
"f"
] | task1188-64ae3895ad484e9bbb2c0b00c099e6b7 |
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: mqwwpnsxpgpolqmungbzevqlgwgkazdyymynzldpw
Output:
| [
"g"
] | task1188-f47c3a5ccf0f41ffb39c29aa1e752f81 |
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: sgmxqncjufirpljrtqieutdntftahocydonromdxstvyuregzm
Output:
| [
"t"
] | task1188-7401954415d34e7bb23d6643423f1899 |
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: updrrbqtdjumelvetmkajpgqywrqgmcifwazcakruyqifsu
Output:
| [
"q"
] | task1188-67ad6be9a5014433b899809c6701e8e6 |
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: ocxsqfglcexfnewrnwphxpkrtygqcgwnxbpdsfloiihhpqzjjn
Output:
| [
"n"
] | task1188-d815cf52a46b454880e129ca69fef30f |
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: bhwqeimqrtaygzmlpdhpuuqfjquxjfzgnvssscimnfr
Output:
| [
"q"
] | task1188-e1cc4cc9a6174b8eb34899827156283d |
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: xkfrrlswmkxmkqycyjzdeqpxbkihtyljcbrpaqeluh
Output:
| [
"k"
] | task1188-281a2bc7c27e403586002ccbea94f32d |
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: uymejwuyuymeondlvphsdpnwfsfvefzxfxkzduzvap
Output:
| [
"f"
] | task1188-97654b8cfee244e3ad530e7266bc3ce5 |
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: alrbypyzxwbmrucrwkvkorogrzargulkjvlqqsjtxk
Output:
| [
"r"
] | task1188-9e81582dd0cd4b53a40de15ad43df2bb |
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: isxruzavsstbbilurkdsiuqwkquvftxgfajmovlvdwxxn
Output:
| [
"s"
] | task1188-264c02749cca4c81bf2c398436ad458c |
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: pyiwkixmsmjwpttgppeqcbnmquclckcwcnveuscsxqn
Output:
| [
"c"
] | task1188-417ba5d78b1a40fbb8a320b15c84bb5b |
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: iwfyozvcrbibcjwuucnokcoliqhewxpbawpewwewatkkjai
Output:
| [
"w"
] | task1188-b2ce023bfc1a478b99522ed2528b32aa |
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: nxgekghukdfdajwycepmwmdvzbhznmdpugmomyupcunjpbmee
Output:
| [
"m"
] | task1188-8e86fbcab4b3413293f6040fa4abc963 |
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: djvghjkeekbekfrplvmehzmsbgzwypjpcbsrupksylmbnnbtx
Output:
| [
"b"
] | task1188-8dc053a186124fa7823dc5efc96acf04 |
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: jfllndcpmhdtczztrbufmubisxwbercpoueqaavlyn
Output:
| [
"b"
] | task1188-1d7220230e384a56bd4189cd6115a21b |
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: jxouuboeumtrncfjlmgwcrbrxwszjeepdkcpfumdmvzm
Output:
| [
"m"
] | task1188-1604aa99045c471db6c635457899ef8f |
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: nusnjxdgvvlgusjbajvjcttxmzafkbaxwxlxzvrr
Output:
| [
"x"
] | task1188-8635bd1e82544ea4bf0dc3a91d076911 |
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: ldqjovjalafxsoeycclkocuojecdeadducxhvoafdyujgkmuni
Output:
| [
"c"
] | task1188-7069243667e748bd96c7944c4b337d34 |
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: qgbaxitnjwrvtckdraygpzqbugoirzymzauhnnwsre
Output:
| [
"r"
] | task1188-458a84befbe04bdfaca40e67583465f9 |
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: zhtdnwzgmurkydmokayynbbldqxjqbsvszfjvjtzc
Output:
| [
"z"
] | task1188-168dedf36b14401da54f8c33c405af0a |
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: rybpdrqfpcjmgdbkpktczjvcljilytjgazgzjurotbdwr
Output:
| [
"j"
] | task1188-914774c9819746448488627388003348 |
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: zghoelqhejqfxgmkhshtrmqvwmgemmkiahdxoagwsei
Output:
| [
"h"
] | task1188-ed4ac387a95043458a612c2a7be61b81 |
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: zhfgnilshblvensqokkmxjddvubpaiizjjtxowovmzjvtub
Output:
| [
"j"
] | task1188-cfa9154a62a3443b910becc3610c6605 |
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: cmmddmvdzhgjkbmeexsnarbyibagrpsbrpvgyovowvb
Output:
| [
"b"
] | task1188-f6c6eac5a3484a32b9ba218ea6ccd391 |
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: axqshzzcueooysultdpijssoivnyvapotqzjzsruewfh
Output:
| [
"s"
] | task1188-fb389fe9ef8c4d4ca790394ee30ec944 |
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: cctmhwynpzubhqwiwvhnxsussowdgvooeuvociacqsfldb
Output:
| [
"c"
] | task1188-5d5b5936fb384a74b3178db9b579dbca |
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: rbqxdfvnutjgmgwcgwzmzqdcaxhgrjiwftlepjwovmp
Output:
| [
"g"
] | task1188-0de6e4a13cfd4f6e871e3155ad335fbc |
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: lrmtaujxoxmrkxitgmrmapmwavpcrrfyononppagxvhcwot
Output:
| [
"m"
] | task1188-1c9e179e891e4e6e8adc434f9f2b768c |
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: euvrwtlfomhgaggebednbboaxolmoevqcaekhclcgdjymai
Output:
| [
"e"
] | task1188-3ac70840ac2a4e35a4ba1046d3744fff |
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: rhmihyltmblgflplwcudvlkhcaueumghibiptukbpwtv
Output:
| [
"l"
] | task1188-6da146a2d76145da95e9a3bb20b73493 |
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: jgfrxmxomvlnrzwkpbmsxgnunbpvtiyxthmaxppvmp
Output:
| [
"m"
] | task1188-60782b70f28a4df8ac75770cbf0dfd66 |
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: mckielezfprvqljpvmjuptsgikzpmusxwhldmnczyszxhiz
Output:
| [
"z"
] | task1188-6d6bd1da0a9e4e75a055e80d529d1bc3 |
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: lzhmdreduzmuglcsbragracqcqwvgswsvpfgrgptcscl
Output:
| [
"c"
] | task1188-6311cc7c21b346d68214ed005dcafa51 |
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: xltfbrkwsaatjegpavikehkjozsgqbtvjiunmfisc
Output:
| [
"a"
] | task1188-1ef4910baccc4ffeb241c5c0bfb15e1d |
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: pmrdeazqwlsicttsnzzaqiuobgcgabqkqwthmammlviwcl
Output:
| [
"a"
] | task1188-af102817f9ea46e09f8f270cf5944881 |
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: yeeqfvdsafmnmejqrkponusdssajikubtcogscxielxxi
Output:
| [
"s"
] | task1188-fba4a830b5f0484bbfc63b58155f71a2 |
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: kgycvpdmmtmwfbxoffmnnntkxckriswdlsrivjjpmiiro
Output:
| [
"m"
] | task1188-6e84e42b080543bdbd6e4a82885de288 |
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: jewgqhtmqlvvhintgttflsivatkeusjhpkurhhedjj
Output:
| [
"h"
] | task1188-235ea390daad4d75b82ef533b2e82146 |
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: nqgjeavnciiudgfyxheklkuzwscrbfigqdztrqnljwofcdvpj
Output:
| [
"c"
] | task1188-91d5e82b9b734d0baa9b392401530a49 |
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: jliehrxplclblkbtvjzbvtbtvyfzndkazdcyphxga
Output:
| [
"b"
] | task1188-b499c83b78764515955f1b3a52a0a8ea |
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: qlruedmfnygremwsgtleltuhhbomsmwogagtehtlbdpvj
Output:
| [
"e"
] | task1188-3efd9d1ba42c4baf8c6cd1c247ebce4d |
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: hwvlewesuyvclzffpxvmgkxsiifqbzdiqybtfutlktgllsfe
Output:
| [
"f"
] | task1188-98eb9dbb827e48fab5f9814aa0bb5a93 |
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: tsrmpzoddnquqxqywchyaffemtklfwrkifevcsqhnqeryioyl
Output:
| [
"q"
] | task1188-b91406dbd6294dbc963319f86d0ecbeb |
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: cuibkehgzuthxdamfywhrtoxosltxgpdvhfwubam
Output:
| [
"h"
] | task1188-1deda970f6e845ddac98a798314999f6 |
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: erxxpmalomisvcegqsizdwsvwhzdwajmdqyhhabanfpeloozv
Output:
| [
"a"
] | task1188-e7c6658d6c134fe8b834bd6286a44aa2 |
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: tcqpcfmhrnpwnccsymxrrkwwdmfrvqsrmilmcbivhl
Output:
| [
"c"
] | task1188-80e41c628a6240c0b1267414dc8eb941 |
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: fbvtigigegppmeliewlnamhimlfsggygplrmyxja
Output:
| [
"g"
] | task1188-a9eac10d814646688f1275839a5f6268 |
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: gpzbqveyqnslxmtpgzpyvjkgnckagahkbybprhzyjzmmpwwdy
Output:
| [
"p"
] | task1188-9e843fe196814222bfef875987c5f9c3 |
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: xquriasngktfmktcpfbufrzfxaeztxwmpgbdjzutpvczvqfl
Output:
| [
"f"
] | task1188-728b4d0712e14bc78c9c1b721187c7a3 |
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: raslehjckumugmcgjnhzaotawjuuanqoffcvwkluxuv
Output:
| [
"u"
] | task1188-5810154d1f1e499a977234dc1830b6e2 |
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: hbusmvtxmltzumzglmtkamuuifsmzgxuevspobjn
Output:
| [
"m"
] | task1188-3aeb52cf422344d4b2fdc9e08afaee7c |
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: zpuzvvxskaemywgiwwomzkvbclscctxetxwrfgoloznxa
Output:
| [
"w"
] | task1188-6cb65241d56445128bbe61522a4b6c2d |
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: kzvudkevobusfdjyhfcnudmghzggaottmwmhmkcosin
Output:
| [
"m"
] | task1188-56b73ed912314563a5eab8cf23a74b67 |
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: zjhpuohwfpfhoczhnlkeuldxdyrbhmdfgwjyqnqgfbme
Output:
| [
"h"
] | task1188-c90ac379e6f247ea8a7d50d35478da05 |
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: cycwycamltavkcbwmfiadcbdyriuplpkwijrtttnwtcmqm
Output:
| [
"c"
] | task1188-3846ee455a1444aa8fc3c700843ff3b8 |
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: anpavqmduzymwjxddrnjmrciwhoyknkkzdezkpnzxviel
Output:
| [
"d"
] | task1188-44708094e8e641759416c8b5b778fa94 |
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: trrucraycasrxwosxhyrposrkyugrnvxhlhdecqrlhvzq
Output:
| [
"r"
] | task1188-5988bd553fb84eb79eee405d8b69ff30 |
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: oyuodtxzpuxspsacrzdcfxvprrvtxxzkhhndanlehlqdyeyd
Output:
| [
"d"
] | task1188-16648347f8094f9d808a2241cd9daff7 |
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: nksugexplwaeontfvekhehmghmradwxhdepgkfcpqnejth
Output:
| [
"e"
] | task1188-f7e5663660284a37b0c0f92918022c21 |
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: fkwuvstdxarqkbvbxbtyxthxlofiicqlolftjiyupnfsyyfvm
Output:
| [
"f"
] | task1188-26e1e6baa29e4a48a5a0208e701bd68e |
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: ysybospaazivarvrpafkaukqawdltenlewndqjicbuwkflhyp
Output:
| [
"a"
] | task1188-cf01f33b2669454692fd7272c869de8b |
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: nqqeeaamvvxojymlvthkkmtoluroshbzbaejdbljfydfjpt
Output:
| [
"j"
] | task1188-56e2ceee36944732b846409622c81370 |
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: trkcvddvzhlxguayuafjfmqhghboxtsnfpovcehjhczajo
Output:
| [
"h"
] | task1188-961d9d9f683244c9adcbbd471dc0441d |
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: jrgbnccsqrmxpskhhdikudmfwdvuicjggqjbuuoamkyuxpfwk
Output:
| [
"u"
] | task1188-adfe466ce24d4280a5da817f6726d4b6 |
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: dkedcqbnzzsonlbwiweneuwucnoocdbwvgfllroz
Output:
| [
"n"
] | task1188-01b0ad86cd7c45bab87d65ead6eb9926 |
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: milhjttsvihcbjqausazkuorurjjyahcowbspdzjszaagpqsm
Output:
| [
"a"
] | task1188-03e7a3040311402d8381ea80d150858d |
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: hbzhtwvhyokqvhihgwfhwpogehfoenbbwyqxdmlb
Output:
| [
"h"
] | task1188-e160d06d2da6491cb7dcdc72d2f54d81 |
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: hlkdrvgmoezdqqhrlqknzxspystcayvexjwbifct
Output:
| [
"q"
] | task1188-e00d27b7cdbb4581818f28fb1fe37ca7 |
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: igdzjgvfyrjnqqxqquxldnnpvnsvtkvkwbgjpyhiyntlyj
Output:
| [
"n"
] | task1188-d43e6797ec7442a9aade120ea999fee1 |
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: taahdgwtmevwsyqiqenpbkyrawszhatvgjejyggvqhcyvoubvm
Output:
| [
"v"
] | task1188-38530f31645144369795d1a5d49b2695 |
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: vqzxyzparjbmlduimpvfiwenoawdyfddisetbhnqjdtxrgrc
Output:
| [
"d"
] | task1188-73579bc57818454fa1f330df50f1016d |
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: sgcufjyyvimzywkzzyokzodqgkeoyllkarjkwsux
Output:
| [
"k"
] | task1188-604873e62ee24605b8146f8eac3e69b8 |
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: nuknqixgdcshaxefykhnwgurxgycnyplscyuqdtvo
Output:
| [
"n"
] | task1188-bf299d9776f04ce0bf20b351aa6c88de |
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: yypvxistmjzuqxcnzvegzwjymdiuwxkodzorjcsb
Output:
| [
"z"
] | task1188-880f5619f9764b24a11d1599a8fa8b67 |
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: woifqncfzlisvobbxcymxpuecvpvlxabedqhpufjntctcagok
Output:
| [
"c"
] | task1188-c7ff08ef83e143e5bee16592de43cc91 |
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: twpjuehwlcifxafvtcoowhkrbgyawkdakulwizsml
Output:
| [
"w"
] | task1188-b9c78ed3d28f405bb29ab21e864a6eab |
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: yoayeseefydvrsdtlnpydhucvceiumdbzxuxstco
Output:
| [
"d"
] | task1188-88c779e245cd4849a68ae091fe632e3e |
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: eplymvxiqrdpsvllkduyfuqhccgkwxhezwrrxtpjvxcct
Output:
| [
"c"
] | task1188-94c6751d7f4b4ba596c02aa1b1045e89 |
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: hmjmknpbsdqxompyurvqdqcgnnipimborotzwzpiknxguosf
Output:
| [
"m"
] | task1188-ef5ba53a7524467ca1040b9bc86138ba |
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: ayxpvzgumiodmlesoypsftszajjehczbhvicmuftomojhzufr
Output:
| [
"m"
] | task1188-0c8cdeeaed504ed496da33f45b30819b |
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: jjnzbwzdkdhisxiygonxgldsofalmrvxlxxyaxemvq
Output:
| [
"x"
] | task1188-d867201800e7464485cf3e46516bee72 |
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: mdtpsgqrobpbktbthwbbchevbcivcjfkcgnypvktmuqowxruro
Output:
| [
"b"
] | task1188-ae421a2da6c9440982b7846813c70414 |
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: tzrraklcaztmvloaykewzxzkxjnpnotqkjnbxxfuslup
Output:
| [
"k"
] | task1188-9e2fcf490f2541f3b3cee8665da8353a |
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: uqeqxszoxpcoqhndqkwligiqgttjdtsozeytatnukwp
Output:
| [
"q"
] | task1188-0948a53976ba4d4bbe8956278e4a8780 |
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: puskjsguudzymxqxqiedlpwnzybvkvdklnqgttjklwc
Output:
| [
"k"
] | task1188-c0a126f955954942b4049f319a8e53fd |
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: sexbnsakynuwphmdznxgdbmrrbxhxyjjtewqdsztxtflg
Output:
| [
"x"
] | task1188-26c5a106f8d9425e9e6b6459c5899827 |
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: hprhtoxcjievhoujtqganqmdczxdrpzrgajdellsfxv
Output:
| [
"d"
] | task1188-b23f4e2969464ad2a415373f2ac95147 |
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: alosztnshbvvceedhuwqpghouvnnmimtbprhkudf
Output:
| [
"h"
] | task1188-66541e7f73bb4a87babf4dbc7e28aee1 |
Subsets and Splits