0
0

[–] pm_me_firearms ago 

strings are just numbers, right? So make them into two arrays, sort them, and check them using an algorithim that I've forgotten the name of, but involves deciding to increment a side by looking at which side has the lower number.

0
0

[–] brux ago 

Strings are lists of characters. I.e., words or sentences. See the answer below. :)

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.