one-line-wonders
one-line-wonders copied to clipboard
Unique Array
You are given an array with random integers. Design an algorithm that returns the array with duplicates removed. This means if the input is [1,10,7,1,4], the output will be [1,10,7,4].
Some solutions might be faster than others but speed does not matter
Solved this issue in python https://github.com/wzhouwzhou/one-line-wonders/pull/404
Please let me know if there are any changes
Solved this issue in pull request https://github.com/wzhouwzhou/one-line-wonders/pull/410