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/
Wording is ambiguous. Is this challenge the same as https://gist.github.com/ericnormand/235696a7f7cca803f772a2d1bd1b90c3 ? Or should the behavior be to remove only elements that appear exactly twice??