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: ['s', '3411', 'd', 'f', '119', 'c', 's', 'k', 'v', '8811', 'i', 'g', 'r', '6809', '8747', '1051', 'w', 'j']
Output:
| [
"c, d, f, g, i, j, k, r, s, v, w"
] | task636-074c3305397d42deba0731a9ea50a24b |
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', 'h', 's', '4625', 'g', 'v', '6049', 's', '5121', 'i', '3157', 'k', 'g', '5875', 't', '3863', 'm', 'u', '4273', '6977', 'g', '3203', '5271', '4667', '2563', 'e', '1795', '1615', 'i', '7489', 'v', '8801', 'v', 'i', 'k', '405', 'l', 'w', 'p']
Output:
| [
"e, g, h, i, k, l, m, p, s, t, u, v, w"
] | task636-f44bf0539ac24964b10e608b8b133b32 |
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', 'h', 'b', 't', 'p', '6381', '1717', '4785', '2197', '6467', '1369', '9019', 'b', 'h', 'i', '2579', 'x', 'i', '9403', 'p', '3095', '3287', '5857', '3117']
Output:
| [
"b, h, i, k, p, t, x"
] | task636-fae10e7c42d845d6af50cb717286553e |
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: ['9781', 'x', '6811', '2387', '9251', '3931', '8799', 'x', 'y', 'q', 'o', '2163', '5275', 'q', 'e', 'u', 'i', '613', 'n', 'u', '649', 'k', 'n', '4855', '1995', '3067', 'm', 'f', 'i', '6611', '5975', '201', 'a', '6541', 'i', 'f']
Output:
| [
"a, e, f, i, k, m, n, o, q, u, x, y"
] | task636-0dba70947dce41a4b7ff496ef2450d7b |
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: ['641', '4093', 'u', 'i', '21', 'f', 'g', '1341', 'c', '8491', '313', '2885', '8445', 'l', 'p', 'm', 'y', '5311', '7825', 'o', 'd', 's', 'j', '4435', '3665', 'a', 'x', 'f', 's', '4349', 'c', 'p', 'e', '4725', 'j', 'h', 'h', '3507', 'f', 's', '7899', 's', 'd', 'q', '2605']
Output:
| [
"a, c, d, e, f, g, h, i, j, l, m, o, p, q, s, u, x, y"
] | task636-f7ea065bcc8448ac8a99510adfd92ef9 |
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: ['5045', 'd', 'p', 'a', 'a', 'y', 'v', '547', '5311', '9139', 'o', '3409', '4901', '6045', 'j']
Output:
| [
"a, d, j, o, p, v, y"
] | task636-b7a2b329bf2f43e7927ec65a0bf3271b |
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: ['4675', 'm', '3489', '5669', 'r', 't', 'z', '565', 'd', 'z', 'x', '7819', '6815', '5611', 'e', 'f', '9199', '6293', 'e', 'x', '9405', 'c', '8607', 'i', '9737', '1533', '5857', 'b', 'm', '9559', 'q', 'z', '1279', '1773', 'l', 'p', '5807', 'k']
Output:
| [
"b, c, d, e, f, i, k, l, m, p, q, r, t, x, z"
] | task636-aae0462321b34e86ad7db585ff3107b5 |
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', 'w', '8675', '3083', '5211', 'c', 'e', 'n', 'b', 's', 'k', 'p', '7337', '5885', 'y', '981', '3365', '6417', '9119', '1905', 'g', 'g', 'd', '3463', '2157', 'u', '2385', '2269', '2737']
Output:
| [
"b, c, d, e, g, k, m, n, p, s, u, w, y"
] | task636-f9fc8d04fade4a3baaa0e81bee0f57f3 |
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: ['4545', '1397', '1397', 'f', 'm', '1927', 'n', 'd', 'd', 'm', 'u', '5503', '2269', 'c', '3589', '259', '1477', 'w', 'f', '6399', '8615', '2013']
Output:
| [
"c, d, f, m, n, u, w"
] | task636-b5e7f95102ce4e18ad85d48c9c74a966 |
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: ['6299', 'k', '6961', 'a']
Output:
| [
"a, k"
] | task636-fe0e0e26f64743f1898250d38d9fc650 |
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: ['9381', '4833', '2185', 's', 'r', 's', '6385', '2271', '8183', 'q', '5441', 'z', 'e', '4429', 'p', 'g', '5485', 'k', '7125', '573', '5519', '4125', '7703', 'k', 'x', '3077', 'y', 't', 'e', '195', 't']
Output:
| [
"e, g, k, p, q, r, s, t, x, y, z"
] | task636-a666dd31007b439ba1430f83545602b8 |
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: ['5741', '3385', 'n', '1345', 'u']
Output:
| [
"n, u"
] | task636-3fa8ab94d8d141ee9bef17d6abed25cf |
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', 'k', 'r', 'j', '1325', '2507', '5575', 'b', '1589', 'j', '1421', '8977', 'l']
Output:
| [
"b, j, k, l, r"
] | task636-bbd0702488d141f194e4596ea7590b30 |
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: ['l', '7457', 'd', '4189', '8437', 'f', 'j', 'u', '4621', 'y', 'd']
Output:
| [
"d, f, j, l, u, y"
] | task636-6cde1bff3b7b487aa1bdc9a36e21317a |
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: ['9883', '561', 'd', '7911', '487', 'h', '9045', '5151', '9717', 'g', 'i']
Output:
| [
"d, g, h, i"
] | task636-0ac2ad89af6246d792bd5afce96588a2 |
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', 'k', '4899', 'x']
Output:
| [
"d, k, x"
] | task636-9f8e3861891d4a888f4c630a2d709aa9 |
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', '8859', 'l', 'y', 'a', 'b', 'p', 'j', 'x', 'o', '2189', '4909', '4735', 'u', '1489', '7043', 'x', 'n', '2353', 'q', '6277', 'g', '6047']
Output:
| [
"a, b, g, j, l, m, n, o, p, q, u, x, y"
] | task636-1676014b37294cacac487d1a7f0ad797 |
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: ['795', 'o', '4861', 'r', 's', 'n', 'w', 'd', 'o']
Output:
| [
"d, n, o, r, s, w"
] | task636-211780d6e9e94b69ba69e241297213c0 |
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: ['8321', '649', '3019', 'n', 'z', 'g', '8947', 'f', 'm', 'g', '7325', 'h', '185', '185', 'y', 'z', 'g', '6441', 'c', 'r', '5635', '2801', 'o']
Output:
| [
"c, f, g, h, m, n, o, r, y, z"
] | task636-1240a43d80504ca99150def509f66ce1 |
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', '613', 'f', 'g', 'c', '429', 'g', 'c', 'c', 'z', '6135', '7421', '4959', 'h', '7515', '8597', '843', 'x', '6711', 'i', '5885', '1963', '6031', 'g', 'm', 'k', '3221', 'i', 'r', '8043', 'v', '3251', '7003', 'y', 'o', '9355', '7407']
Output:
| [
"c, f, g, h, i, k, m, o, r, v, x, y, z"
] | task636-b93b3a50b5354cc89a41dc4215f4c965 |
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', '4987', 't', 'q', '4333', '7101', '7115', '7565', 'q', '5039', 'o', '9387', 'j', 'n', 'z', '5281', '2149', '1041', '8307', 'b', 'p', 'b', '49', 'm', '3727', '6775', 'z', '3217', '2101', '5401', 'g', 't', '81', '7515']
Output:
| [
"b, g, j, m, n, o, p, q, t, z"
] | task636-ef1dceb9ba6641ea8c857fc6d57076f7 |
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', 'l', '6165', '1921', 'm', 's', 'n', 'a', '6015', '1835', '4083', 't', '2067', 'o', 'k', '5649', 'h', 'p']
Output:
| [
"a, f, h, k, l, m, n, o, p, s, t"
] | task636-cd8cf0ee916844f1811c685ed3e89526 |
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: ['8549', 's', 's', 't', '2949', '7987', '3343', '4881', '8657', 'g', 'h', 'w', '5843', '4151', '1227', 'y', 'n', '5013', '4065', 'm', 'q', 'a', 'v', '1503', 'i', 'p', '9629']
Output:
| [
"a, g, h, i, m, n, p, q, s, t, v, w, y"
] | task636-d9a714a0f60e46cba0c3c8cc2dbc0eae |
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: ['3191', '2655', '239', '2585', '3369', '7815', '5919', '8269', '5633', 'x', '8085', '2909', 'y', '2465', 'i', '1579', 'u', '2371', 'l', '1949', '51', 'e']
Output:
| [
"e, i, l, u, x, y"
] | task636-0243fee217ac45f7baf5810747fe1bb0 |
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', 'p', 'c', 'h', '9657', '3963', '4103', 'd', '8021', 'p', '6035', 'o', '571', 'r', 'g', 'q', 'f', 's', '421', '2931', '3509', '4481', '7681', '5005']
Output:
| [
"c, d, f, g, h, n, o, p, q, r, s"
] | task636-93122ec3376d4edb95863bba9637e9d5 |
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', '5263', 'a', '1725', 'j', 'n', 'm', 'r', '5195', '3817', '6323', 'o', '7163', 'x', 'x', 'p', '6831', 'f', '2563', '8607', '6077', 'm', 'j', 'q']
Output:
| [
"a, f, j, m, n, o, p, q, r, u, x"
] | task636-7c577d4f570941b6ba373f82c2d34fb7 |
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: ['4891', 'a', '3155', 's', '7607', 'j', '1851', '2557', '699', 'e', 'y', '3755', 'x', 'x', 'e', '4027', 'u', '8835', '6607', 'u', 'a']
Output:
| [
"a, e, j, s, u, x, y"
] | task636-d1b03be3260d4dcd9113829fd892410d |
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: ['1055', '5409', 's', 'c', 'm', 'j', 'o', 'n']
Output:
| [
"c, j, m, n, o, s"
] | task636-d2d040f48a224b8b93deb28ece4d06ae |
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', '6017', 'e', 'k', '4241', '6325', 'c', 'd', '5557', 'u', 'h', 'x', '6795', 'c', '3907', 'n', 'j', '9947', 'b', '9123', '3855', '8385', '9579', 'm', 'p', '8851', '3891']
Output:
| [
"b, c, d, e, h, j, k, m, n, p, r, u, x"
] | task636-d7f1a0aa59694d7f8684a5da7d77aeaa |
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', '2977', 'x', 'p', 'n', '1081']
Output:
| [
"n, p, x"
] | task636-2d7434fb020d4f72b43446ad5f4075ca |
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: ['459', '1729', 'b', 'c', '9619', '4461', '4347', '6733', 'i', '3631', 's', 'j', 'i', 'r', '5293', 'q', '7397', '4309', 'c', 'n', 'k', '197', 'q', '8139']
Output:
| [
"b, c, i, j, k, n, q, r, s"
] | task636-f4877059305d44288540eb920f25dde1 |
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: ['689', 'm', 'i', '1351', '2559', '9087', 'x', '4957', '5807', 'l', '9121', '2795', '1685', 'r', '7841', 'z', 'g', '3203', '7449', 'c', '8423', 'n', '487', 'l', '7239', 'q', '9093', '2785', 's', 'k', '3469', '9967', 'p', '4905', 'r', '5107', '2847', 'l', 'r', 'c', '1897', 'e', 'a', 'y']
Output:
| [
"a, c, e, g, i, k, l, m, n, p, q, r, s, x, y, z"
] | task636-c7b2e399326841be9753177defefdddc |
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: ['2823', '127', '1617', '1267', 'p', 'l', '5403', 'g', 'b', 'o', 'n', 'c', 'l', 's', '4601', 'y', 'g', '4781', '6227', '1441', 'v', '8755', 'z', 'g', 'x', 'n', '7737', '2951', '9109', 'j', 'u', '3983', 'a']
Output:
| [
"a, b, c, g, j, l, n, o, p, s, u, v, x, y, z"
] | task636-59e15d21e0bb4644a40f8095ee658a98 |
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', '921', '1467', '9349', 'y', 'h', '7719', 'm', '3829', 'q', 'c', 'y', '6991', '105', 'v', '5029', 'x', '1359', 't', '4003', 'u', 'n', 'g', '3861', 'r']
Output:
| [
"c, g, h, m, n, q, r, t, u, v, x, y, z"
] | task636-50e12983a31944b6a0b725b5a55bcb1e |
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: ['6027', 'v', 'b', 'l', '7853', 'r', 'y', '2919', '3831']
Output:
| [
"b, l, r, v, y"
] | task636-69957c77385c45d5abccbc4af939767d |
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: ['2421', 's', '9637', '1287', '9453', '8639', '7685', 'w', 'g', 'h', 'h', 'n', 'j']
Output:
| [
"g, h, j, n, s, w"
] | task636-68b4349382d7481694f67963d5a98093 |
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', '765', '7975']
Output:
| [
"x"
] | task636-4202f77f9d57435380741f3103b8085a |
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', 'g', '155', '8161', 'x', '9569']
Output:
| [
"g, t, x"
] | task636-06bd85f984464a21a750ff2593111b78 |
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: ['4743', '3547', '1547', '365', 'k', '3177', '6221', '8695', 'g', 'r', 'j', '5873', 'c', '1921', 'v', 'w', 'd', '2861', 'a', 't', 'r', 'u', 'a', 'c', '8315', '9439', '2083', 't', 'i', '5477', 'h', 'k', '2565', '1639', 't', '7841', 'b', '5623', 'e', 's']
Output:
| [
"a, b, c, d, e, g, h, i, j, k, r, s, t, u, v, w"
] | task636-d50e8adbb0764b88b630b49740def6ec |
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: ['i', '6915', 'p', 'o', '2911', '9241', 'g', '1177', '7817', '1889', '1717', '1679', '1985', 'b', 'a', '2969', '8939', '7581', 'l', '6499', '627', 'z', 'g', '3043', '7961', 'b', 'y', '7293', '4165', '5965', '7955', '6695', 'p', '2195', 'l', 'e']
Output:
| [
"a, b, e, g, i, l, o, p, y, z"
] | task636-430120fbe3d948e6841f2bf5d98851a5 |
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: ['2883', 'a', 'f', 'z', '233', 'n', '289', '2987', '5565', 'c', '7095', 'y', 'a', '6451', 'c', '993', '7599', '9907', 'q', 'y', '5073', '8125', 't', '2219']
Output:
| [
"a, c, f, n, q, t, y, z"
] | task636-2ff6883ebe63433087ffa64d81684323 |
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', '9021', 'w', 'p', '9629', 'e', 'z', 'a', 'i', '5207', 's', 'o', 'g', '6905', '7705', '5663', 'b', 'u', '7311', 'p', 'q', 's', 'z']
Output:
| [
"a, b, e, g, h, i, o, p, q, s, u, w, z"
] | task636-d7c3faf6b88f4e98ba196a08865683cb |
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', 'e', 'q', 'f', 'w', '7511', 'g', 'r', '4409', '2719', '2633', 'h', '7075', '6641', 'p', '4053', '7363', 'r', 'g', '2649', '5399', 'g', '9107', '7801', 'a', '3713', 'f', '3135', 'v', 'a', '1813', '6475', 'r', 'f', '8433', 'i', '99', '9303']
Output:
| [
"a, e, f, g, h, i, p, q, r, t, v, w"
] | task636-48867048c18f4dd89fc81cb7ce0e32a9 |
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: ['9833', '3383', 'h', '3545', '2899', 'y', 'p', 'q', '1901', '3317', '5641', 'v', 'c', 'u', '5521', 'e', '7997', '2439', '5573', '4119', 'k', '8291', '1009', '8253', '405', '233', 'p']
Output:
| [
"c, e, h, k, p, q, u, v, y"
] | task636-6ccd5d4cdad445b9b490423c995b6965 |
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: ['6781', '8447', 'q', '7855', '8101', '9243', 'e', 'a', '3723', 'd', '3243', 'u', 'n', '1557', '9573', 'l', 'o', 'h', 'v', '4017', 'u', '6085', 'r', 'l', 's', 'u', 'g', 'l', '5109', '7443', 'n', '9061']
Output:
| [
"a, d, e, g, h, l, n, o, q, r, s, u, v"
] | task636-39236729ebad472cb9f48ffe97e916b3 |
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', 'r', '6167', '1907', 'n', 't', 'd', '8553', 'a', '4981', '9551', '871', '5097', 'm', '9977']
Output:
| [
"a, d, k, m, n, r, t"
] | task636-fdcb79b2d14c4cb0be2ad2bce11d3373 |
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: ['2165', 'f', '5081', 's']
Output:
| [
"f, s"
] | task636-55eddd625ea94ece926845f8d5ab5030 |
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: ['1177', '7057', 'f', 'd', 'g', 'y', 'l', '7361', '21', 'g', 'b', 'f', 'b', '531', 't', 'x', 'a', '1581', 'g', 'h', 'x', '733', 'r', '147', '5675', '3321', 'a', '7531', '4413']
Output:
| [
"a, b, d, f, g, h, l, r, t, x, y"
] | task636-40554851e21a4da9abda4afe483b51f8 |
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', 'r', 'd', '5025', 'd', '993', 'v', 'm', 't', 'c', '2471', '4665', '2987', 'y', 'k', 'c', 'k', 'u', 'u', 'a', '2391', 'k', 'p', 'p', '9147', 'i']
Output:
| [
"a, c, d, i, k, m, p, q, r, t, u, v, y"
] | task636-99dcf8526c0942f2be6e5b9cdb5c64ab |
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: ['9435', 'l', 's', '5617', 'z', 'y', '4079', 'b', 'v', 'e', '8897']
Output:
| [
"b, e, l, s, v, y, z"
] | task636-d28d09d085404360b95bc9a5e45250fb |
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: ['173', '3307', '7561', '9941', '9457', '8595', 'q', 't', 'y', 'd', '7855', 'b', '8465', '9205', 'b', 'z', 's', 'q', '7391', 'n', 'r', '5885', 'a', '7093', '5615', '5475', '8819', '8463', '8711', '4635', '351', '3475', 'y', '8755', 'u']
Output:
| [
"a, b, d, n, q, r, s, t, u, y, z"
] | task636-5e9b71a1b4a6473a9ea56e7033cec2f5 |
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: ['3967', 'd', 's', '6359', 'b', '915', '3989', 'u', 'z', 'r', 'u', 'g', 'm', 'm', '2947', 'n', 'f', 'l', 'i', '1959', 'g', '9077', 'b', 'i', '8919', '8187', '2155', '5431', 'b', '1487', 'x', '8631', 'y', '9971', 'h', '2793']
Output:
| [
"b, d, f, g, h, i, l, m, n, r, s, u, x, y, z"
] | task636-3bdf8ce57ce8492d8bb6566e73eea472 |
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', '3379', '5349', 'x', '8293', 'r', 'l', 'm', 'f', '7183', '2597', '9911', 'z', 'l', 'z', 'e', 'x', 's', 't', 'k', 'o', '9329', 't', '8669', 'w', 't', 'o', 'e', '6801', 'r', '8053', '2105', '1787', '8311', 'o', 'k', '6005', '9263', 'l', '9049', 'x', '4865', 'z']
Output:
| [
"e, f, k, l, m, o, r, s, t, v, w, x, z"
] | task636-652a97644c80441f85795988e33560d2 |
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: ['4585', '547', '7205', 'b', '6797', 'i', '8525', 'h', '7381', 's', 'y', 'a', '8641', '4549', 'o', '3501', 't', 'k', '5453', 'l', 'f', '2717', '8433', '2747', 'q', '5929', '349', '1317', '1903', '4423', '3855', '1407', 'd', 'b', 's', 'n', 'y', 'z', 'a', 'u', 'v']
Output:
| [
"a, b, d, f, h, i, k, l, n, o, q, s, t, u, v, y, z"
] | task636-350b2ba905be44d1848176684019a8ed |
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: ['2599', 'i', 'e', 'j', '9455', 'o', 'z', 'u', '8191', '8335', '6117', 'n', 'z', '1215', 'f', 'k', '337', '1785', '3777', 'y', 'l', 'l', 'j', 'x', 'a', 'l', 'p', 'a', 'd', 'u', '255', '1775', 'u']
Output:
| [
"a, d, e, f, i, j, k, l, n, o, p, u, x, y, z"
] | task636-4b1cc32484064e2d9bf7c75bba4d5717 |
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: ['i', 'm', '5027', 'u', 'j', '2861', '6365', '2977', '4955', 'w', 'n', 'g', 'm', '4211', '5099']
Output:
| [
"g, i, j, m, n, u, w"
] | task636-59dce59f5336469a8f238def6404f169 |
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', '7793', 'e', '3513', '9411', 'r', 't', '361', '6969', '7295', '2581', 'j', '8487', 'h', 's', 'n', 'y', 's', 'k', 'x', 'c', 'r', '9231', '5035', 'r', '9183', '7287', 'i', '9075', 'v', '9381']
Output:
| [
"c, e, h, i, j, k, n, r, s, t, v, x, y"
] | task636-a5d6c2ed5f034ca3a9cc534a82f2222d |
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', '3307', 'i', '8811']
Output:
| [
"e, i"
] | task636-7ad7883746ba4e3eae4d9a9273c8a5a3 |
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: ['2381', '2865', '4821', 'n', 'u', 's', 'p', 'v', 'v', 'n', '1349', '7903', 'm', '193', 't', 'p', 'c', '3521', 'a', 't', '8281', 'i', '151', '4783', 'm', '3387', '9551', 'z', 'q', 'v', '4549', '4411', 'u', '8735', '2645', '359', '2871', '5923', '5071', 'c', '9843', 'i']
Output:
| [
"a, c, i, m, n, p, q, s, t, u, v, z"
] | task636-0d91f212c4a24bb9b5d41612a0988a56 |
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', '2089', '4333', 'c', '5219', 'i', '7529', 't', 'v', '1075', 'v', 'q', 'r', '6091', '7401', '8261', '4109', 'f', 'f', 'b', '8781', '5347', 't', '7703', '6779', '7267', '6325', 'q', 't', 'p', '2793', 'o', '2297']
Output:
| [
"b, c, f, i, o, p, q, r, t, u, v"
] | task636-27daeb7a556241c999fc0957c3fa5b7a |
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', '1363', 'm', 'd', '4645', 'f', 's', '9827', '9943', '4259', '495', '2045', 'u', '1797', '1079', 'p', 'j', '5181', 'w', '4949', '8195', 'u', '6491']
Output:
| [
"d, f, j, k, m, p, s, u, w"
] | task636-4c4040868d8c4d62929c3095b355be28 |
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', 'c', 'c', 'u', '35', '8725', '7567', 'r', 'k', '8413', '231', 'z', '4897', '6019', '2025', 'y', 'f', '4445', '9225', '8267', '4269', '1493', 'b', 'f', 'r', 'd', '6717', '969', '213', '5659', '4929', '617', 'h', 'j', 'g', 'w', 'n', '1733', '1055', '9487']
Output:
| [
"b, c, d, f, g, h, j, k, n, r, u, w, x, y, z"
] | task636-ca1fdef0c9854cfb8c48626d6f9fce2d |
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: ['i', 'k', 'j', '4569', '8973', 'm', 'm', '5821', '7675', '669', 'e', '8245', 'y', '6195', 'u', 'q', '3113', 'p', '5231', '3097', '4861', '1311', '9373', 'z', 'x']
Output:
| [
"e, i, j, k, m, p, q, u, x, y, z"
] | task636-c2eaadf3f56748488549249edd7a3df9 |
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: ['7147', 'd', 'y', 'y', 'n', 's', '4763', 'j', 'b', 's', '4039', '9151', '6763', 'w', 'g', 'k', 'j', 'x', 'h', 'm', '3805', 'i', '5393', 'n', 'w', 'a', '1121', 'i', 'e', '4877', '3407', 'i', 'm', '3389', '3983', 'f', '8075', 'g', '6641', '17']
Output:
| [
"a, b, d, e, f, g, h, i, j, k, m, n, s, w, x, y"
] | task636-71c837f329c8462f85c24d994331311e |
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: ['3043', 'r', 'm', 'i', '2653', 'i', '1703', '1125', '6299', '4863', 'n', 'h']
Output:
| [
"h, i, m, n, r"
] | task636-0020f93171ed48538bd611ffde8455e4 |
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: ['9209', '575', '6527', 'o', 'c', 'x', '2499', 'r', 's', '8549', 'q', '8535', '4691', 'q', '8849', 'g', 'i', '1203', '463', 'z', '1621', '9099', 'h', '9741']
Output:
| [
"c, g, h, i, o, q, r, s, x, z"
] | task636-b63bd98b9b164c49b7e09694349067d1 |
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', '4053', 'z', '4225', 'e', '1463', 'c', 's', 'h', '8553', '4135', '9741', '409', '1119', '7327', 'x', '4141', '8707', '9771', 'g', 'z', '6423', 'e', 'b', '9489', 'd', '2017', '2909', '5815', '9163', 'd', '2791', '6317', 'e', '1641', 'f']
Output:
| [
"b, c, d, e, f, g, h, s, x, z"
] | task636-093c41fdd665425683fade6facd52546 |
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', 'm', 'v', 'q', '3457', '2587', '4473', '9863', '7369', 'u', 'l', 'f', '9501', '3965', 'k', 's', 'n', 'a', 'q', 'f', '3943', 'q', 'j', 'c', '4019', '3935', 'w', 'm', 'm']
Output:
| [
"a, c, f, j, k, l, m, n, q, s, t, u, v, w"
] | task636-f3e2116e55c14b8eb0b8155029057d46 |
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: ['2943', 'g', 'y', '4547', 'd', 'c', 'o', 'q', 'w', '1413', 'w', '8261', 'i', '8213', 'f', '3595', 'x', 'o', '1949', 'a', '9089', 'k', 'x', '3295', 'y', '4563', 'r', '693', 's', '1627', '5563', 'e']
Output:
| [
"a, c, d, e, f, g, i, k, o, q, r, s, w, x, y"
] | task636-d7a64ddf3209422c9986943407391b66 |
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: ['3291', '6645', 'j', 'f', 'e', '2101', '7821', '7713', '2103', '7995']
Output:
| [
"e, f, j"
] | task636-d87d1a2d7f7a4abbab08dc4f0c38013c |
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: ['y', '9013', '367', '6149', 'n', 'e', 'w', '8609', '8419', 'm', 'v', '4627', 'i', '2141', '5827']
Output:
| [
"e, i, m, n, v, w, y"
] | task636-dd4ca79ec5e54e5e89d29f96b60f6d1e |
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', '6103', '6553', 'x', 't', '4367', 'z', 'v', 'p', 'g', 'l', '9673', 'c', '7481', '9823', '3265', 'd', 'o', 'x', '239', '1283', '9241', 'v', '7617', 'o', '7559', '1151', '2931']
Output:
| [
"c, d, g, k, l, o, p, t, v, x, z"
] | task636-9c103996c12e416c9ae8b9bf1d30b044 |
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', '741', 'v', 'b', 'y', 'u', '2483', '5149', '3769', '3981', 'e', 'n', 'n', 'w', '1719']
Output:
| [
"b, e, n, u, v, w, y"
] | task636-f2d990db4ecd43b58cb90ca5cd5a9a0e |
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: ['o', '9031', '4145', 'g', 't', 'd', 'd', '2033', 'q', 'x', 'z', 'u', 's']
Output:
| [
"d, g, o, q, s, t, u, x, z"
] | task636-77366e36ca554b838894b42908e1b0cc |
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', '6295', 'z', '9505', '7809', '5423', '8789', '867', '8003', '8427', 'x', 't', '2189', 'e', 'h', 'n', 'o', '5641', 'j', '7045', '4631', '9099']
Output:
| [
"e, h, j, n, o, t, x, z"
] | task636-1a8016db5fdc46f5960a03dcdb00525f |
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: ['7529', 'e', '9007', 'u', 'l', 'l', '3751', '441', '5523', '6741', '6629', '9985']
Output:
| [
"e, l, u"
] | task636-c8bee8f593914327968a06e33156319d |
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: ['7591', '7521', 'm', '1429', 'x']
Output:
| [
"m, x"
] | task636-929213fae98b43fc9bb11a653479cf8e |
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', 'f', '5119', 'p', 't', '8701', '1157', '3881', '5867', 'i', 'i', '3891', '1105']
Output:
| [
"f, i, k, p, t"
] | task636-9370ffcc5a484558b1154d48fd08d2bc |
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: ['2957', '9101', '2365', 'j', 'a', '8883', 'q', 'i', 'i', 'v', 'n', 'g', 'f', 'z', '4677', 's', 'p', 'q', '2809', '6443', 'n', 'k', '3767', '4183', '6483', 'l', 'x', '8199', 'c', '97', '7181']
Output:
| [
"a, c, f, g, i, j, k, l, n, p, q, s, v, x, z"
] | task636-660812923e5f4f728799b40e0bf88dee |
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', 'y', '1649', 'b', '7569', '6469', '8909', 'u', '237', '9187', 'b', 'm', '4465', 'm', '7507', '3499', 't']
Output:
| [
"b, j, m, t, u, y"
] | task636-30da1c2d5f304bb9b4521be62f36bc18 |
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: ['4031', 't', 'o', 'c', 'x', '3007', '8329', '6345', '1267', '1017', 'o', 'x', 'l', '4129', 'd', '1987', '487', 'o', 'g', 'j', 'v', 'x', '3983', 'f', 'g', '5759', 'k', 'i', 'o', 'b', 'n', '683', 'j', 'o', 't', '4361', 'u']
Output:
| [
"b, c, d, f, g, i, j, k, l, n, o, t, u, v, x"
] | task636-806d113582f6434fabce85cd1cbb25cc |
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: ['1473', '5161', 'z', 'c', 'h', '5227', '3573', 'x', 'e', 'r', 't', 'g', 'p', 'e', '641', 'o', '213', 'y', 'm', '2431', 'k', '229', 'n', 'a', '5937']
Output:
| [
"a, c, e, g, h, k, m, n, o, p, r, t, x, y, z"
] | task636-410b68bc5e47484795aecef143e75aad |
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: ['o', 'k', '517', 'd', 'm', 'k', 'j', '8949', '185', '7', '8245', 'y', '4263', 'n', '6317', '5027', 't', 's', '9157', 'b', '7549', '2603', '4151', '9469', 'y', '6117', '7437', '1637']
Output:
| [
"b, d, j, k, m, n, o, s, t, y"
] | task636-c6045a97b6f44dc5903a435bf4527594 |
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: ['3751', 'u', '9165', 's', '2635', '169', 't', '8969', 't', '5505', 'o', '8541', 'o', 'f', 't', 'y', 'z', '3887', 'g', 'n', '6365', '9367', '1319', '1959', 'c', '7273', 'f', '2759', '4783', '9225', '5805']
Output:
| [
"c, f, g, n, o, s, t, u, y, z"
] | task636-f800fa026dd54f9aac2b5ffec1fcc2e5 |
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: ['7269', '2907', '6355', 'x', '2515', 'v', 'n']
Output:
| [
"n, v, x"
] | task636-6a7b4e50d82c4cf5b6cfaa3c919d7f67 |
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: ['7147', 'h', 'a', 'w', '1735', '9143', 'p', '7243', 'c', 'm', 'a', '1447', 'c', 't', '2031', 'j', 'w', '727', 'g', '8971', '1123', '2569', '5135', 'g', 'g', 'o', 'x', '8139', '4323', '8209', '2833', 'z', '6687', '9863', '9909']
Output:
| [
"a, c, g, h, j, m, o, p, t, w, x, z"
] | task636-15f9ea7efcaa49c3b1acac83d3a38acb |
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: ['5355', '8525', 'b', 'g', '899', '7353', '7305', '5361', '1931', '9697', '9805', 'g', '2549', '9121', '7635', '4065', '6649', '4503', 'o', '77', 'y', '7133', '1559', '5173', '5889', '4213', 'h', '3379', 'c', 't', 'u', '4285', '9051', '9853', 'g', 'e', '9567', '7067', 'd', 'z']
Output:
| [
"b, c, d, e, g, h, o, t, u, y, z"
] | task636-6f3d2e34a64d4530ae2629924527fc98 |
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', 'n', '3979', '6387', '123', 'l', '8705', 'v', '765', 'u', 's', '5875', '313', 'k', '2623', 'a', 'w']
Output:
| [
"a, k, l, m, n, s, u, v, w"
] | task636-7db4c51e588e41799fd07ee3b0c4bb01 |
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', '5223', 'g', 'r', 'i', '3575', 'o', 'l', 'g', '209', '2867', '6471', 'y', '4929', 'y', 'x', 'i', '3529', '6319', 'g']
Output:
| [
"g, i, j, l, o, r, x, y"
] | task636-df2da1865d074d65b87fca34c522144f |
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: ['5751', '103', 'j', '2391', '3391', '4863', '9597', 't', 'm', '6401', 'i', 'a', 'a', '793', 'r', '2953', '8825', 'd', '7477', '9601', 'a', 's', 'r', 'w', '1647', 'b', 'c', '9585', 'b', 'i']
Output:
| [
"a, b, c, d, i, j, m, r, s, t, w"
] | task636-fec74d7374d143d58186d51b92a81247 |
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: ['5717', 'n', 'r', '175', '2103', '5315', '7669', '1411', 'l', '6045', '5801']
Output:
| [
"l, n, r"
] | task636-b6bcbf9246da4ce38362bdb98977a01a |
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: ['2667', '9737', 'u', '2595', 'j', 'c', 'e', 'p', '3643', 'h', '5497', 'u', '5175', 'a', 'c', 'r', 'x', '9343', 'k', 'y', 'n', 'q', '8755', '3053']
Output:
| [
"a, c, e, h, j, k, n, p, q, r, u, x, y"
] | task636-337c48eed4e2438eb48a1b5db3bdb942 |
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: ['l', '4183', 'e', 'a', 'i', 'y', '2777', 'i', 'i', 'u', '3065', 'l', '8229', 'v', 'u', 'k', '3541', '501', '5497', 'q', '2859', 's', 'q', 'm', '8751', 'i']
Output:
| [
"a, e, i, k, l, m, q, s, u, v, y"
] | task636-383fd65aa5d74a48a24db8b8c4eb129f |
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', 'f', 'j', 'i', '1557', '2849', 'm', '2531', '6845', '6765', '9211', 'q', 'p', 'x', 'h', '237', 'r', '4041', '6871', 'q', '2715']
Output:
| [
"f, h, i, j, m, p, q, r, x"
] | task636-cb525e18c5b94135a71c2bf69c90467e |
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: ['7043', 'e', 'g', '1165', '6133', '3795', '8583', 'p', '4733', 'm', 'j', '8503', '5305', 'a', '7525', 'c', '3509', '1213', '7993', '3367', 'r', '6583', '5441']
Output:
| [
"a, c, e, g, j, m, p, r"
] | task636-c721c63a75ce4ffb83ee2a1f1d05479f |
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: ['8165', '389', '2875', '3327', '9739', '7437', 'r', '9931', '5', '6497', 'i', '55', '6053', '4195', '809', 'a', 'd', '1471', '3485', '7543', 'u', '8625', 'q', '767', '3517', '1565', '975', '9339', '5549', 'n', '8259', 'n', 'r', '1135', '9057']
Output:
| [
"a, d, i, n, q, r, u"
] | task636-4bda3a0b9ccb4328933b735f966bae5c |
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', 's', '7189', '2053', 'l', '301', '9227', 'd', 'k', '5467', '573', 'b', 'b']
Output:
| [
"b, d, k, l, s"
] | task636-c44807250fc64dd3b8e5961943292660 |
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', 'n', 't', 'c', 'n', '2513', '7637', '3537', '7187', '3687', 'z', '7671', '8253', '491', 'a', 'e', 'f', '9447', '9465', '8171', 'i', '7687', '9853', '615', '6335', 'n', 'b']
Output:
| [
"a, b, c, e, f, i, n, t, w, z"
] | task636-6ad7fea9e5124ca18963554a1b0ad15f |
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: ['4305', '8849', '4407', 'q', 't', 'q', '939', '7249', '7119', 's', '5927', '2569', '6373', '8687', '1757', '3209', 'f', 'j', '2903', '8295', '7983', '6219', 'h', 's', 'p', '1317', '5819', '5515', 't', '2507', '7011', '5391', 'o', '631', 'c']
Output:
| [
"c, f, h, j, o, p, q, s, t"
] | task636-478a0c4cf8da4419801a9069afc641f9 |
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: ['l', '9745', 'g', '8427', '8803', 'b', '7439', 's', '9349', 'z', '4921']
Output:
| [
"b, g, l, s, z"
] | task636-c288ebb0f39744eaa12fdcdb501b21c3 |