input
stringlengths 650
955
| output
sequencelengths 1
1
| id
stringlengths 40
40
|
|---|---|---|
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['e', '7097', 'm', '6969', 'w', 's', 's', '2135']
Output:
| [
"e, m, s, w"
] | task636-4b0fab0c58c24c6b949d1c57a1140c84 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['7841', '2755', '8709', '1715', 'e', 'd', '6523', '6975', 'h', 's', 'x', 'k', '9837', 'u', 's', '3485', 'v', '6063', '611', '8037', '5201', 'j', '4405']
Output:
| [
"d, e, h, j, k, s, u, v, x"
] | task636-b405487dc99d4574952dbce7f1506a34 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['d', 'l', '2071', 'x', '2147', 'q', 'q', 't', 'm']
Output:
| [
"d, l, m, q, t, x"
] | task636-e221f42cab3a4e1fbc176df74030d17b |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['x', 'o', '8161', 's', '3653', 'v', 'c', 'e', '5353', 'h', '9145', '333', 's', '7689', '8277', 'a', 'o', 'h', 'z', 'w', '9297', 'w', '9383', '8963', 'k', 'x', 's', 'w', 'h', 'j', '5737', 'o', '2247', '3723', '2043', '4615']
Output:
| [
"a, c, e, h, j, k, o, s, v, w, x, z"
] | task636-0e198ab6f0bd4152a537e8db26cb74cb |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['f', '901', '8505', '6325', '6667', 'v', 'h', 't', 'p', '8237', 'w', 'k', '3935', '9527', 'x', 'n', '73', '8559', '7017', 'r', '3983', 'f', '4287', 'g', '7595', '3615', '675', '3445', '75', '79', 'd', '2739', '7795', '5857', 'o', 's', '9171', '279', '4691', '9533', 't']
Output:
| [
"d, f, g, h, k, n, o, p, r, s, t, v, w, x"
] | task636-100448f31c884e009c4c07e217955b77 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['8071', 'i', '8691', '9873', 'z', '4753', 'y', '2035', 'x', '6587', '5657', 'j']
Output:
| [
"i, j, x, y, z"
] | task636-eb1bf0c1aec64ad3a8ab6cc5325dcbfa |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['5391', '7605', 'k', 'c']
Output:
| [
"c, k"
] | task636-0b971b37bfab4c8a86dc0790725da471 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['p', 'h', '8289', '2479', '7443', '9587']
Output:
| [
"h, p"
] | task636-bd825eb2d5ff4dc491efcad3f3d503ed |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['6973', '8727', '1831', '6437', 'o', 'f', '5457', '9387', '5201', '7619', 'm', '5767', 'r', 'h', 'y', 't', '4043', '2241', '579', '7747', '6915', 't', '5375', 'e', 't']
Output:
| [
"e, f, h, m, o, r, t, y"
] | task636-df0fc546ae814775a57f1f8516feb1ec |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['h', '1545', '4977', '9731', 'x', '8729', '8875', '5793', '3411']
Output:
| [
"h, x"
] | task636-194409f18bfe48d4a5a5ba86f248d488 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['j', 'u', '1765']
Output:
| [
"j, u"
] | task636-87eaadd9594849cabdd4f28f8dbe8c26 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['7197', '5719', 'm', '3647', 'v', 'o', '7869', 'p', '5031', '8783', 'u', '6559', '2681', '635', '5941', '581', '1211', 'j', 'q', 'm', 'e', 'l', '8941', '6729', '6045', 'f', '7981', 'm', '4011', '2669', 'v', '5603', '3355', '5239', 'm', 'f']
Output:
| [
"e, f, j, l, m, o, p, q, u, v"
] | task636-4c4cea8e456a4e418425a44a9c441af8 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['z', 'n', 'x', '9327', 'o', '2445', '2265', 'v', '2413', 'c', '5407', 's', 'g', '153', '2813', '2845', 'd', '5853', '9669', '9485', '9561', 'i', 's', '6163', '2753', '3047', 'k', 'f', '6571', '8345', '8005', '7137', '7733', 'n', 't', '4817', 'r', 'g', '2001', '2945', '289', 'f']
Output:
| [
"c, d, f, g, i, k, n, o, r, s, t, v, x, z"
] | task636-afd28c0d842141e2a6bdbf9def2de2bd |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['b', 'a', '7411', '4471', 'z', 'l', '2051', 'q', '6749', '8647', 's', 'y', 'h', '9319', 'e', '5419', 'y', 'q']
Output:
| [
"a, b, e, h, l, q, s, y, z"
] | task636-f793ba3908464af697efb23923f0b947 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['3405', '2361', 'u', 'b', 'a', 'z', 'e', '1253', '1663', 'u', '5533', 'h', 'z', 'o', '6455', '6995', 'w', '5127', '5493', 's', 'o', 'v', '6127', '6565', 'o', 'd', '3437', 'p', 'a', '387', 'r', '9621']
Output:
| [
"a, b, d, e, h, o, p, r, s, u, v, w, z"
] | task636-190e3398b58741e78e4cc7fde6dc2b7e |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['x', 'y', '7963', 'b', 'e', 'r', 'z']
Output:
| [
"b, e, r, x, y, z"
] | task636-80111543bc8449d1b203ea6e8851b8f3 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['s', '6779', 'w', 'k', 'v', 'j', 'u', 'z', 'l', 'y', '5873', 'i', 'j', 'g', 's', 'f', 'd', 'l', 'e', '3617', '3181', 'w', 'z', '6565', '8331', 'a', 'm', 'x', 'j', 'j', '8401']
Output:
| [
"a, d, e, f, g, i, j, k, l, m, s, u, v, w, x, y, z"
] | task636-d6d6acf117bf4f068c71c131fadfe2c1 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['2911', '2421', 'g', '4781', 'k', 'v', 'n', 'k', '4139', '9469', '5943', '3231', 'y', 'e', 'a', 'n', '3421']
Output:
| [
"a, e, g, k, n, v, y"
] | task636-b39fa00585294263bd76f9433f20b398 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['k', '3617', '4435', '1497', '4535', '5263', '1315', 'g', '8205', 'f', 'v', '2659', '7603', 'f', 's', 's', '6583', 'x', '8947', 's', 'b', 'i', 'n', 'i', 'n', '7131', '3343', 'q', 'j', '5871', 'l', 'j', 'a', '2975', 'f', '1219', '2913', '5565']
Output:
| [
"a, b, f, g, i, j, k, l, n, q, s, v, x"
] | task636-53e43a1b41774771b627ed61de869055 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['r', 'i', 'd', 's', 'b', 'z', 'y']
Output:
| [
"b, d, i, r, s, y, z"
] | task636-d7fc1e2b4cd5440bbafbd45100f3ea21 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['7711', 'l', 'i', '1545', 'j', 'x', '6697', '9411', 'p', '2733', 'l', '2631', '1313', 'g', '2459', '1085', 's', 'n', 'x', '3565', '3695', 'q', '6767', 'f', '4251', 'n', 'e', '8515', 'v', '1259', 'd', '2653', '7055', '7391', '9257', 'e', '8585', '8981', 'w', '4449', '773']
Output:
| [
"d, e, f, g, i, j, l, n, p, q, s, v, w, x"
] | task636-28b98ea4a9544684b98ec5e9c6a279d6 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['9307', 'i', 'c', 'y', '6219', '251', '7345', '3023', 'j', '5719', 'c', 'q', 'i', 'o', '4027']
Output:
| [
"c, i, j, o, q, y"
] | task636-e1a72ad086b9496887d184c6310bc5b5 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['n', '1809', '6789', 'm', 'p', 'i', 'u', '2829', 'f', '7145', '3003', 'a', 't', '2625', '8781', 's', 's', '7245', 'e', '7081', '5593', 'c', 'z', '473', 'x', '3201', 'l', '5321', '2007', '4671', 'i', '3193', '4529', 'd', '1277', '2935', 'f', 'a', 'u', 'a', '215', '9091', 'j', '2535', '5343']
Output:
| [
"a, c, d, e, f, i, j, l, m, n, p, s, t, u, x, z"
] | task636-d6545b8ded104b22bcf73ad748919eb0 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['6433', 'u', 'd', '9083', 't', '7641', 'a', 'r', 's', '6003', 'z', 'n', 'n', '7621', 'u']
Output:
| [
"a, d, n, r, s, t, u, z"
] | task636-f330c94ba8b3401fa2cced3affc2c336 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['p', '7493', 'a', '7437', '1025', '7183', '9417', '9809', 'b', '7161', 'z', '635', '3039', 'd', 'p', 'r', '9045', 'a', 'f', 'j', 'y', '6335', '2879', 'x']
Output:
| [
"a, b, d, f, j, p, r, x, y, z"
] | task636-946bd1d48f1242b68079941b35aedbc5 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['5857', '6721', 't', 'm', '3129', 'c', '7183', 'v', 'l', '7393', '6947']
Output:
| [
"c, l, m, t, v"
] | task636-26b92ca46e0d41c680c175e46fb772b4 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['k', 'l', '6901', 'm', '95', '4045', '6369', '2713', 'n', '5871', 's', '6307', '7887', 'v', 'v', '995', 'q', 'd', '1657', 'k']
Output:
| [
"d, k, l, m, n, q, s, v"
] | task636-c1221983bc64484bb71471e6cb202312 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['2261', '6465', '783', 'm', '3111', '5455', '4415', 'a', 's', 'v', 'h', 'd', 'm', 'h', 'y', 't', 'k', 'h', '877', '8665', '2595', '3065', 'g', '9', 'c']
Output:
| [
"a, c, d, g, h, k, m, s, t, v, y"
] | task636-942a0e65da3442a2bab40c8b3ff55bd1 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['h', 'q', '6941', 'e', '2661', '223', 'c', '3369', 'm', '7963', 'p', 'l', 'k', 'd', '6041', 'w', 'z', '5231', '9033', '3909', '5019']
Output:
| [
"c, d, e, h, k, l, m, p, q, w, z"
] | task636-57852f3e324243249b3ebb24baccc2ac |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['581', 'h', 'b', 'n', '3973', '9289']
Output:
| [
"b, h, n"
] | task636-3ef726b0876242ef9af1521866194cf8 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['g', 'd', '3539', '2487', '9523', '3067', 'f', '4863', 'q', 'n', '9863', '1643', '9285', 'n', 'q', 'g', '1841', '8307', 'b', '391', 's', 's', 'j']
Output:
| [
"b, d, f, g, j, n, q, s"
] | task636-0eeaf4971be24138b05e93c40fea6a92 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['305', '95', 'e', 'q', 'e', '341', 'u', 'w', '5911', '6851', 's', 'u', '2355', 'd', '4151', 'w', '4421', '1129', '8065', 'k', 'q', '3649']
Output:
| [
"d, e, k, q, s, u, w"
] | task636-ab0f50b969bd4acbaa88200d0883ba91 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['797', 'y', 's', 'i', '4591', 'm', 'f', '6223', '2789', '2857', '6661', 'x', '3993', '8969', '8045', 'r', '9255', 'z', 's', 'r', 'i', 'a', '6635', '7089']
Output:
| [
"a, f, i, m, r, s, x, y, z"
] | task636-24080b0f5d2945b2b05f6b4879dba4ae |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['b', 'n']
Output:
| [
"b, n"
] | task636-380dd59edabd4c68b563d36a4a13a6a6 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['4487', 'y', '1185', '2961', '2525', '9719', 't', 'n', '399', 'w', '2195', 'm', '9233']
Output:
| [
"m, n, t, w, y"
] | task636-1c219eb60db04bd59228b98ef9c26e01 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['r', '2291', 'q', 'e', '8629', '7239', '5277', '7031', 'x']
Output:
| [
"e, q, r, x"
] | task636-9cd012ebc7f44985bd2a38215f621e09 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['h', 'e', '7883', '6985', '6499', '8943', '3487', 'x', '7091', 'w', '2753', 'g', '7249', '5641', 'h', '9701', 'z', '4749', '5609', '1283', 'a', '7649', 's', 'z', '6883', '1757', '2849']
Output:
| [
"a, e, g, h, s, w, x, z"
] | task636-4938687f31f04fa0a76873d4cf5cae5f |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['8779', 'z', '5569', '9825', '6939', 's', 'e', 'n', 'a', 'm', '333', 'u', '3521', '3369', 'k', '7263', '7745', '5509', '6039', '663', 'z', '4727', 'n', '4509', '8215', '7181', 'e', 'w', 'b', '8607']
Output:
| [
"a, b, e, k, m, n, s, u, w, z"
] | task636-789bfe5667184600a469034d28ec88e5 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['s', 't', '7935', '691', 'd', 'z', '3277', 'i', 'q', '7669', 'b', '4973', 'h', '4853', '2687', 's', 'q', '9311', 'q']
Output:
| [
"b, d, h, i, q, s, t, z"
] | task636-9fa5c50d05a44b2a8e6c546eaf2766e6 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['n', '7115', 'd', '7875', 'u', '9313', '699', 'i', '4991', 'x', 'i', '7089', '4617', '689', 't', '4845', '7327', 'k', '5727', '4175', 'q', '4093', 'e', 'a', '7465', 'o', '335', '9485', 'p', 'c', 'g', '7343', '5485', '409', '161']
Output:
| [
"a, c, d, e, g, i, k, n, o, p, q, t, u, x"
] | task636-e36c534133e949749f89afd97867bf7c |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['7585', '4849', 'd', '6971', 'q', '9269', 'h', '3347', 'k', 'n', 'j', '6491', 'a', '3031', 'x', '3517', 'b', 'c', 'h', 'i', '1469', 't', '7451', 'b', 'u', '3419', 't', '3783', '3715', '2545', 'i', 'p', 'z', '441', 'f', '5335', '2495']
Output:
| [
"a, b, c, d, f, h, i, j, k, n, p, q, t, u, x, z"
] | task636-3384981924bc4b21a865e8acc2afcf8c |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['1297', '8999', 'm', 'z', 't', 'x', 's', '8581', '4927', 'w', '5401', 'c', 'q', 'g', '3239', '527', 'y', '719', '7111', 'g', '4079', 'b', '1907', 'a', '1137', 'w', '741', 'k', 'c', 'j', '4783', 'b', 'o', 'i', 'x', 'l', '3663', 'u', '8121', '977', 'z', '6811', '6229']
Output:
| [
"a, b, c, g, i, j, k, l, m, o, q, s, t, u, w, x, y, z"
] | task636-89aa75dc6f9944fa9c3f3f28f837f5b0 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['f', 'w', 'g', 'w', '4497', 'k', 'e', 'p', '6267', '6765', '6449', 'd', 'c', 'c', '2843', 't', '7603', 'f', 'y', '1249', 'o', 'r', '3677', 'k', '55', 's', '3185', '3475', 'f', 'y', '7285', 'y']
Output:
| [
"c, d, e, f, g, k, o, p, r, s, t, w, y"
] | task636-3cbf8eb69ddb4adcb3535bd37277e597 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['m', '4779', '5781', '8005', 'p', 'b', 'g', '6269', '7749', 'w', '1229', '4649', '6961', '5269', '2269', '9059', '8383', '677', 'l', '2833', '5953', 'q', 'e', '4969', 'l', 'i', '1405', 'b', 'j', '6037', '9957', 'b']
Output:
| [
"b, e, g, i, j, l, m, p, q, w"
] | task636-b2d9746c8ba14c80af6258897e489df6 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['9635', 'g', 's', '2665', '4647', 'q', '6887', '7943', 'g', 'k', 'n', '7063', '3077', '2691', '6781']
Output:
| [
"g, k, n, q, s"
] | task636-6ed12d7eaa1d4fa284d5f1d69974befe |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['6491', 'w', '7051', 'v', '7809', '1567', 'h', 't', '1411', 'l', 'x', '9677', '8367', 'v', '7293', '9977', '8709', 'q', '6067', 'k', '699', 'r', 'd', '71', 'd', 'f', '995']
Output:
| [
"d, f, h, k, l, q, r, t, v, w, x"
] | task636-8bed7992e52e427ab59ac87342548784 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['3841', '5137', '8311', 'x', '6047', 'c', '8743', 'c', '8959', '5479', 'n', 'a', 'x', '105', '8007', '6585', '9963', '5349', '4273', 'a', '1075', '6553', '7131', 'k', '9867', '1079', 'x', '6801', 'l', 'p', 'm', 't', '4389', '5885', 'l', 'b', 'x', '3807', '5933', '3691', 'u']
Output:
| [
"a, b, c, k, l, m, n, p, t, u, x"
] | task636-ce751a37a00a45c1a43d316121d3edae |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['j', 'c', 'b', '8595', '4147', 'l', 'n', 'l', '1963', 'm', '249', 'h', '4033', '4233', '4375', 'z', '3319', 'x', '6329', 'm', 'f', '7423', 'g']
Output:
| [
"b, c, f, g, h, j, l, m, n, x, z"
] | task636-652f68b0f45f446c87d41b6b5e15dee3 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['v', 'h', '5537', '8185', '4771', '4723', 'i', '1715', '387', 'w', '4475', '1963', '8121', 'z', 'c']
Output:
| [
"c, h, i, v, w, z"
] | task636-e6db3b10269144bcadcd4e23076f977c |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['959', 'o', 'f', '2557', '1603', 'g', 'k', '4961', '2925', 'v', 'm', '7', '3793', 'a', '5485', 'v', '4583', '627', '6493', 'l', 's', 'i', 'f', 't', '1201', 'z', 'q', 'w', '8339', '3157', 'p', '2331', '9615', 'e', 's']
Output:
| [
"a, e, f, g, i, k, l, m, o, p, q, s, t, v, w, z"
] | task636-6c11a3ba267d433f981a5fcc9c077768 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['t', 'k', '5697', '5773', 's', '9413', 'u', 'd', 'h', '2827', 'n', 'k', '577', 'y', '3249', '4035', 'v', '2335', 'v', 'x', '3355', '8641', 'a', '4947', '617', '9245', 'o', '6357', 'c', 'x', 's', '889']
Output:
| [
"a, c, d, h, k, n, o, s, t, u, v, x, y"
] | task636-34874c0b236c42d0b9c55902981ace91 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['r', '1525', '9707', '2685', 'm', '751', 'a', 't', 'j', '1983', '1783', '4541', '9919', 'o', '2943', '8045', '6655', '7529', '6317', '4017', 'i', 'u', 'p', '2239']
Output:
| [
"a, i, j, m, o, p, r, t, u"
] | task636-90d9a4b8343946048638904ba4c70541 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['3439', '8331', 'n', '5107', 'b', 'o', 'y', '8371', '965', 'p', 'j', 'g', '8073', 'l', 'y', '7327', '5211', '4897', 'i', '1375', '2007', '863', 's', '8489', '831', 'y', '1803', 'd', 'r', 'j', 'r', 'h', 'z', '5743', '9865', 'a', '2929', '5097', 'p', '4193', '7033', '4507', 't', '3323']
Output:
| [
"a, b, d, g, h, i, j, l, n, o, p, r, s, t, y, z"
] | task636-d351fefc3a9540da9590388d6b06611c |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['d', 'y', 'q', 'p', '8797', 'h', 'h', 'm', 'p', '9223', 'b', 'd', 't', 'q', 'g', 'k', 'd', '5657', '2415', 'r', 'p', '8683', 'h', 'u', 'j', 'e', '4933', 'c', '865']
Output:
| [
"b, c, d, e, g, h, j, k, m, p, q, r, t, u, y"
] | task636-8cbaac6c88cb43deb7c283f4c73e90ec |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['5615', '7879', 'k', 'v', '5529', 's', 'a', 'a', '477', 'u', 'm', '5623', '3837', 'q', '6807', '7545', 'g', '4299', '1667', 'm', '979', 'w', 'z', 'h', 'z', 'p', 'f', 'v']
Output:
| [
"a, f, g, h, k, m, p, q, s, u, v, w, z"
] | task636-3642c704982a43708df3199c7c2c7674 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['6137', '7743', 'b', '1073', 'z', 'm', '8659', '811', '6327', '5121', '8447', '8007', '3433', '3583', '1931', '7017', 'o', 'm', '5393', 'r', '2195', 'e', '4547', '2073', '2791', 'e', 'v', '2909', 'i', '4183', '4771', '5997', '4699', 'e', 'z', '7753', '9361', '6057', 'x', 'j']
Output:
| [
"b, e, i, j, m, o, r, v, x, z"
] | task636-4d4b8757ae024fa988284d4e9e2cc507 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['z', '8377', '7011', '3469', 'm', '6083', 'o', '9505', '5023', '3111', 'v', '1123', 'y', 'm', '911', 'y', 'o', 'd', 'b', '4137', 'b', 'f', '3667', 'b', 'k', 'x', 'j', 'z', 'p', '5185']
Output:
| [
"b, d, f, j, k, m, o, p, v, x, y, z"
] | task636-31e038a5bfbc4d4c996d5bd7d3b18530 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['1251', '7883', '8149', 't', '7407', 'f', 'e', 'f', 'w', 's', 'p', 'k', 'v', 'n', 's', '7745', 's', 'g', 'n', '4487', 'n', 'i', 'b', '5315', '6715', 'x', 'j', 'n', 'i', 'v', '2753', '9013', 'x']
Output:
| [
"b, e, f, g, i, j, k, n, p, s, t, v, w, x"
] | task636-8fc3215936fb429584fee5694c082099 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['9519', '3263']
Output:
| [
"-1"
] | task636-97a351ed256d4ce1a891e0622e673d6b |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['4643', '6409', '3809', 'l', 'f', 'x', '1011', '6855', '2629', '4039', 'r', 'l', '4617', 'r', '1661', '9313', 'k', '3279', '8081', '9687', '7857', '9185', 'b', 'o', 'l', 'c', 's', 'i', 'i', 'z', '347', 'b', '1905', 'h', '1449', 'w', 'n', 'n', 'l', 'o', 'f']
Output:
| [
"b, c, f, h, i, k, l, n, o, r, s, w, x, z"
] | task636-c404aafd81ad482cac51250eb44a2001 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['u', '4013', '6239', '8767', 'g', '4623', 'v', '8437', '4023', '2139', '7315', '4427', '9143', 'z', '7905', '9661', 'a', 'p', 'y', 's', '7093', '4131', 'a', '1211', 'd', 'l', 'i', 'e', '5491', '2589', '6005']
Output:
| [
"a, d, e, g, i, l, p, s, u, v, y, z"
] | task636-bba2772816a9486f900f33dcacf99d2b |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['2681', 't', 't', '5785', '5965', '4769', 'c', 'z']
Output:
| [
"c, t, z"
] | task636-179c5901f4ca4453a09898b75a7b3fe9 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['t', '939', '5875', '9081', '1911', '7091', '8275', 'j', '4781', 't', '4869', 'z']
Output:
| [
"j, t, z"
] | task636-1acf17b652b34ef5aacc2a69a6eedfa1 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['5707', '1703', 'j', '9149', '3707', 'd', 'o', 'e', 'e', '6263', 'p', '3287', '431', 't', '1419', 'a', '5481', '2093', '9249', '9665', 'd', 'j', 'k', '6925', 'a', 's', 'e', 'q', '3425', '8125', 'c', 'a', 'c', '7103', 'm', 'n', 'i']
Output:
| [
"a, c, d, e, i, j, k, m, n, o, p, q, s, t"
] | task636-4712e2b8c2f14b1a84797d230e4345a7 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['c', '9505', 'a', '8731', 'f', 'p', 'b', 'a', 'v', '9393', '5807', 's', 'n', 'a', '6719', 'x', '1365', 't', '4877', '4021', 'k']
Output:
| [
"a, b, c, f, k, n, p, s, t, v, x"
] | task636-12f7a063f2214419ae23ccf17c2454ba |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['1733', '9355', 'o', 'j', 'i', 'e', 'w', '5445', 't', 'd', 'h', '1953', '827', '2205', '8029', '3637', '7855', '8067', 'v', '3125', 'c', 'f', '1607', '593', 'm', '1315', 'd', 'k']
Output:
| [
"c, d, e, f, h, i, j, k, m, o, t, v, w"
] | task636-54c2307ef6854f1fb886913ad359f92f |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['s', '3293', '1005', '5635', 'e', '4427', '1445', 'c']
Output:
| [
"c, e, s"
] | task636-0e2da561d02a4a36868eff402b093c9a |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['3925', 'i', '3797', 'q', '2977', 'v', 'b', 'p', '3551', 'w', '7433', 'y', '1595', '8265', 'k', '5687', 'w', '7413']
Output:
| [
"b, i, k, p, q, v, w, y"
] | task636-6f4af5e1c1784137b5e3b4fc5eed9716 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['w', '3055', '7621', 'j', 's', '5629', '6793', 'g', '3685', 'v', '1203', '1529', 'm', 'e', 'l', '8539', 'g', 'k', '3377', '3561', 'j', '3813', '7805', 'p', 'z', 'j', '1585', '4281', '9735', 'b', 'h', '1513', '9091', 'h', '3727', '2705', '7373', 'b']
Output:
| [
"b, e, g, h, j, k, l, m, p, s, v, w, z"
] | task636-c6149f831a3d4a298e30e24722087eed |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['u', 'k', 'd', '4393', 'u', 'h', 'q', '833', 'k', 'l', '5749', 'r', '7123', '1003', 'z', '531', 'o', 'u', '6601', '6975', '4905', 'n', 'e']
Output:
| [
"d, e, h, k, l, n, o, q, r, u, z"
] | task636-f119c96344974096970be04fee84dd56 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['t', 'y', 'm', 's', 'w', '9151', 'x', 'm', '9589', '5059', 'b', 'g', 'z', '8165', 'r', 'b', '4565', 'o']
Output:
| [
"b, g, m, o, r, s, t, w, x, y, z"
] | task636-7a2c8361cca349b4b86cefda17a88a4d |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['a', '3925', 'r', '8331', 'i', 't', 'q', 'i', 's', '9693', 'h', 'd', '6007', '6731', 'w', 'p', 'm', 'p', '3721', '4157', 'b', '8779', 'h', '711', 'u', '7795', '277', 'p', 'a', 'l']
Output:
| [
"a, b, d, h, i, l, m, p, q, r, s, t, u, w"
] | task636-4d4e9e34459143d7b873315756697513 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['1147', 'q', 'm', 'q', '7585', 'n', 'r', '1749', '1857', 'z', 'h', '9683', '1435']
Output:
| [
"h, m, n, q, r, z"
] | task636-efb418b86525413a9a12f65abe8fe6a6 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['3353', 'w', '6047', 'l', 'a', 'p', 't', 't', 'f', 'y', 'l', 'b', '495', 'd', 'q', 'd', 'f', '3029', '3731', '2277', '2833', '9961', 'c', 'm', '3993', '7395', '1413', 't', '8999', '5771']
Output:
| [
"a, b, c, d, f, l, m, p, q, t, w, y"
] | task636-e22d0c98c3594d8fb0e653fc1b7e8d66 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['p', '6529', '8775', '8629', '7793']
Output:
| [
"p"
] | task636-ad13b31d951d4b9dbf1508eaabec6fe0 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['537', 'p', 'x', 'e', '3857', '9713', 'p', 'p', 's', 'h', '2703', 'f', 'u', '8859', '27', 'w', 'w', 'x', 'p', 'a', 'a', 'y', 'z', '2729', '8365', '8469', '9627', '8369', 'o', 'a', 'o', '2465', 'v', 'v', 's']
Output:
| [
"a, e, f, h, o, p, s, u, v, w, x, y, z"
] | task636-5563aeec615845fc8499c6ae95480db1 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['c', 'k', '9301', '8547', '7481', 'y', 'x', 'v', '6717', 'j', '4515', '4043', 'u', 'c', 'd', 'r', 'w', '6403', 'm', '89', '3425', 'o', '9783', '7801', 'j', 'f', 'r', 'v', 'h', '2689', 'i', '4515', 'd', '5697']
Output:
| [
"c, d, f, h, i, j, k, m, o, r, u, v, w, x, y"
] | task636-f437504863b44cc985e352634f3d392a |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['v', '3327', '2071', '269', 'y', 'n', 't', '9569', 'n', '1645', '1601', 'm', '5661', '5759', '4029', '375', '5881', '9243', '7367', 'r', 'y', '6881', '705', 'o', 'n', '2227', 'x', 'y', 'w', 'c', 'a', '833', 'w', '717', 'n', 'p', '5853', '7063', '6847', 'q', 'a', '737', 'h', '9647', '203']
Output:
| [
"a, c, h, m, n, o, p, q, r, t, v, w, x, y"
] | task636-d9eb6c75db664280a735d2857120eaf5 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['t', '2055', '5823', '2571', 'm', '4463', 'i', 'j', '6447', '2121', '4371', 'j', 'z', 'n']
Output:
| [
"i, j, m, n, t, z"
] | task636-8171746aa7324292b570c973a884c960 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['2105', '9563', '6837']
Output:
| [
"-1"
] | task636-3c6b769781f54f06a0fd44a194682f9c |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['5739', '2791', 'g', '1333', 'c', 'u', '9509', 'l', 'e', '1405', '2333', 'g', 'x', 'p', 'c', 'g', 't', '1687', 'q', 'v', '7543', '9847', 'k', 'b', '4361', '5473', '2687', '8567', 'x', '4523', '6533', '97']
Output:
| [
"b, c, e, g, k, l, p, q, t, u, v, x"
] | task636-19f3483b3da2462984150344612f9c4e |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['d', '3073', 's', '6837', 'w', 'y', 'v', '5959', '7275', '1681', 'r', '8217', 'z']
Output:
| [
"d, r, s, v, w, y, z"
] | task636-6b8eb967cf624790b1a97155d179c665 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['u', '5311', 'm', '3187', '507', 'n', '1403', 'x', 's', 'q']
Output:
| [
"m, n, q, s, u, x"
] | task636-b4efd029d9404d0cbf9a842b7223bbbf |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['6253', '249', '5435', 'a', '6461', '9701', '7225', '5727', '9139', 'j', 'c', '7393', '7333', '1621', 'u', '8203', 'm', '5071', '1925', '3235', 'k', '8021', 'q', 'w', '7071', 'x', '9631', 'k', 'r', '6599', 'a', 'j', '7171', 'l', '3769', '5667', 'x', 'i']
Output:
| [
"a, c, i, j, k, l, m, q, r, u, w, x"
] | task636-61f28f7ba3834906acefe6b911ad39bc |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['a', '9379', '5301', '7937', '4655', '7569', '8585', 'j', 'a', '1013', '983', '6985', '3249', 'b', 'o', 'd', '8535', '3035']
Output:
| [
"a, b, d, j, o"
] | task636-6afd78fedf4b42b48e422d5149bf2ed7 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['d', '4949', '5199', 'g', '8959', 'w', 'y', '3451', '1593', '4879', 'o', '8423', 'h', '5051', '7753']
Output:
| [
"d, g, h, o, w, y"
] | task636-9da52f1264bc45d6b43e15c576cf3ce9 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['6681', '4229', '4123', 'y', '3061', '6807', 'h', '7791', 'm', '8865', 'v', '4901', '3145', 'e', '4827', 'u', '2223', '2613', '3319', 'v']
Output:
| [
"e, h, m, u, v, y"
] | task636-fc1f83d49aab421da4bed5ae462fcb3f |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['7139', '4679', 'r', '9741', 'j', '8105', 't', 'v']
Output:
| [
"j, r, t, v"
] | task636-58e9992b47ff44bcb09947503af6feb2 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['8193', 'l', 't', '143', '1565', 'c', '8751', '6243', '3525', 'o', 'z', '665']
Output:
| [
"c, l, o, t, z"
] | task636-6284dc81d177451592754077c4cbd7d3 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['2975', 'i', '733', 'k', 'b', '6831', '5903', '1961', '5611', '8333', 'c', 'v', '4625', '8669', '7245', '9361', '5653', 'g', 'e', '7555', 'u']
Output:
| [
"b, c, e, g, i, k, u, v"
] | task636-551736a305f44664bcdec4feddcdbdaf |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['913', 'r', 'a', '4319', '6909', '9061', 'a', 'g', 'f', 'j', 'w']
Output:
| [
"a, f, g, j, r, w"
] | task636-c21b0d956cf04c89ab1db917037706d0 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['r', 't', '3539', 'z', 't', '6055', 'r', '5787', '8469', 'p', 'h', '9729', 'z', '1637', '5873', 'c', '3597', '4411', 's', 'k', 'q', '6471', '5375', 'e', 'v', 'i', '7425', 'h', '9079', 'd', '1585', '6011', 'x', '5669', '5219', '4951', '4765', '8285', '2811', 'c', '1805', '6463']
Output:
| [
"c, d, e, h, i, k, p, q, r, s, t, v, x, z"
] | task636-afe625d6b9af48f09475fb692cbcb7e0 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['103', '8381', 'o', 'k', '8799', 'b', '9571', 'q', 'd', '7873', 'j', 'q', '4363', '7389', 'n', 'j', 's', '2773', '7133', '6053', 'y', '2735', '8699', 'i', 'p', 'y', 'l', '8141']
Output:
| [
"b, d, i, j, k, l, n, o, p, q, s, y"
] | task636-ed55fb29e0ff4961880452702a70e15c |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['a', 'e', '5593', 'l', '2227', '7217', 'p', 'x', 'q', '5457', '9103', '603', '4981', 'b', '7837', '4357', '4045', 'q']
Output:
| [
"a, b, e, l, p, q, x"
] | task636-e1046c68843c4d81877785e0fd3fb55d |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['9985', '8421', 'h', 'e', 'x', '3925', 'v', 'y', 'y', '3385', 'k', 'j', 'm', '8351', 'o', '867', '161', 'q', 'q', '5055', 'c', 's', '2553', '107', 'u', 'f', 'y', 'h', '6855', '6553', 'b']
Output:
| [
"b, c, e, f, h, j, k, m, o, q, s, u, v, x, y"
] | task636-230ece5c93a54f8d9b1443911004cc59 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['r', '9105', '3777', '859', '7839', 'r', 'p', '6635', '6795', 'u', '8667', '8667', '15', 'e', '9317', '543', 'j', '9985', 't', 'b', '347', '359', 'y', 'm', 's', '6069', '3525']
Output:
| [
"b, e, j, m, p, r, s, t, u, y"
] | task636-96dd3c9133b841e6a1e2595779931a9e |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['7687', 'd', '9137', 'm', '1583', 'c', '4587', '4099', 's', 'q', '8611', '2265', 'n', '7885', 'o', '279', '8281', '1235', 'n', '8445', '7653', 'm', '5873', '945', 't', '4245', 'c', '2401', '1189', '1565', '3589', '6475', '1007', '2569', '6625', '3951', '3871']
Output:
| [
"c, d, m, n, o, q, s, t"
] | task636-7cc6fb7ba0854a0fa7d3f23a93505550 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['q', '6083', '2879', '5567', 'j', '4407', '6385', '5229', 'm', '9101', '155', 'v', '1861', '9999']
Output:
| [
"j, m, q, v"
] | task636-840fa92b43d7441bade962cb42f1465a |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['6001', 'n', '9051', '3661', 'w', '2531', '551', 'g', '2185', 'r', 'j', '1447', '8459', '3405', '799', 'i', '1243', '5205', '6389', 'c', 'm', '9887', 'g', '9741', '8969']
Output:
| [
"c, g, i, j, m, n, r, w"
] | task636-6cf8a92a09a442fcb6a988e0c03b0087 |
Definition: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Positive Example 1 -
Input: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Positive Example 2 -
Input: ['12', '523', '982']
Output: -1
Negative Example 1 -
Input: ['g', 'w', 'x', '3467', 'g']
Output: g, g, x, w
Negative Example 2 -
Input: ['75', '54', 'j', 'l', '2332', 'z', 'e', '366']
Output: j, l, z, e
Now complete the following example -
Input: ['975', '2453', '3039', '93', 'j', '6621', '2585', '4429', '8481', '9081', 't', 'y']
Output:
| [
"j, t, y"
] | task636-c9103e5905854224b8127c78c83f4078 |