Frage im Vorstellungsgespräch bei Quantcast

Remove duplicates. I could not solve it without sorting the array first.

Antworten zu Vorstellungsgespräch

Anonym

21. Feb. 2015

Just use a hash table, both time and space are O(n)

5

Anonym

24. Sept. 2016

It depends. If only 1 dup, you can do it by O(n) time and O(1) space by 2 runner

1

Anonym

15. Dez. 2016

How about just inserting everything to a set