Updated description for Sorted Union bonfire for clarity.
This commit is contained in:
@ -311,6 +311,7 @@
|
|||||||
"difficulty": "2.07",
|
"difficulty": "2.07",
|
||||||
"description": [
|
"description": [
|
||||||
"Write a function that takes two or more arrays and returns a new array of unique values in the order of the original provided arrays.",
|
"Write a function that takes two or more arrays and returns a new array of unique values in the order of the original provided arrays.",
|
||||||
|
"In other words, all values present from all arrays should be included in their original order, but with no duplicates in the final array."
|
||||||
"The unique numbers should be sorted by their original order, but the final array should not be sorted in numerical order.",
|
"The unique numbers should be sorted by their original order, but the final array should not be sorted in numerical order.",
|
||||||
"Check the assertion tests for examples."
|
"Check the assertion tests for examples."
|
||||||
],
|
],
|
||||||
|
Reference in New Issue
Block a user