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: ['p', '9807', '6995', '7543', 'y']
Output:
| [
"p, y"
] | task636-2868ceec845947099c328c622c5803b9 |
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', '1217', '449', 'n', 'e', 'o', 't', '9043', '1925', '5687', '7197', '7943', 'u', '5053', 'q', 'e', '89', 'l', 'h', '3083', '4295', 'o', 'n', '6309', '743', 'n', 'j', '2105', 's', '6845', 'p', 'p', '1355', '3757', 'v', 'f', '961', '4623', '4633', 'p', '4593', 'p', '7337', 'o', 'u']
Output:
| [
"e, f, h, j, l, n, o, p, q, s, t, u, v"
] | task636-5ddb56b86e2b40b6bfef26a9a18b4b8c |
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: ['7331', '9121', '4905', '2151', '8145', 'r', '8229', 'v', 'z', '1099', '1403', 's', 'b', 'j', '2265', 'm', '4183', '2225', 'u', 'v', '7593', '3125', '643', 'i', '9657', '2011', '4325', '9319', 't', '4225', '193', 'o', 'l', '2459', '2069', '331', '9663', 'j', 'v', 'u', 'd', '9231']
Output:
| [
"b, d, i, j, l, m, o, r, s, t, u, v, z"
] | task636-04b5012515ea49de9b8deee48e12c805 |
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', '9125', 'u', 'q', 'v', '2011', '8023', 'a', 'r', '4275', '1535', 'c', '2143', 'm', 'y', '6241', 'a', 'j', '9483', '1225', '483']
Output:
| [
"a, c, j, m, q, r, u, v, y"
] | task636-db709cf426364c57ad8f429165a3f34d |
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: ['5011', '79', '9533', 'l', 'g', '3785', '6095', 'f', '2573', 'h', 'b', 'r', 'u', '319', 'c', 'z', '9973', '9261', '5279', 'j', '8385', '9161', 'b', 'm', '1883', 'v', 'r', 'e', 'x', 'n']
Output:
| [
"b, c, e, f, g, h, j, l, m, n, r, u, v, x, z"
] | task636-630998d1983e47c08e7d82c741f69fe9 |
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: ['4397', 'h', '8647', '469', '5723', 's', 'd', '9479', '4871', 'z', 'b', '7191', '1143', '3619']
Output:
| [
"b, d, h, s, z"
] | task636-a995ce253b0d461181f48855e6553b9d |
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', 'c', 'l', 'l', '179', '6159', '7369', '331', 'f', 'n', 'v', 'u', 'd', '139', 'h', '8981', 'h', 'y', '5809', '1223', '1089', '3939', 'u', '3309', '8627', 'q', 'e', 'l', 'c', '1569', '4319', '4417', '7615', '6449', 'c', 'k', '5363', 'q', '9193', 'd', '8423', '3883', 'c', '65', '9365']
Output:
| [
"c, d, e, f, h, k, l, n, q, u, v, y"
] | task636-d63cf880d50c4bb297138d355e9657ad |
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', '3023', '7413', 'x', '5983', 'n', 'r', '9681', '3853', 'f', '3675', 'e', 'h', '3915', 'u', '2035', '4789', '4105', 'd', 'b', 'b', 'f', 'r', 'k', 'g', '2223', '5493', '2583', 'g', '6653', '5997', 'z', '9725', '8267']
Output:
| [
"b, d, e, f, g, h, k, m, n, r, u, x, z"
] | task636-976b0b3af0754cd6ad324f808859f6be |
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', '803', 'w', '6921', 'g', '8277', 'p', 't', '3867', 'n', '6533', 'h', 'd', 'x', 'w', 'f', '7191', 'm', 'a', 'f', 'b', '4269', 'h', 'm', 'z', '3901', 'g', '5923', '7253', '8497', '4145', '453', '909', '6301', '9195', '6907', '4791', '1845', 'l', '9409', '1427']
Output:
| [
"a, b, d, f, g, h, l, m, n, p, t, w, x, z"
] | task636-12c77cf34924462b82649c876af5cfef |
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: ['165', 'j', 'v', 'i', 'j', '4983', 'o', '8131', 'y', 'r', '6795', '7517', '5253', '5663', '1837', 'r', 'k', 'y', '1169', '1015', '9785', 'b', '4551', '8299', '3781', 'z']
Output:
| [
"b, i, j, k, o, r, v, y, z"
] | task636-96bc32ec23cb481b96d89d61bbc8a937 |
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', 's', '3911', '6993', 'm', '5779', 't', '8007', '8787', '3463']
Output:
| [
"m, s, t"
] | task636-01ce3fe57ff24887a44888047f5942e7 |
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: ['4611', '7213', '2369', 'c', 'g', 'z', '7405', '4837', 's']
Output:
| [
"c, g, s, z"
] | task636-18f8c3f95384464c998d2df1e46fde7d |
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: ['9199', 'x', 'v', 'n', 't', 'i', 'u', '5669', 'a', '249', 'r', '5191', '3743', '9711', 'w', 'n', '9629', 'q', 'b', 'e', 'c', 'u', '271', 'q', '8653', 'b', '6941', 'r', '3907', '9973', '1841', '2621', 'q', '8563', '3829', 'x', '8621', '6009', '3291', '2703', '7399']
Output:
| [
"a, b, c, e, i, n, q, r, t, u, v, w, x"
] | task636-0c7d4eb36efd46859c1510626475ee95 |
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: ['5249', '3915', '1013', '5083', 'g', 'g', 'e', '4603', '7463', 'k', 'p', 'b', 'm', 'x', '5185', 't', 'w', '1289', '8527', '9555', '6365', '5757', 'n', 'l', '8681', '7199', 'x', '6393', '6729', 'f', 'c', 'r', '3291', 'k']
Output:
| [
"b, c, e, f, g, k, l, m, n, p, r, t, w, x"
] | task636-82b91172345d4383a6ca59de5863919a |
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: ['8403', 's', 'f', '5849', '9727', 'x', 'p', '1067', 'n', 'c', '9481', '9687', 'q', '445', 'q', 'u']
Output:
| [
"c, f, n, p, q, s, u, x"
] | task636-92d996e0e6654d40994b2a25d52aae3d |
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: ['4653', 'e', 'c', 'j', '6739', '3963', 'q', '4649', 'v', 's', 'j', '9757', '8075', '6253', '4365', 's', '9101', 'd', '6989', 't', '5687', '7389', '139', '4029', '5073', 'q', 'e', '2455', '1075', 'j', '1329', 'l', '4689', 't', 'z', '4179', 's', 'l', 'w', 'n', '6569', '8907', 'v', '605', 'y']
Output:
| [
"c, d, e, j, l, n, q, s, t, v, w, y, z"
] | task636-e34dab20c41a45daa7c83e293b7846e9 |
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: ['343', '569', '319', 'e', '9111', '3295', 'r']
Output:
| [
"e, r"
] | task636-3deaf627846e4aec814a49dc16b2603c |
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', '8161', '7331', 'b', 's', 'y', '533', '2595', 'o', 'b', '2627']
Output:
| [
"b, g, o, s, y"
] | task636-ec43790e3f274bce9d33d2e99335d40c |
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', 'y', '9297', '7047', '1131', '9585']
Output:
| [
"r, y"
] | task636-5c7f491dda994808985c0de9a4f55311 |
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', '3579', 'b', '5389', 'f', '9767', '441', 'a', 'c', 't', 'v', 'y', 'e', '6403', 'u', 'i', 'c', 'q', '621', 'j', 's', 'c', '3325', 'i']
Output:
| [
"a, b, c, e, f, i, j, q, s, t, u, v, y"
] | task636-60e1384edf5a46d185e19aa92ec56336 |
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: ['1819', '3579']
Output:
| [
"-1"
] | task636-6f941e91a95a420ca7f39ce7b4d46b11 |
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', 'q', '7623', '3185', '2917', '19', 'v', '2171', '1023', 'k', 'i', '4327', 'm', 'n', '4055', 't', '4181', '5695', '9295', 'w']
Output:
| [
"i, k, m, n, q, t, v, w"
] | task636-112efb46994245c19bc93dedda0cade7 |
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', '7669', 'u', '6403', '3485', '9357', '5109', '6103', 'q', '5317', 'i', '6855', 'x', '9921', 'w', 'u', '2091', '7121', '3657', 'q', 'h', 'a', '2885', 'n', 'm', '6817', 'h', '2891', 'f', '4853', '85', '3893']
Output:
| [
"a, f, h, i, m, n, o, q, u, w, x"
] | task636-d0d797c7bd2c48f898a5f068a81f11d2 |
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: ['6281', '5189', '7821', '3179', '3679', '4391', '3313', '6673', 'w', '5631', 't', 'h', 'e', 'h', 'r', '9787', 'r']
Output:
| [
"e, h, r, t, w"
] | task636-6dfade7d95ff4e9dadfdcf086d94d949 |
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: ['6935', '5553', '2661', 'u', 'o', '2803', '2497', 'w', '3107', '6797', '445', '2469', '2649', '3027', '947', '8787', 'm', 'q', '6611', 'c', '9585', 'l', '9879', 'd', 'v', 'q', '3947', 'r', 'r', '9637']
Output:
| [
"c, d, l, m, o, q, r, u, v, w"
] | task636-2c084d46b39b4fb78538d9e245f1de64 |
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: ['6555', 'e', '7985', 'j', 'd', '8133', 'f', 'y', 'u', '1875', 'e', '9639', 'd', 'n', 'd', 'v', 'o', 's', '7607', '7401', 'p', 'v', 'r', '4385', '4287', '2699', 'k', '1859', 'z', '839', 'm', '1897', '4287', 'f', '2429']
Output:
| [
"d, e, f, j, k, m, n, o, p, r, s, u, v, y, z"
] | task636-be1f757be30d4083809901d347a4cb78 |
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', '8431', 'c', 'g', 'c', '8391', '9385', '7529', 't', 'x', '6033', '3579', '6905', '445', 'i', '2707', '4327', '7533', '7381', '1677', '8859', 'a', 'f', 'n', '5127', 'l', '7407', 'f', '5591', 'b', '4109', '6367', 'h', '1045', '7841', '7785', 'v']
Output:
| [
"a, b, c, f, g, h, i, l, n, t, v, x"
] | task636-29d62f91cd15482db9cdd12a2c5316b4 |
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: ['4423', 'u', '189', '7167', 'e', 'n', '1289', 'r', '5423', '9105']
Output:
| [
"e, n, r, u"
] | task636-3a183df92142484bbf455fa6e54f8f86 |
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', '4603', 'm', '6447', 'q', '1277', 'q', '2933', 'i', 'z', '6211', 'k', 'c', 'h', 'e', '9849', '1369', '9957', '5029', '9729', '6477', 'w', 'd', '3303', 'n', 'v', 'b', '4595', 'v']
Output:
| [
"b, c, d, e, h, i, k, m, n, q, v, w, z"
] | task636-58af110845904c608b0c80cace47c3c7 |
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: ['8699', '9373', 'i', 'g', 'i', '4935', 'i', '5191', 'y', 'k', '5277', '3367', '6005', '6025', 'j', 'r', 'y', 'g', 'e', 'b', 'v', 'l', '6367', '5947', '2533']
Output:
| [
"b, e, g, i, j, k, l, r, v, y"
] | task636-024dda918e0a4544a738cc6edf43520b |
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', '3423', '8971', 's', '6385', 's', '1735', 'x', 'h', '4759', 'y', 'p', '6507', '2131', 'm', 't', 'p', '2625', '9269', '5725', '67', '2449', 'u', 'v', '1417', 'c', '1303', '1353', '5877', '2097']
Output:
| [
"c, h, m, p, q, s, t, u, v, x, y"
] | task636-9bfac5a8b35d4f1d9a4c29dfd4bb5d95 |
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', '5211', '2055', '7985', 'a', 'e', 'u', '259', 'r', 'a', 'x', 'g', '2659', 'y', '5621', '153', '2453', '4103', '5605', '5273', 'a', 'v', '8329', '2811', '8285', 'p', '3979', 'k', '2933', '857', '4823', 'w', '5765', '9229', '8299', 'r', 'o', 'c']
Output:
| [
"a, c, e, g, k, o, p, r, s, u, v, w, x, y"
] | task636-805776bfb9bd40a0a214236556480ec2 |
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', 'f', 's', 'b', 'b', '1479', 'r', '4277', 's', '7729', 'j', '8405']
Output:
| [
"b, f, j, r, s"
] | task636-2fc4025319cc4ec0804460d6fb481465 |
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', '951', '525', '3449', 'p', '8829', 'v']
Output:
| [
"p, v, w"
] | task636-0bc5b456dbe442ed9de6d086d703ab62 |
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: ['9409', '8861', '5517', 'e', 'l', '3159', 'c', 'd', 'i', '7009', 'y', '5129', '635', 'b', '7481', 'e', 'x', '8417', 'p', 'e', '5475', 'l', '8869', '9519', '3285', '2827', 'z', '6125', 'j', 'i', 'x', 'u', 'u']
Output:
| [
"b, c, d, e, i, j, l, p, u, x, y, z"
] | task636-0746f5f73a4e4b2d93df9e9237fa57ab |
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', '7269', '5577', '9171', '6739', 'n', '4285', 'd', '3497', '311', '5383', 'q', '9675', 'w', 'm', 'v', '9169', 'g', 's', 'u', '4777', 'w', '9823', '1113']
Output:
| [
"d, g, m, n, q, s, u, v, w"
] | task636-735cb12626af4ab1979e8f9dcca41c8e |
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', '7391', '3687', 'x', '3091', '4935', 'a', 'x', '4419', 'i', 'q', '551', 'w', '1297', 'c', '9893', 'q', 'k', '351', 'x', '3335', '2641', 'o', '3439', '4031', '707', 's', 'y', '5283', 'm', '4483', 'x', '785', 'p', 'v', '5787']
Output:
| [
"a, c, i, k, m, o, p, q, s, v, w, x, y"
] | task636-b46bc8efb59744c8b74d6328ccc6ca5c |
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: ['5059', '9737', 'f', '9259', 'j', '587', '6937', 'e', '4893', 'y', 'i', '8175', '883', 's', '5181', 'w', '1705', 'g', '3161', 'i', 'i', 'u', '7927', 'w', '833', '5279', '8747', 'u', 'c', '3621', 'u', 'o', '5931', '2371', '6059', '6709', '3387', 'j', 'n', '9975', '1601', 'm']
Output:
| [
"c, e, f, g, i, j, m, n, o, s, u, w, y"
] | task636-1755de1c556840df92c01f9c87b22028 |
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: ['2781', '7229', 'm', 'z', '2867', 'n', '5613', 'c', '6897', 'b', '771', '905', '3497', 'p', '6031', 'o', 'u', 'q', 'f', '577', '5699', '7211', '9377', '8327', '6251', '5953', '8257', 'c', '3117', 'j', 'i', 'v', '1861', '2217', '1509', 'z', '2807', 't', '123', 'j', '8473']
Output:
| [
"b, c, f, i, j, m, n, o, p, q, t, u, v, z"
] | task636-0610d9a7b22d4cb092da3acec2b59f1c |
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', 'x', 'z', '5705', '4669', '8559', '6771', 'g', 'n', '5027', '8775', 'x', '1421', '4009', 'g', 'm', 'c', 'i', 'b', 't', '513', '3879', '5141', '2865', 'i', '2559', '2135', 'p', '2153', 'd', '393', '2821', '3009', '821', '353', '2041', '9081', '3665', '4757', '2247', 'b']
Output:
| [
"b, c, d, e, g, i, m, n, p, t, x, z"
] | task636-d3f68ded3b3746229c482405dff6df1e |
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: ['9789', 'k', 'w', 'j', '5965', '8869', 'r', 'q', '1779', '679', 'g', 'l', 'f', 'o', 'a', '8339', '7715', '3687', '6967', '1175', '6569', 'd', '5593', 'x', 't', '205', 'b', '4039', 'w', '5993', '4527', '7335', '5601', 'q', 'o', '4725', '7553', '3219', 'e', 'n', '913']
Output:
| [
"a, b, d, e, f, g, j, k, l, n, o, q, r, t, w, x"
] | task636-05b42faf0ea84101ba875c0bfca95024 |
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', 'r', '2959', '2517', 'a', '9959', '729', '511', 'y', 'r', '465', 'c', '687', 'm', 'b', 'm', '3449', '9713', 'g', '8275', '8823', 'a', 'z', 'w', '2185', '6283', '8457', '8137', '7163', '8329']
Output:
| [
"a, b, c, g, m, r, t, w, y, z"
] | task636-4606e6f4390041a9bb2e002d7b914d9e |
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', '4265', '7595', '5439', '2961', '9599', '7569', 'a', 'y', 'l', 't', 'b', 'f', 'n', 'j', '2447', '315', 'l', '571', 'w', 'p', '9887', 'i', 'p']
Output:
| [
"a, b, f, i, j, l, n, p, t, w, y"
] | task636-c699e0625d1d436b89039c791aa10c67 |
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', 'h', 'w', '4761', 'b', '1223', 'q', '2587', '6769', '4745', 'u', 'h', '1', 'k', 't', 'h', 'h', 'p', 'x', 'x', '8857', '8259', '1593', '8919', '4673', 'x', 'f', '2353', '7233', 'g', '6857', '7419', 'x', 'e', '7153', 'z', '2255']
Output:
| [
"b, e, f, g, h, k, p, q, t, u, w, x, z"
] | task636-a0bc9724d1604080a757918aa56c034c |
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', 'b', 'g', 'g', 'a', 'n', '3981', 'w', '6339', 'l', 'j', '8273', 'u', 'k', 'k', 'w', '4017', 'j', 'd', '8911', '7429', '6937', '2879', 'h', '605', '3545', 'b']
Output:
| [
"a, b, d, g, h, j, k, l, m, n, u, w"
] | task636-e2034c37ded04a89b246515defefde62 |
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', '9127', 'f', 'i', 'n', 'p', '687', 'e', 'h', 'o', 'b', '2947', '45', '1961', 'd', 'w', 'q', 'p', '5109', 'w', 'e', '9861', 'w', '617', '7047', '945', '8415', 'g', '5953', 'r', 'h', 'k', 's', '4273', '1327', '4347', 'w', 'z', '7745', '9919']
Output:
| [
"b, d, e, f, g, h, i, k, n, o, p, q, r, s, w, z"
] | task636-d6fe1a2e5cec41d59dd3e32962801692 |
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', 'p', '6359', '8863', '5839', '1331', 'm', '9435', '1721', 'n', 'o', '243', 'b', '8377', '9281', '8103', 'b', '8893', 'w', '4463', 'b', 'f', 'p', 'r', 'k', 'b', 'k', 'q', '83', '2777', 'z', 'i', 'g']
Output:
| [
"b, f, g, i, k, m, n, o, p, q, r, v, w, z"
] | task636-3852e9e559c64fd69874f1dc3022baf6 |
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', 'c', 'r', '4459', 'o', '1407', 'x', '1515', '331', 'm', '1535', 'p', 'u', 'g', '2513', 'o', '7827', '8149', 'd', 'z', 'q', '5655', 'x', '9997', '2809', 'g', 'h', '6309', 'a', 'j', '9773', '2115', 't', '9113', 'q', 'o', '427', 's', '3815', '5423', 's', 'n', 'i', 'o', '3643']
Output:
| [
"a, c, d, g, h, i, j, m, n, o, p, q, r, s, t, u, x, z"
] | task636-cbf5ffab95b44415a038b0d91c100677 |
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', 'n', 'o', '3937', 'w', '5439', '7235', 'r', '841', 'q', '1881', '6131', 'i', 'c', '8903', '8145', '6035', '2591', '8729', '9445', 't', 'l', 'v', '2479', 'c', 'q', 'i', 'j', '1405', 'f', 'n', 'u', '381', 'd', 'j', '6823', '1351', '2087', '6813']
Output:
| [
"c, d, f, i, j, l, n, o, q, r, t, u, v, w, y"
] | task636-946e6b5179ed4fe496bf373872fc5192 |
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', '1199', '111', '5613', '4887', 'b', '5791', 'n', '1905', '8331', '4067', 'u', '5849', 't', 'c', 'g', 'v', '21', '1965', '6163', 'k', '9845', '9527', '6377', '1159', 'v', 'k', '119']
Output:
| [
"a, b, c, g, k, n, t, u, v"
] | task636-7b45b4803c794180b61dbd03fbd3c9e9 |
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', '4803', '2629', '2715', '5779', 'y', 'u', '6481', 'g', 'h', '8029', '127', 'o', 'p', '7347', '9645', 'z', 'a', '3585', 't', '9155', 'o', '5201', 'c', 's', 'j', 'i', 'v', 'm', '3605', '3571', 'a', '2955', 'h', '6295', 'r']
Output:
| [
"a, c, g, h, i, j, m, o, p, r, s, t, u, v, y, z"
] | task636-4137ae665edd4514be3446c066b30f5b |
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', 'e', '5963', '3811', '6367', 'm', '1905', 'z', '6301']
Output:
| [
"e, k, m, t, z"
] | task636-087b211aafe34aef8d3f1f9201dbe6ce |
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: ['1983', '1835', '6543', '6399', '4177', '9385', '7127', 'p', 'l', 'u', 'g', 't', '3423', 'g', 'b', 'l', '3133', '2429']
Output:
| [
"b, g, l, p, t, u"
] | task636-8bb839d5d9cf4e2e82645c7462a51d1b |
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: ['9751', '4497', '1631', 'n', 'a', '3567', 'z', '2059', 'k', 'x', '2613', '1393', 'j', '9985', '4089']
Output:
| [
"a, j, k, n, x, z"
] | task636-206d4afd32ea4fb1a85793c755bf43a4 |
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', '8127', '7519', '4543', '2809', '9855', 'n', '6241', 'w', 'w', 'q', 'w', 'p', '8599', '7819', '3817', 'm', 'q']
Output:
| [
"m, n, p, q, w"
] | task636-cd96c7f8115c402abe01cb6c98c5385f |
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: ['9473', 'j', 'p', 'q', 'x', '7569', 'd', 't', 'w', '9129', '735', '7389', 'a', '219', 'g', '133', '3275', '6675']
Output:
| [
"a, d, g, j, p, q, t, w, x"
] | task636-a09e6e3986c2474d9b75e5d1bd1fd08d |
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', '5217', 'f', 'y', 'i', 'r', 'y', 'q', '3553', 'k', 't', '9263', 'e', '5331', '715', 'm', '7843', '3623', 'y', '3355', '6307', '9967', '7291']
Output:
| [
"e, f, i, k, m, q, r, t, v, y"
] | task636-f5f4d4106ee3490d886b6ae5cdb6ce9f |
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: ['3473', '4851', '1953', 's', 'k', 'f', 'p', 'm', 'e', 'e', '8097', '4159']
Output:
| [
"e, f, k, m, p, s"
] | task636-73d42e4b017c4667bea6ec3c3efbbdf6 |
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', '3421', 'z', '1083', '5999', '4157', '6901', '9295', 'q', '3425', 'x', '5239']
Output:
| [
"m, q, x, z"
] | task636-495a7c879fbb4724adbd9a5f696f25f7 |
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: ['8829', 'm', '5369', 'q', '5737', '7799', '5705', 'p', 'w', '1983', '4849', 'h', '6771', 'p', 'y', '1071', 'u', '6401', '7723', 'p']
Output:
| [
"h, m, p, q, u, w, y"
] | task636-22448db7cc3a411f95e9a159b70a21bf |
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: ['6693', '5355', 'w', '151', '9637', 'y', '4935', '7519', '2965', '4137', '4289', '717', '7367', 'f', 'h', '9223', 'u', '8333', 'j', '7501', 'd', '4407', '651', '7745', 'y', 'i', '2993', '8521', '2101']
Output:
| [
"d, f, h, i, j, u, w, y"
] | task636-40616305ff6d478892ed99e9c87488e3 |
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: ['2267', '3121', '8189', 'j', 'h', '9455', '4181', 'o', 'h', '2605', '2491', 'n', '9657', '6057', 'e', 't', '8725']
Output:
| [
"e, h, j, n, o, t"
] | task636-aae7d61ffb9e4cbd8abd0ff98f49dd8b |
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', '217', 'o', '9005', '1717', '9573', 'q', 'z', '6113', '8519', '5795', 'b', '6467', '8685', '6203', 'm', '2827', '1917', '8889', 'a', 'x', 'y', 'q']
Output:
| [
"a, b, i, m, o, q, x, y, z"
] | task636-743f5e5265ad4c7c8db160e8845ddf39 |
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: ['6981', 't', 'm', '1265', '6949', 'j', '6507', '311', 'c', '9963', '9555', '4623', '7429', '2657', '193', '5369', 'x', 'w', '6581', '7703', 'e', '4419', 'p', '1825', '2689', '9623', '9909', 'w']
Output:
| [
"c, e, j, m, p, t, w, x"
] | task636-c0e12806244145068448daf54701653b |
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', 'f', '5507', '7319', 'd', 'v', '8589']
Output:
| [
"d, f, v, y"
] | task636-b3deebb2b6b84995951f41e79f068c00 |
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: ['9483', '501', 'j', 'k', '3103']
Output:
| [
"j, k"
] | task636-bbf3762ac1e645e6a43eaddd3552f93c |
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: ['5089', '281', 'q', 'l', '1745', '4217']
Output:
| [
"l, q"
] | task636-3cdd5300278d49a88f62c254662a8cc5 |
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: ['5515', '575', 'w', 'm', '8189', '2069', 'f', 'g', '867', 'i', '1265', 'y', 'x', '9071', 'o', '8945', '6149', 'i', '1425']
Output:
| [
"f, g, i, m, o, w, x, y"
] | task636-db7524052d874cc9855724f6150cfa0c |
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: ['8927', 'k', 'o', '1169', 'z', 'l', 'i', '3883', 'z', '4163', 't', '4891', 'x', 'e', '1235', 'k', '3967', '6027', 's', '5537', 'i', '6021', '8689', '1127', 's', '4487', '4841', 'n', 'f', '6037', 'n', '5013', '885', '3605', 'w', 'b']
Output:
| [
"b, e, f, i, k, l, n, o, s, t, w, x, z"
] | task636-6283e4f410314a5faa8a47f9920c6d70 |
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: ['8261', 'h', '9201', 'd', 'e', '8081', '6789', 'w', 'h', '1991', '1661', '1461', '8455', 'n', '1379', 'x', '6919', '9417', 'n', '4271', 'j', '247', '2859', 'i', '9053', 'f', '7091', '2703', 'v', 'd', 'a', 'l', 'c', '387', 'p', '2717', 'g', 'r', '8235', '2865', '6491', 'a', 'x', '7637']
Output:
| [
"a, c, d, e, f, g, h, i, j, l, n, p, r, v, w, x"
] | task636-e0f6f291a4834baea1cb65c7e11bfd67 |
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: ['7461', 'n', 't', 'k', '4025', '2507', 'i', 'c', '4649', '4949', '9435', 'n', '5257', 'e', '7141', 'l', 'n', 't', '1493', 'k', '4697', '3509', '143', 'c', 'n', 'g', '6917', '6591', 'b', 'k', 'f', '5323']
Output:
| [
"b, c, e, f, g, i, k, l, n, t"
] | task636-68c48ad6195a4960bff272b767d4ef37 |
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: ['6251', 'e', 'z', 'v', '1465', 'r']
Output:
| [
"e, r, v, z"
] | task636-f4a51f585dda4d4da6683b9ea7edbe7d |
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: ['2947', '2339', 'w', '2571', '5289', 'd', 'd', 'd', '4745', '2333']
Output:
| [
"d, w"
] | task636-2141a219de0b41ad9ae2b6a2b4cc11c8 |
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', '9695', '329', '7913', 'i', '3601', '4805', 'o', '3991', '4607', '6541', 'z', '5801']
Output:
| [
"f, i, m, o, z"
] | task636-f66fb06b7e2a47939fceeac63317dcfc |
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: ['1187', '5513', '7277', 's', 'i', '9485', 'l', '3121', '235', 'd', '1161', 'o', 'f', '8355', 'h', 't', '2005', '7837', '4669', '3009', 'j', 'v', 'h', 'r', 'k', 'x', '9543', 'k', 'c', '4855', 'e']
Output:
| [
"c, d, e, f, h, i, j, k, l, o, r, s, t, v, x"
] | task636-8c9b5f987fa343aea0ac26343e89be2f |
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', '3445', 'l', 'd', 'q', 'w', '5909', '1335', 'r', '8947', 'z', 'g', 's', '491', '2087', 'c', 'f', 'j']
Output:
| [
"c, d, f, g, j, l, o, q, r, s, w, x, z"
] | task636-9cf6a388fbd540b59608ed7a0e1045f1 |
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: ['8995', 'b', 'f', '9971', '9181', 'm', '2009', 'j', 'f', '5807', '6011', '2967', 't', '8397', '2033', 'u', 'q', '6985', '2523', '5611', '5919', 'e', '4149', '5167', 'v', '2895', '8447', 'x', 'm', '4419', 'h', 'q', '9409', '9581', 'l', '3679', '7597']
Output:
| [
"b, e, f, h, j, l, m, q, t, u, v, x"
] | task636-b3c1b46410ce436481d4cbc03750b8cd |
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: ['6871', '9901', 'h', 'g', '3141', 'z', '8559', '8095', '1515']
Output:
| [
"g, h, z"
] | task636-93cc9bdc302443b2a433446b77581f66 |
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: ['7649', '5017', 'b', 'd', '6373', '2999', 'v', '7621', '7311', 'h', 'k', '1203', '3437', 'g', 'f', 'q', '2361', 'i', '7241', 'w', 'd', '5597', '5695', 'p', 'a', 'j', '6725', '5631', 'y']
Output:
| [
"a, b, d, f, g, h, i, j, k, p, q, v, w, y"
] | task636-dc430ca9a5704dc1bc11b5b5854642ed |
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', '1305', '4045', 'f', '9457']
Output:
| [
"f, x"
] | task636-a8e724eb175d43c89a45ceb51bb5c304 |
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: ['6175', 'd', 'x', '9609', 'k', 'n', 'b', '6539', 'x', '1163', 'y', 'v', '725', 's', 'w', 'e']
Output:
| [
"b, d, e, k, n, s, v, w, x, y"
] | task636-9c72dd1f16b44a27bb97d2a402049a61 |
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', '7819', 'h', '7767', 'z', 'e', 'i', '8583', '5117', '3641', 'x', '9785', 'g', '7815', 'f', 'g', '7433', 'm', '9433', '1385', 'p', 'j', 'r', 'a', '1001', 'g', '6717']
Output:
| [
"a, e, f, g, h, i, j, m, p, r, t, x, z"
] | task636-bf641c155e1341b9b6df209c325060cb |
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', '459', 'y', '4663', '2047', '9523', '2295', 'l', 'e', '4547', 'q', 'n', '3777', 'n', 'y', '3009', 'h', 'e', '7475', '4007', 'b', 'm']
Output:
| [
"b, e, h, l, m, n, q, v, y"
] | task636-78f061586a39483ba1d3ca8df062b454 |
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', '4525', 'g']
Output:
| [
"g, j"
] | task636-8b178a01ed814571a8ef014c2e259d92 |
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: ['4201', '785']
Output:
| [
"-1"
] | task636-3933787fda154539bc300145ecde17e7 |
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: ['9527', '2091', 'n', 'p', '8125', '4537', '8713', '7221', 'f', '2981', 'k', 'u', 'o', 'c', 'v', '7585', '6921', '2291', 'a', '1473', '3013', 't', '5385', '1167']
Output:
| [
"a, c, f, k, n, o, p, t, u, v"
] | task636-c7b7a6322c0e41cda5df8320076c8495 |
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', 'u', 'w', '7289', 'u', 'i', '7819', '1791', '161', '8555', '1003', 'e', 'a', 'a', 'f', 'j', '2097', 'h', '9541', 'a', '3101', 'j', 'b', '3389', 'e', '6057', 'x', '9375', '9305', 'f', 'b', '1825', '5905', 'l', 'v', 'j', 'o', '2871', '8743', 'a', '8485', 'p', 'h', 'x', '2223']
Output:
| [
"a, b, e, f, h, i, j, l, o, p, s, u, v, w, x"
] | task636-f905ca919b28459996597e4e4084ce2c |
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', 'o', 'a', 'r', 'u', '3493', '7039', 'e', 'e', 'w', 'p', 'i', '27', 'i', 'o', 'c', 'j', '6283']
Output:
| [
"a, c, e, i, j, o, p, r, u, v, w"
] | task636-b52dda7765ed4634b245ffb2b8fa7a45 |
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: ['9247', 'o', '7017', '1203', '1021', 'c', '9319', '9553', '6495', 'b', '5423', 'o', 'j', '2793', '299', '1277', 'a', 'f', 'p', '2107', 'l', '1841', 'a', 'l', '1781', 'c', '1263', '6463', '1557', '4389', '8545', 'm', '1203', 'a', '9661', '9165', '9169']
Output:
| [
"a, b, c, f, j, l, m, o, p"
] | task636-3816147df65c462c89b18137beedaf6a |
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', 'o', 'o', 'd', 'k', 'k', 'i', '5497', '7517', 't', 'v', '7689', 'j', 'e', 'v', '1885', '2895', '2373', '9943', '7613', '1439', 't', 'm', 'e', '267', 'j', 'r', 'o', '8653', 'c', '4291', '5861', '4255', '4603', '4821', '9841', 'o', '847', 'b', 'a']
Output:
| [
"a, b, c, d, e, i, j, k, m, o, r, t, v"
] | task636-b12e95c9f6744ea891aa2b273e4c6dee |
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: ['6945', 'j', '2211', 'x', 'a', 'n', '4953', '7969', '2583', 'g', '9529', 'j', '8151', '9455', '6135', '2239', 'm', '5725', 't', '553', 'g', '4055', 'r', 'k', '6737', '7721', '257']
Output:
| [
"a, g, j, k, m, n, r, t, x"
] | task636-b57bb47e750d400aa110fc735b6d4289 |
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', 'c', 'u', 'r', '8181', '5407', '9209', 's', 'v', '5763', 'k', 'v', '9455']
Output:
| [
"c, k, l, r, s, u, v"
] | task636-f3d1b067afed43028056142cfc9994f3 |
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', '6283', '2953', 'd', 't', '3349', '2949', 'v', '6591', '8605', '1381', '7099', 'u', 'a', '5293', 'f', '3677', 'h', 'n', 'l', 'k', '8623', 'h', 'm', 'n', 'q', 'e', '8153', '1231', 'v', '6989', 'q', 'q', 'a', '5663', 'b', '5191', 'b', '8297', '6365', '5311', 'q', 'k', 'h']
Output:
| [
"a, b, d, e, f, h, k, l, m, n, q, t, u, v"
] | task636-5d069bedb1dd40808304a47d9b39d7d0 |
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: ['255', 'a']
Output:
| [
"a"
] | task636-dbe2a41904d64fda954611f130c9938c |
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', '459', 'p', 't', 'v', 'u', 's', 'q', 'o', 't', 'm', 'l', 'q', 'p', '359']
Output:
| [
"l, m, o, p, q, s, t, u, v"
] | task636-2b0cd835006d42c5b5f9377790cf1597 |
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', '5213', 'o', '6491', 'c', 'e', 'o', 's', '1733', 'm', '2781', '2821', 'r', '545', '2015', '2725', '3543', '8247', '3363', 'l', 'h', 'y', '19', 'c', '491', '6493', '6317', 'a', '7833', '4103', 'p', 'v', '37', '9169', '4945']
Output:
| [
"a, c, e, h, l, m, n, o, p, r, s, v, y"
] | task636-bce183f50e2c4a77b8cee9bce1745c8e |
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', '1569', 'q', '5439', '3183', '1511', '1337', '6367', '9367', 'x', 'w', '1567', 'a', 'z', '33', '4309', 'b', '5611', '21', 's', 'u', '4309', 'd', '4873', '1555', '6107', '5693', 'g', '4961']
Output:
| [
"a, b, d, g, q, s, u, w, x, z"
] | task636-a90d812516534e71b954017dec82556e |
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: ['5985', 'y', '4133', '4873', 'e', '997', 'z', 'c', 'a', '1391', '2421', 'i', '8771', 'q', 'j', '1699', '8503', '5775', 'o', '6239', 'b', 'p', '5613', 'h', 'm', '7465', 'o', '1541', '5133', '863', '829', '7999', '9635', '7429', '133', '5313', 'p', 'h', 'u', 'e', '5115', 'j', '2707']
Output:
| [
"a, b, c, e, h, i, j, m, o, p, q, u, y, z"
] | task636-a209e1bba2134863b4d16e85dd5b3929 |
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: ['5415', 'o', 'q', '4723', 'w', '2985', '5925', 'k', 'q', '9827', 'c', '6731', 'i', '5641', 'x', 'b', '165', 'z', 'i', 'p', '159']
Output:
| [
"b, c, i, k, o, p, q, w, x, z"
] | task636-d3f487589af44ebbabfa12364a1935d2 |
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: ['2961', 'a', 'k', '8447', '3629', '6307', 'k', '3267', 'm', 'o', '2475', 'k', '6677', 'd', '4049']
Output:
| [
"a, d, k, m, o"
] | task636-3cc7251d1be84f2f93b84bfcba838065 |