Unique elements
There's a function in Clojure called distinct
that removes duplicates from a sequence. Your task is to write a function called uniques
that removes elements that appear twice.
Examples
(uniques []) ;=> ()
(uniques [1 2 3]) ;=> (1 2 3)
(uniques [1 1 2 3]) ;=> (2 3)
(uniques [1 2 3 1 2 3]) ;=> ()
(uniques [1 2 3 2]) ;=> (1 3)
Thanks to this site for the challenge idea where it is considered Medium in Python. The problem has been modified from the original.
Please submit your solutions as comments on this gist.
To subscribe: https://purelyfunctional.tv/newsletter/
Originally, I thought order didn't matter. On second thought, maybe you're right. The original specification mentioned
distinct
and that maintains order. Back to the drawing board.