You are viewing a single comment's thread.

view the rest of the comments →

0
0

[–] hopo ago 

I would have just used a hash set. Does not require sorting and you just have to iterate through the list once for a time complexity of O(n)

0
0

[–] brux ago 

This is the answer I look for when I interview someone. Though, putting them in a list and sorting them is also an interesting (but not optimal) answer.