inputs stringlengths 274 529 | targets stringclasses 109
values | _template_idx int64 0 9 | _task_source stringclasses 1
value | _task_name stringclasses 1
value | _template_type stringclasses 2
values |
|---|---|---|---|---|---|
Given the task definition, example input & output, solve the new input case.
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.
Example: m... | h | 1 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example output: d
Example exp... | b | 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
[EX Q]: bawruvraibtywxylqnsvyzatlygcctlsknmfarifvwhbd
[EX A]: a
[EX Q]: fqhihmuozpfmk... | h
| 6 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example solution: d
Example explanat... | Solution: s | 5 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Input: Consider Input: gkxvgmuhnhtinsreexrecvndihnsszpsaqpeoavi
Output: e
Input: Co... | Output: s
| 2 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
--------
Question: bjodsiemdaxikjtmbmogtfhqjdvtdeldlxxgxxsbmz
Answer: d
Question: rb... | s
| 7 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example solution: d
Example explanat... | Solution: g | 5 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example output: d
Example exp... | o | 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Q: wmuldccdgdjbjikalbaewipuogkorkyhuhwtnhdfqgh
A: d
****
Q: xquriasngktfmktcpfbufrzfx... | o
****
| 4 | NIv2 | task1188_count_max_freq_char | fs_opt |
Given the task definition, example input & output, solve the new input case.
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.
Example: m... | p | 1 | NIv2 | task1188_count_max_freq_char | fs_opt |
Teacher: 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.
Teacher: Now, understand the problem? If you are still confused, see the follo... | z | 2 | NIv2 | task1188_count_max_freq_char | fs_opt |
Given the task definition, example input & output, solve the new input case.
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.
Example: m... | x | 1 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Input: Consider Input: hbusmvtxmltzumzglmtkamuuifsmzgxuevspobjn
Output: m
Input: Co... | Output: a
| 2 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example solution: d
Example explanat... | Solution: e | 5 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example output: d
Example exp... | z | 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
Detailed Instructions: 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.
See one example below:
Problem: mvwduljootadondrwbrledodqnmfqtxa... | d | 4 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
[Q]: twpjuehwlcifxafvtcoowhkrbgyawkdakulwizsml
[A]: w
[Q]: yoayeseefydvrsdtlnpydhucv... | q
| 5 | NIv2 | task1188_count_max_freq_char | fs_opt |
TASK 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.
PROBLEM: uqeqxszoxpcoqhndqkwligiqgttjdtsozeytatnukwp
SOLUTION: q
PRO... | b
| 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
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 char... | x | 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
Given the task definition, example input & output, solve the new input case.
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.
Example: m... | t | 1 | NIv2 | task1188_count_max_freq_char | fs_opt |
Teacher: 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.
Teacher: Now, understand the problem? If you are still confused, see the follo... | h | 2 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
[Q]: xyeidipovvrzxaycqdaabrfsxxtffzlkyzuglgsjqugsl
[A]: x
[Q]: qdzwmebntqhpmmyctoiez... | h
| 5 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example solution: d
Example explanat... | Solution: s | 5 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
[Q]: axqshzzcueooysultdpijssoivnyvapotqzjzsruewfh
[A]: s
[Q]: tolnocupsjrgutkmmcspkh... | d
| 5 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example output: d
Example exp... | r | 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
TASK 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.
PROBLEM: tolnocupsjrgutkmmcspkhsogilrbfgyktlfmjsg
SOLUTION: g
PROBLE... | r
| 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
rguadowvzfqlktkljtojlzxicbihwzkfktobkxcv
k
eszudurddbdbvvgnuebijuyswglflxnbxnqmskolmo... | k
| 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
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 char... | c | 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
Part 1. 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.
Part 2. Example
mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Answer: d
... | n | 7 | NIv2 | task1188_count_max_freq_char | fs_opt |
TASK 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.
PROBLEM: pdeybavafjbnqexylvgrqqmlptxlsbcwgswantiv
SOLUTION: a
PROBLE... | h
| 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Ex Input:
krzesomikagodqthmvoecdqqamqjwadcurjtkwytqc
Ex Output:
q
Ex Input:
vdsonxd... | x
| 1 | NIv2 | task1188_count_max_freq_char | fs_opt |
TASK 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.
PROBLEM: fqhihmuozpfmkhlmdsxqktvneazrigmuufvlseytffvoi
SOLUTION: f
P... | m
| 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Let me give you an example: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
The answer to th... | t | 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Ex Input:
qgbaxitnjwrvtckdraygpzqbugoirzymzauhnnwsre
Ex Output:
r
Ex Input:
zgqschn... | v
| 1 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example output: d
Example exp... | q | 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
Given the task definition, example input & output, solve the new input case.
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.
Example: m... | n | 1 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Input: Consider Input: sgcufjyyvimzywkzzyokzodqgkeoyllkarjkwsux
Output: k
Input: Co... | Output: n
| 2 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Let me give you an example: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
The answer to th... | b | 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
Given the task definition, example input & output, solve the new input case.
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.
Example: m... | x | 1 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
[Q]: woifqncfzlisvobbxcymxpuecvpvlxabedqhpufjntctcagok
[A]: c
[Q]: mklyresggayepwfml... | x
| 5 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
uymejwuyuymeondlvphsdpnwfsfvefzxfxkzduzvap
f
rybpdrqfpcjmgdbkpktczjvcljilytjgazgzjuro... | p
| 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
TASK 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.
PROBLEM: trkcvddvzhlxguayuafjfmqhghboxtsnfpovcehjhczajo
SOLUTION: h
... | g
| 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
Part 1. 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.
Part 2. Example
mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Answer: d
... | s | 7 | NIv2 | task1188_count_max_freq_char | fs_opt |
Part 1. 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.
Part 2. Example
mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Answer: d
... | u | 7 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example output: d
Example exp... | o | 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
[Q]: adfuaeqlkiofguplnmognamabrifkhktmvukqjypjftftzwbv
[A]: f
[Q]: pdeybavafjbnqexyl... | y
| 5 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example output: d
Example exp... | c | 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
--------
Question: okvldasygwpvvduxtincxrisdvdcupnkebvbbevqecwxqutn
Answer: v
Questi... | x
| 7 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Input: Consider Input: gwrrvxaiuyuxxhtmbmjwkrhzytcbtzdgppusmlxlsc
Output: x
Input: ... | Output: b
| 2 | NIv2 | task1188_count_max_freq_char | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
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 char... | c | 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Q: nuknqixgdcshaxefykhnwgurxgycnyplscyuqdtvo
A: n
****
Q: tazddairsngqiuwcrutuudobgry... | e
****
| 4 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Q: tcqpcfmhrnpwnccsymxrrkwwdmfrvqsrmilmcbivhl
A: c
****
Q: ocxsqfglcexfnewrnwphxpkrty... | w
****
| 4 | NIv2 | task1188_count_max_freq_char | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
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 char... | q | 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
Part 1. 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.
Part 2. Example
mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Answer: d
... | b | 7 | NIv2 | task1188_count_max_freq_char | fs_opt |
instruction:
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.
question:
hprhtoxcjievhoujtqganqmdczxdrpzrgajdellsfxv
answer:
d
question... | c
| 9 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example output: d
Example exp... | n | 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
fqhihmuozpfmkhlmdsxqktvneazrigmuufvlseytffvoi
f
wmtybdzopccxtvhujjzxbdmcdfznvyueafxvl... | l
| 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Input: Consider Input: xnrtwigxztfoaouxurhsenvfutgcojeavcuvobcolluvjukiye
Output: u
... | Output: t
| 2 | NIv2 | task1188_count_max_freq_char | fs_opt |
TASK 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.
PROBLEM: bawruvraibtywxylqnsvyzatlygcctlsknmfarifvwhbd
SOLUTION: a
P... | c
| 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
Given the task definition, example input & output, solve the new input case.
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.
Example: m... | k | 1 | NIv2 | task1188_count_max_freq_char | fs_opt |
Teacher: 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.
Teacher: Now, understand the problem? If you are still confused, see the follo... | b | 2 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example Input: xvxihgtxoillbmjsnwczdopdinsawrgedvjszoutpogrknltt
Example Output: o
Ex... | b
| 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
meaftnetnciykgvdbtaijurggpelbwrbgxgqskwvjvxcrvghl
g
alosztnshbvvceedhuwqpghouvnnmimtb... | i
| 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
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 char... | c | 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
Part 1. 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.
Part 2. Example
mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Answer: d
... | n | 7 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
[Q]: bcaupmhhjmizfywxbobwudtmmwelxtftdnrjpffmpsw
[A]: m
[Q]: gwdtxujzxtlgcbbxiuibqxf... | z
| 5 | NIv2 | task1188_count_max_freq_char | fs_opt |
instruction:
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.
question:
ytxagjoultzwuyuhflpslxkddfgacjsjgghkntohmztpkossu
answer:
g
qu... | m
| 9 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
djewugnkbetbbhpfjteixkncklpqxkqtoltmtfxdjfelz
t
zgqschnugdvzrnwrsnrcdrexyrgqhptcaqvqa... | v
| 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example Input: jxouuboeumtrncfjlmgwcrbrxwszjeepdkcpfumdmvzm
Example Output: m
Example... | x
| 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Q: lzhmdreduzmuglcsbragracqcqwvgswsvpfgrgptcscl
A: c
****
Q: svplpmqecpkpsovlluundiev... | d
****
| 4 | NIv2 | task1188_count_max_freq_char | fs_opt |
Teacher: 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.
Teacher: Now, understand the problem? If you are still confused, see the follo... | f | 2 | NIv2 | task1188_count_max_freq_char | fs_opt |
TASK 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.
PROBLEM: zgqschnugdvzrnwrsnrcdrexyrgqhptcaqvqattfkyqcbskmv
SOLUTION: ... | f
| 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
Given the task definition, example input & output, solve the new input case.
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.
Example: m... | s | 1 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
hprhtoxcjievhoujtqganqmdczxdrpzrgajdellsfxv
d
lcjirhialnxhcfdlegeenjrkassvaglcvbpaczv... | s
| 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Input: Consider Input: euvrwtlfomhgaggebednbboaxolmoevqcaekhclcgdjymai
Output: e
In... | Output: n
| 2 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
[Q]: gkxvgmuhnhtinsreexrecvndihnsszpsaqpeoavi
[A]: e
[Q]: kgycvpdmmtmwfbxoffmnnntkxc... | q
| 5 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Ex Input:
svplpmqecpkpsovlluundievqprydthpooonwfkkypxzf
Ex Output:
p
Ex Input:
iufx... | a
| 1 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
jmjwiaupypmqqlrryzrqvpvmwvbfgpgzcpjmbnqnrilayzkhv
p
jmnbeigdsofvakelmndnocikpqsyuusnh... | l
| 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
instruction:
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.
question:
cctmhwynpzubhqwiwvhnxsussowdgvooeuvociacqsfldb
answer:
c
quest... | f
| 9 | NIv2 | task1188_count_max_freq_char | fs_opt |
Detailed Instructions: 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.
See one example below:
Problem: mvwduljootadondrwbrledodqnmfqtxa... | m | 4 | NIv2 | task1188_count_max_freq_char | fs_opt |
Detailed Instructions: 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.
See one example below:
Problem: mvwduljootadondrwbrledodqnmfqtxa... | t | 4 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
One example is below.
Q: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
A: d
Rationale: d is... | q | 9 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
[Q]: trrucraycasrxwosxhyrposrkyugrnvxhlhdecqrlhvzq
[A]: r
[Q]: fpsmydaqpwzonavgwzjlp... | c
| 5 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Let me give you an example: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
The answer to th... | m | 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Let me give you an example: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
The answer to th... | f | 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
TASK 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.
PROBLEM: mklyresggayepwfmlruxqjphgrqvtgnrtnwisoryxwmz
SOLUTION: r
PR... | m
| 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example Input: uqeqxszoxpcoqhndqkwligiqgttjdtsozeytatnukwp
Example Output: q
Example ... | f
| 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
Part 1. 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.
Part 2. Example
mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Answer: d
... | s | 7 | NIv2 | task1188_count_max_freq_char | fs_opt |
TASK 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.
PROBLEM: usnxshlksjfzwaggwgmnddpcpkfhwgarulcajpjyutxpdryf
SOLUTION: g... | s
| 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
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 char... | p | 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
TASK 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.
PROBLEM: nusnjxdgvvlgusjbajvjcttxmzafkbaxwxlxzvrr
SOLUTION: x
PROBLE... | a
| 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Ex Input:
ldqjovjalafxsoeycclkocuojecdeadducxhvoafdyujgkmuni
Ex Output:
c
Ex Input:... | d
| 1 | NIv2 | task1188_count_max_freq_char | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
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 char... | n | 0 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Let me give you an example: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
The answer to th... | i | 8 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example input: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
Example output: d
Example exp... | q | 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
Detailed Instructions: 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.
See one example below:
Problem: mvwduljootadondrwbrledodqnmfqtxa... | f | 4 | NIv2 | task1188_count_max_freq_char | fs_opt |
instruction:
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.
question:
hrhqxxztxgbndnuwnzbcrgdjymqglmwhypwexybhxqrnold
answer:
x
ques... | m
| 9 | NIv2 | task1188_count_max_freq_char | fs_opt |
Detailed Instructions: 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.
See one example below:
Problem: mvwduljootadondrwbrledodqnmfqtxa... | d | 4 | NIv2 | task1188_count_max_freq_char | fs_opt |
Teacher: 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.
Teacher: Now, understand the problem? If you are still confused, see the follo... | m | 2 | NIv2 | task1188_count_max_freq_char | fs_opt |
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.
Example Input: qrtxfgulbvkhteefsvubsjlobwtfggvfssayhibsn
Example Output: s
Example In... | m
| 3 | NIv2 | task1188_count_max_freq_char | fs_opt |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 3