Inicio Explorar Axuda
Rexistro Iniciar sesión
wesvirus
/
edaBit-coding-challenges
1
0
Fork 0
Ficheiros Incidencias 0 Pull Requests 0 Wiki
Árbore: 94f3018cec
Ramas Etiquetas
edaBit-codin...
/
Purge-and-Organize
wes d2a2ba9e15 first commit %!s(int64=4) %!d(string=hai) anos
..
README.md d2a2ba9e15 first commit %!s(int64=4) %!d(string=hai) anos
code.cpp d2a2ba9e15 first commit %!s(int64=4) %!d(string=hai) anos
unitTest.cpp d2a2ba9e15 first commit %!s(int64=4) %!d(string=hai) anos

README.md

Purge and Organize

by Alex Golubov tags: arrays, data_structures, sorting, numbers

Summary

Given an array of numbers, write a function that returns an array that... Has all duplicate elements removed. Is sorted from least value to greatest value. Examples uniqueSort([1, 2, 4, 3]) ➞ [1, 2, 3, 4] uniqueSort([1, 4, 4, 4, 4, 4, 3, 2, 1, 2]) ➞ [1, 2, 3, 4] uniqueSort([6, 7, 3, 2, 1]) ➞ [1, 2, 3, 6, 7] Notes N/A

Instructions

Given an array of numbers, write a function that returns an array that...

  1. Has all duplicate elements removed.
  2. Is sorted from least value to greatest value.

Examples

uniqueSort([1, 2, 4, 3]) ➞ [1, 2, 3, 4]

uniqueSort([1, 4, 4, 4, 4, 4, 3, 2, 1, 2]) ➞ [1, 2, 3, 4]

uniqueSort([6, 7, 3, 2, 1]) ➞ [1, 2, 3, 6, 7]

Notes

N/A