Purge and Organize

Published by Matt in
arraysdata_structuresloopsnumberssorting

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

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

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

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

Notes

N/A

Watch a quick demo on how Edabit works.