inputs stringlengths 260 531 | targets stringlengths 2 32 | _template_idx int64 0 9 | _task_source stringclasses 1
value | _task_name stringclasses 1
value | _template_type stringclasses 2
values |
|---|---|---|---|---|---|
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example input: [0,1,0,2,5,1]
Example output: [2,5]
Example explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Q: [6, 5, 5, 1, 3]
A: | [6, 1, 3] | 3 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[4, 2, 3, 1, 4, 6]
[2, 3, 1, 6]
[3, 4, 3, 3, 7, 1, 1, 7]
[4]
[6, 2, 5, 3, 2, 7, 0, 7, 5]
| [6, 3, 0]
| 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
instruction:
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
question:
[7, 6, 1, 5, 5]
answer:
[7, 6, 1]
question:
[0, 1, 4, 1, 4, 3, 1, 0, 6]
answer:
[3, 6]
question:
[1, 1, 6, 0, 6, 2]
answer:
| [0, 2]
| 9 | NIv2 | task097_conala_remove_duplicates | fs_opt |
instruction:
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
question:
[6, 5, 0, 3, 1, 7, 4]
answer:
[6, 5, 0, 3, 1, 7, 4]
question:
[5, 3, 3, 1, 2, 7, 2]
answer:
[5, 1, 7]
question:
[7, 4, 0, 3, 3, 3, 4, 0, 1, 2]
answer:
| [7, 1, 2]
| 9 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Part 1. Definition
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Part 2. Example
[0,1,0,2,5,1]
Answer: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Part 3. Exercise
[7, 5, 7, 2, 6, 4, 3, 3]
Answer: | [5, 2, 6, 4] | 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
One example is below.
Q: [0,1,0,2,5,1]
A: [2,5]
Rationale: The only elements that are not duplicated is 2 and 5. This is a good example.
Q: [4, 6, 7, 3, 6, 6, 1, 2, 6, 6]
A: | [4, 7, 3, 1, 2] | 9 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Given the task definition, example input & output, solve the new input case.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example: [0,1,0,2,5,1]
Output: [2,5]
The only elements that are not duplicated is 2 and 5. This is a good example.
New input case for you: [5, 5, 5, 0, 3, 3, 0, 4, 3, 0]
Output: | [4] | 1 | NIv2 | task097_conala_remove_duplicates | fs_opt |
instruction:
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
question:
[7, 2, 2, 6, 2, 6, 2, 2, 7]
answer:
[]
question:
[6, 0, 3, 0, 1, 2, 1, 2]
answer:
[6, 3]
question:
[1, 7, 0, 4, 3]
answer:
| [1, 7, 0, 4, 3]
| 9 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Part 1. Definition
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Part 2. Example
[0,1,0,2,5,1]
Answer: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Part 3. Exercise
[1, 7, 0, 4, 3]
Answer: | [1, 7, 0, 4, 3] | 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Part 1. Definition
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Part 2. Example
[0,1,0,2,5,1]
Answer: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Part 3. Exercise
[7, 2, 4, 2, 6]
Answer: | [7, 4, 6] | 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Ex Input:
[7, 7, 2, 7, 7, 3, 3, 2]
Ex Output:
[]
Ex Input:
[0, 1, 4, 1, 4, 3, 1, 0, 6]
Ex Output:
[3, 6]
Ex Input:
[0, 6, 4, 5, 7, 2]
Ex Output:
| [0, 6, 4, 5, 7, 2]
| 1 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Q: [7, 2, 2, 7, 1, 7, 4]
A: [1, 4]
****
Q: [6, 4, 4, 0, 5, 1, 7, 1, 3, 1]
A: [6, 0, 5, 7, 3]
****
Q: [1, 0, 1, 2, 7, 1]
A: | [0, 2, 7]
****
| 4 | NIv2 | task097_conala_remove_duplicates | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[0,1,0,2,5,1]
Solution: [2,5]
Why? The only elements that are not duplicated is 2 and 5. This is a good example.
New input: [2, 2, 0, 7, 0, 1, 7, 6, 4]
Solution: | [1, 6, 4] | 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Given the task definition, example input & output, solve the new input case.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example: [0,1,0,2,5,1]
Output: [2,5]
The only elements that are not duplicated is 2 and 5. This is a good example.
New input case for you: [4, 4, 5, 6, 4]
Output: | [5, 6] | 1 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Part 1. Definition
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Part 2. Example
[0,1,0,2,5,1]
Answer: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Part 3. Exercise
[4, 6, 7, 7, 6]
Answer: | [4] | 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
One example is below.
Q: [0,1,0,2,5,1]
A: [2,5]
Rationale: The only elements that are not duplicated is 2 and 5. This is a good example.
Q: [2, 7, 5, 3, 2, 0, 5, 0]
A: | [7, 3] | 9 | NIv2 | task097_conala_remove_duplicates | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[0,1,0,2,5,1]
Solution: [2,5]
Why? The only elements that are not duplicated is 2 and 5. This is a good example.
New input: [0, 2, 1, 2, 1, 7, 5, 3, 4, 4]
Solution: | [0, 7, 5, 3] | 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example Input: [3, 7, 5, 3, 5, 1, 7, 6, 4]
Example Output: [1, 6, 4]
Example Input: [4, 2, 1, 5, 6, 6, 0]
Example Output: [4, 2, 1, 5, 0]
Example Input: [6, 5, 5, 1, 1, 3, 3, 4, 5]
Example Output: | [6, 4]
| 3 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Let me give you an example: [0,1,0,2,5,1]
The answer to this example can be: [2,5]
Here is why: The only elements that are not duplicated is 2 and 5. This is a good example.
OK. solve this:
[0, 4, 3, 0, 0, 6, 0]
Answer: | [4, 3, 6] | 8 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Detailed Instructions: In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
See one example below:
Problem: [0,1,0,2,5,1]
Solution: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Problem: [1, 6, 4, 4, 3]
Solution: | [1, 6, 3] | 4 | NIv2 | task097_conala_remove_duplicates | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[0,1,0,2,5,1]
Solution: [2,5]
Why? The only elements that are not duplicated is 2 and 5. This is a good example.
New input: [4, 5, 3, 7, 7, 0, 5, 5]
Solution: | [4, 3, 0] | 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example: [0,1,0,2,5,1]
Example solution: [2,5]
Example explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Problem: [1, 0, 1, 7, 5]
| Solution: [0, 7, 5] | 5 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
One example is below.
Q: [0,1,0,2,5,1]
A: [2,5]
Rationale: The only elements that are not duplicated is 2 and 5. This is a good example.
Q: [5, 7, 4, 0, 4, 7, 7, 7, 6]
A: | [5, 0, 6] | 9 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Part 1. Definition
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Part 2. Example
[0,1,0,2,5,1]
Answer: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Part 3. Exercise
[0, 3, 1, 7, 4, 0, 3, 1, 7, 2]
Answer: | [4, 2] | 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Let me give you an example: [0,1,0,2,5,1]
The answer to this example can be: [2,5]
Here is why: The only elements that are not duplicated is 2 and 5. This is a good example.
OK. solve this:
[0, 0, 5, 3, 4, 6, 0]
Answer: | [5, 3, 4, 6] | 8 | NIv2 | task097_conala_remove_duplicates | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[0,1,0,2,5,1]
Solution: [2,5]
Why? The only elements that are not duplicated is 2 and 5. This is a good example.
New input: [3, 5, 4, 6, 2, 0, 7, 2, 1]
Solution: | [3, 5, 4, 6, 0, 7, 1] | 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Ex Input:
[3, 7, 2, 2, 1, 6, 3, 3, 5]
Ex Output:
[7, 1, 6, 5]
Ex Input:
[3, 6, 5, 1, 7, 7, 3, 5, 0]
Ex Output:
[6, 1, 0]
Ex Input:
[6, 6, 3, 1, 5, 2, 1]
Ex Output:
| [3, 5, 2]
| 1 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example Input: [6, 1, 7, 4, 1, 7, 3, 6, 0, 7]
Example Output: [4, 3, 0]
Example Input: [2, 2, 4, 7, 3, 5, 3, 6, 3, 3]
Example Output: [4, 7, 5, 6]
Example Input: [0, 0, 5, 3, 4, 6, 0]
Example Output: | [5, 3, 4, 6]
| 3 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
--------
Question: [4, 6, 0, 2, 1, 5]
Answer: [4, 6, 0, 2, 1, 5]
Question: [0, 7, 2, 0, 4]
Answer: [7, 2, 4]
Question: [6, 6, 2, 6, 5]
Answer: | [2, 5]
| 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Part 1. Definition
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Part 2. Example
[0,1,0,2,5,1]
Answer: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Part 3. Exercise
[1, 7, 2, 2, 5, 5]
Answer: | [1, 7] | 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
TASK DEFINITION: In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
PROBLEM: [7, 4, 5, 5, 5, 2, 6, 5]
SOLUTION: [7, 4, 2, 6]
PROBLEM: [4, 1, 2, 4, 2, 3, 6, 4, 7, 0]
SOLUTION: [1, 3, 6, 7, 0]
PROBLEM: [4, 2, 0, 6, 2, 0, 3, 4, 2, 2]
SOLUTION: | [6, 3]
| 8 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[5, 1, 6, 4, 3]
[5, 1, 6, 4, 3]
[3, 2, 7, 5, 2, 4, 7]
[3, 5, 4]
[1, 7, 2, 2, 5, 5]
| [1, 7]
| 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Given the task definition, example input & output, solve the new input case.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example: [0,1,0,2,5,1]
Output: [2,5]
The only elements that are not duplicated is 2 and 5. This is a good example.
New input case for you: [6, 2, 7, 5, 4, 2]
Output: | [6, 7, 5, 4] | 1 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Given the task definition, example input & output, solve the new input case.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example: [0,1,0,2,5,1]
Output: [2,5]
The only elements that are not duplicated is 2 and 5. This is a good example.
New input case for you: [1, 7, 0, 5, 6, 4, 5]
Output: | [1, 7, 0, 6, 4] | 1 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[Q]: [1, 2, 4, 7, 2]
[A]: [1, 4, 7]
[Q]: [1, 1, 3, 0, 1, 4, 1, 6, 7, 3]
[A]: [0, 4, 6, 7]
[Q]: [3, 4, 7, 2, 6]
[A]: | [3, 4, 7, 2, 6]
| 5 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Part 1. Definition
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Part 2. Example
[0,1,0,2,5,1]
Answer: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Part 3. Exercise
[1, 2, 4, 6, 7, 4, 6, 3, 6, 4]
Answer: | [1, 2, 7, 3] | 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Q: [2, 0, 2, 3, 7, 6, 1]
A: [0, 3, 7, 6, 1]
****
Q: [7, 3, 7, 6, 6, 5, 6, 2, 5, 6]
A: [3, 2]
****
Q: [0, 5, 0, 3, 1, 2]
A: | [5, 3, 1, 2]
****
| 4 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
One example: [0,1,0,2,5,1]
Solution is here: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Now, solve this: [5, 6, 0, 2, 5, 6]
Solution: | [0, 2] | 6 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Ex Input:
[6, 6, 5, 2, 1, 5, 2, 4]
Ex Output:
[1, 4]
Ex Input:
[0, 7, 5, 4, 7, 7, 0, 6, 0]
Ex Output:
[5, 4, 6]
Ex Input:
[5, 6, 0, 2, 5, 6]
Ex Output:
| [0, 2]
| 1 | NIv2 | task097_conala_remove_duplicates | fs_opt |
instruction:
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
question:
[4, 1, 1, 5, 1, 1, 6, 7, 0]
answer:
[4, 5, 6, 7, 0]
question:
[1, 4, 5, 5, 0]
answer:
[1, 4, 0]
question:
[4, 4, 4, 0, 0, 3, 6]
answer:
| [3, 6]
| 9 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Input: Consider Input: [2, 1, 0, 6, 2, 2, 5]
Output: [1, 0, 6, 5]
Input: Consider Input: [2, 5, 5, 1, 2, 6, 4]
Output: [1, 6, 4]
Input: Consider Input: [3, 4, 7, 4, 3, 0, 1, 4, 5]
| Output: [7, 0, 1, 5]
| 2 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Ex Input:
[0, 4, 5, 7, 3, 2, 7, 1]
Ex Output:
[0, 4, 5, 3, 2, 1]
Ex Input:
[3, 0, 4, 2, 2, 0, 2, 4, 6]
Ex Output:
[3, 6]
Ex Input:
[5, 3, 4, 5, 4]
Ex Output:
| [3]
| 1 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example Input: [7, 2, 2, 7, 1, 7, 4]
Example Output: [1, 4]
Example Input: [6, 3, 1, 0, 2, 3, 3, 2, 1, 5]
Example Output: [6, 0, 5]
Example Input: [6, 0, 0, 1, 0, 7, 7, 1]
Example Output: | [6]
| 3 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Let me give you an example: [0,1,0,2,5,1]
The answer to this example can be: [2,5]
Here is why: The only elements that are not duplicated is 2 and 5. This is a good example.
OK. solve this:
[0, 5, 0, 3, 1, 2]
Answer: | [5, 3, 1, 2] | 8 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[Q]: [6, 7, 1, 0, 6, 2]
[A]: [7, 1, 0, 2]
[Q]: [5, 4, 3, 3, 0, 4, 4]
[A]: [5, 0]
[Q]: [2, 3, 6, 4, 0, 7, 6]
[A]: | [2, 3, 4, 0, 7]
| 5 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example: [0,1,0,2,5,1]
Example solution: [2,5]
Example explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Problem: [0, 4, 5, 2, 0, 7, 4, 7]
| Solution: [5, 2] | 5 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Part 1. Definition
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Part 2. Example
[0,1,0,2,5,1]
Answer: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Part 3. Exercise
[2, 1, 6, 5, 3, 0, 4, 5]
Answer: | [2, 1, 6, 3, 0, 4] | 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Given the task definition, example input & output, solve the new input case.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example: [0,1,0,2,5,1]
Output: [2,5]
The only elements that are not duplicated is 2 and 5. This is a good example.
New input case for you: [1, 6, 1, 2, 5, 2, 0, 2]
Output: | [6, 5, 0] | 1 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example Input: [5, 0, 4, 5, 7, 0, 0, 0]
Example Output: [4, 7]
Example Input: [2, 1, 3, 4, 1, 4, 7, 7, 4, 2]
Example Output: [3]
Example Input: [0, 6, 5, 4, 0, 2]
Example Output: | [6, 5, 4, 2]
| 3 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Part 1. Definition
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Part 2. Example
[0,1,0,2,5,1]
Answer: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Part 3. Exercise
[3, 0, 1, 2, 2, 7, 6, 3, 7, 7]
Answer: | [0, 1, 6] | 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Let me give you an example: [0,1,0,2,5,1]
The answer to this example can be: [2,5]
Here is why: The only elements that are not duplicated is 2 and 5. This is a good example.
OK. solve this:
[2, 3, 6, 4, 0, 7, 6]
Answer: | [2, 3, 4, 0, 7] | 8 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Q: [0, 0, 6, 1, 5, 4]
A: [6, 1, 5, 4]
****
Q: [3, 0, 4, 2, 2, 0, 2, 4, 6]
A: [3, 6]
****
Q: [1, 0, 2, 5, 2, 7, 2, 0, 6, 7]
A: | [1, 5, 6]
****
| 4 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
One example: [0,1,0,2,5,1]
Solution is here: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Now, solve this: [5, 1, 6, 0, 6, 4, 7, 5, 2]
Solution: | [1, 0, 4, 7, 2] | 6 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[EX Q]: [6, 3, 4, 1, 1, 1]
[EX A]: [6, 3, 4]
[EX Q]: [1, 5, 6, 4, 4, 3]
[EX A]: [1, 5, 6, 3]
[EX Q]: [6, 7, 1, 6, 6]
[EX A]: | [7, 1]
| 6 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Detailed Instructions: In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
See one example below:
Problem: [0,1,0,2,5,1]
Solution: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Problem: [4, 7, 7, 0, 4, 2, 1, 4, 7]
Solution: | [0, 2, 1] | 4 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
--------
Question: [4, 0, 4, 5, 7, 0, 7, 6, 4]
Answer: [5, 6]
Question: [1, 7, 1, 2, 0, 6, 4, 0]
Answer: [7, 2, 6, 4]
Question: [3, 5, 3, 2, 4]
Answer: | [5, 2, 4]
| 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example: [0,1,0,2,5,1]
Example solution: [2,5]
Example explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Problem: [4, 2, 3, 7, 1, 0]
| Solution: [4, 2, 3, 7, 1, 0] | 5 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example: [0,1,0,2,5,1]
Example solution: [2,5]
Example explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Problem: [0, 4, 5, 2, 7, 1]
| Solution: [0, 4, 5, 2, 7, 1] | 5 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Ex Input:
[6, 3, 5, 4, 1, 2, 4]
Ex Output:
[6, 3, 5, 1, 2]
Ex Input:
[3, 3, 7, 6, 4, 4, 6, 5]
Ex Output:
[7, 5]
Ex Input:
[2, 7, 3, 7, 0, 4, 0]
Ex Output:
| [2, 3, 4]
| 1 | NIv2 | task097_conala_remove_duplicates | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[0,1,0,2,5,1]
Solution: [2,5]
Why? The only elements that are not duplicated is 2 and 5. This is a good example.
New input: [3, 4, 3, 5, 7, 7, 4, 4, 0, 5]
Solution: | [0] | 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Q: [6, 5, 6, 1, 4, 4, 5, 3, 5, 4]
A: [1, 3]
****
Q: [1, 3, 4, 1, 7, 1, 0, 3, 3]
A: [4, 7, 0]
****
Q: [0, 4, 5, 2, 7, 1]
A: | [0, 4, 5, 2, 7, 1]
****
| 4 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[4, 7, 1, 3, 0, 3, 7, 2, 2]
[4, 1, 0]
[6, 2, 5, 5, 3, 6, 4, 6, 0, 6]
[2, 3, 4, 0]
[3, 2, 6, 0, 6, 1, 5, 5, 5, 7]
| [3, 2, 0, 1, 7]
| 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
TASK DEFINITION: In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
PROBLEM: [1, 7, 0, 0, 5, 0, 1, 1]
SOLUTION: [7, 5]
PROBLEM: [2, 5, 5, 6, 6, 5]
SOLUTION: [2]
PROBLEM: [2, 6, 6, 1, 2, 4, 3]
SOLUTION: | [1, 4, 3]
| 8 | NIv2 | task097_conala_remove_duplicates | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[0,1,0,2,5,1]
Solution: [2,5]
Why? The only elements that are not duplicated is 2 and 5. This is a good example.
New input: [3, 4, 2, 5, 1]
Solution: | [3, 4, 2, 5, 1] | 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Let me give you an example: [0,1,0,2,5,1]
The answer to this example can be: [2,5]
Here is why: The only elements that are not duplicated is 2 and 5. This is a good example.
OK. solve this:
[0, 1, 6, 7, 5, 1, 7, 4]
Answer: | [0, 6, 5, 4] | 8 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
--------
Question: [3, 5, 4, 3, 4, 1, 3, 5, 0, 1]
Answer: [0]
Question: [4, 1, 1, 5, 1, 1, 6, 7, 0]
Answer: [4, 5, 6, 7, 0]
Question: [0, 4, 4, 3, 4, 7, 1, 1, 4, 0]
Answer: | [3, 7]
| 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
instruction:
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
question:
[0, 4, 1, 1, 6, 4, 2, 7, 3]
answer:
[0, 6, 2, 7, 3]
question:
[3, 7, 4, 0, 3, 7, 1, 2]
answer:
[4, 0, 1, 2]
question:
[4, 5, 6, 4, 5, 4, 3, 5, 5, 7]
answer:
| [6, 3, 7]
| 9 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Let me give you an example: [0,1,0,2,5,1]
The answer to this example can be: [2,5]
Here is why: The only elements that are not duplicated is 2 and 5. This is a good example.
OK. solve this:
[6, 5, 0, 3, 2, 4, 6, 4]
Answer: | [5, 0, 3, 2] | 8 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[Q]: [3, 3, 1, 7, 1, 5, 2, 5, 5, 6]
[A]: [7, 2, 6]
[Q]: [0, 1, 4, 1, 4, 3, 1, 0, 6]
[A]: [3, 6]
[Q]: [0, 3, 6, 0, 3, 6, 1, 6]
[A]: | [1]
| 5 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[Q]: [3, 7, 1, 3, 1, 6, 6, 2, 5]
[A]: [7, 2, 5]
[Q]: [1, 1, 2, 4, 1, 2, 3, 0, 0, 6]
[A]: [4, 3, 6]
[Q]: [5, 0, 5, 0, 5, 7, 3]
[A]: | [7, 3]
| 5 | NIv2 | task097_conala_remove_duplicates | fs_opt |
TASK DEFINITION: In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
PROBLEM: [5, 7, 3, 5, 7, 1, 3, 2, 2]
SOLUTION: [1]
PROBLEM: [5, 4, 0, 4, 5]
SOLUTION: [0]
PROBLEM: [0, 1, 6, 7, 5, 1, 7, 4]
SOLUTION: | [0, 6, 5, 4]
| 8 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Let me give you an example: [0,1,0,2,5,1]
The answer to this example can be: [2,5]
Here is why: The only elements that are not duplicated is 2 and 5. This is a good example.
OK. solve this:
[7, 7, 3, 0, 7, 4, 7, 7, 2, 2]
Answer: | [3, 0, 4] | 8 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[4, 4, 0, 2, 1, 1]
[0, 2]
[0, 7, 2, 0, 4]
[7, 2, 4]
[1, 3, 7, 4, 7, 7]
| [1, 3, 4]
| 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
One example is below.
Q: [0,1,0,2,5,1]
A: [2,5]
Rationale: The only elements that are not duplicated is 2 and 5. This is a good example.
Q: [1, 6, 3, 5, 3, 5, 3, 6]
A: | [1] | 9 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[Q]: [5, 0, 2, 0, 2]
[A]: [5]
[Q]: [2, 3, 3, 1, 7, 6, 2, 5]
[A]: [1, 7, 6, 5]
[Q]: [6, 5, 0, 3, 2, 4, 6, 4]
[A]: | [5, 0, 3, 2]
| 5 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[0, 3, 0, 7, 6, 7]
[3, 6]
[4, 0, 3, 5, 6, 5, 4, 5, 0]
[3, 6]
[5, 6, 0, 3, 3, 1, 1, 7, 7, 4]
| [5, 6, 0, 4]
| 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
One example is below.
Q: [0,1,0,2,5,1]
A: [2,5]
Rationale: The only elements that are not duplicated is 2 and 5. This is a good example.
Q: [4, 6, 1, 7, 4, 5, 7, 3, 3, 4]
A: | [6, 1, 5] | 9 | NIv2 | task097_conala_remove_duplicates | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[0,1,0,2,5,1]
Solution: [2,5]
Why? The only elements that are not duplicated is 2 and 5. This is a good example.
New input: [6, 4, 3, 3, 3, 2, 1, 0, 2, 0]
Solution: | [6, 4, 1] | 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example Input: [0, 1, 5, 0, 0]
Example Output: [1, 5]
Example Input: [5, 4, 5, 5, 0, 7, 7, 2, 2, 1]
Example Output: [4, 0, 1]
Example Input: [1, 2, 7, 3, 5, 0]
Example Output: | [1, 2, 7, 3, 5, 0]
| 3 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Given the task definition, example input & output, solve the new input case.
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example: [0,1,0,2,5,1]
Output: [2,5]
The only elements that are not duplicated is 2 and 5. This is a good example.
New input case for you: [4, 7, 7, 0, 2]
Output: | [4, 0, 2] | 1 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
--------
Question: [5, 4, 4, 6, 1, 7, 2]
Answer: [5, 6, 1, 7, 2]
Question: [6, 6, 4, 5, 5, 0, 6]
Answer: [4, 0]
Question: [6, 4, 1, 1, 0]
Answer: | [6, 4, 0]
| 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Input: Consider Input: [2, 7, 5, 3, 2, 0, 5, 0]
Output: [7, 3]
Input: Consider Input: [1, 4, 3, 5, 0, 2, 3, 4, 7]
Output: [1, 5, 0, 2, 7]
Input: Consider Input: [2, 3, 7, 7, 7, 6, 6, 2]
| Output: [3]
| 2 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Input: Consider Input: [2, 6, 4, 0, 4]
Output: [2, 6, 0]
Input: Consider Input: [3, 5, 7, 2, 0, 1, 5, 5]
Output: [3, 7, 2, 0, 1]
Input: Consider Input: [7, 0, 4, 2, 0, 7, 7, 3]
| Output: [4, 2, 3]
| 2 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
One example: [0,1,0,2,5,1]
Solution is here: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Now, solve this: [2, 1, 1, 1, 7, 5, 0, 4, 2]
Solution: | [7, 5, 0, 4] | 6 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Let me give you an example: [0,1,0,2,5,1]
The answer to this example can be: [2,5]
Here is why: The only elements that are not duplicated is 2 and 5. This is a good example.
OK. solve this:
[7, 3, 0, 6, 4, 0]
Answer: | [7, 3, 6, 4] | 8 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[5, 2, 6, 7, 1]
[5, 2, 6, 7, 1]
[3, 7, 1, 3, 1, 6, 6, 2, 5]
[7, 2, 5]
[3, 2, 0, 3, 1, 4, 2, 4, 7]
| [0, 1, 7]
| 0 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Teacher: In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Teacher: Now, understand the problem? If you are still confused, see the following example:
[0,1,0,2,5,1]
Solution: [2,5]
Reason: The only elements that are not duplicated is 2 and 5. This is a good example.
Now, solve this instance: [3, 2, 0, 3, 1, 4, 2, 4, 7]
Student: | [0, 1, 7] | 2 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Detailed Instructions: In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
See one example below:
Problem: [0,1,0,2,5,1]
Solution: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Problem: [0, 3, 6, 5, 5, 7]
Solution: | [0, 3, 6, 7] | 4 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Part 1. Definition
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Part 2. Example
[0,1,0,2,5,1]
Answer: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Part 3. Exercise
[7, 1, 2, 1, 1, 4, 6, 2, 1, 3]
Answer: | [7, 4, 6, 3] | 7 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example input: [0,1,0,2,5,1]
Example output: [2,5]
Example explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Q: [5, 4, 4, 6, 1, 7, 2]
A: | [5, 6, 1, 7, 2] | 3 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
One example: [0,1,0,2,5,1]
Solution is here: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Now, solve this: [3, 7, 5, 6, 0, 2]
Solution: | [3, 7, 5, 6, 0, 2] | 6 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example Input: [3, 3, 1, 0, 5, 4, 4, 4, 1, 0]
Example Output: [5]
Example Input: [2, 4, 2, 3, 0, 1, 3, 6]
Example Output: [4, 0, 1, 6]
Example Input: [4, 2, 3, 4, 5, 5, 6, 5, 7, 3]
Example Output: | [2, 6, 7]
| 3 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Let me give you an example: [0,1,0,2,5,1]
The answer to this example can be: [2,5]
Here is why: The only elements that are not duplicated is 2 and 5. This is a good example.
OK. solve this:
[6, 4, 4, 3, 0, 5]
Answer: | [6, 3, 0, 5] | 8 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example input: [0,1,0,2,5,1]
Example output: [2,5]
Example explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Q: [3, 7, 4, 6, 2, 2, 0, 2]
A: | [3, 7, 4, 6, 0] | 3 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[Q]: [5, 3, 1, 6, 2, 7, 5, 7, 4]
[A]: [3, 1, 6, 2, 4]
[Q]: [7, 1, 7, 0, 3, 0]
[A]: [1, 3]
[Q]: [7, 6, 0, 3, 1, 7, 5, 4]
[A]: | [6, 0, 3, 1, 5, 4]
| 5 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
One example is below.
Q: [0,1,0,2,5,1]
A: [2,5]
Rationale: The only elements that are not duplicated is 2 and 5. This is a good example.
Q: [6, 7, 3, 3, 4, 6]
A: | [7, 4] | 9 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
Example Input: [5, 7, 3, 5, 7, 1, 3, 2, 2]
Example Output: [1]
Example Input: [7, 7, 0, 4, 4, 1]
Example Output: [0, 1]
Example Input: [5, 2, 1, 5, 1, 7, 2, 0]
Example Output: | [7, 0]
| 3 | NIv2 | task097_conala_remove_duplicates | fs_opt |
Detailed Instructions: In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
See one example below:
Problem: [0,1,0,2,5,1]
Solution: [2,5]
Explanation: The only elements that are not duplicated is 2 and 5. This is a good example.
Problem: [2, 0, 2, 0, 1, 5, 1, 0, 0, 5]
Solution: | [] | 4 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[EX Q]: [2, 3, 2, 3, 0, 4, 2]
[EX A]: [0, 4]
[EX Q]: [4, 1, 5, 3, 5, 1, 7, 7]
[EX A]: [4, 3]
[EX Q]: [3, 2, 5, 7, 2, 7, 7]
[EX A]: | [3, 5]
| 6 | NIv2 | task097_conala_remove_duplicates | fs_opt |
In this task you will be given a list of numbers and you should remove all duplicates in the list. If every number is repeated in the list an empty list should be returned. Your list should be numbers inside brackets, just like the given list.
[Q]: [1, 4, 2, 0, 0, 3, 2]
[A]: [1, 4, 3]
[Q]: [2, 6, 3, 7, 7, 2, 5, 7]
[A]: [6, 3, 5]
[Q]: [7, 4, 7, 5, 5, 3, 1, 4, 7, 1]
[A]: | [3]
| 5 | NIv2 | task097_conala_remove_duplicates | fs_opt |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6