Finding duplicates algorithm series- A string as an input.

In my last post

I wrote about finding duplicates inside an array of integers. What if input is a string instead of integers? Could we solve the problem in same way we did before?

String is essentially an array of characters so we still could use HashTable/ Set like before to store chars instead this time.

Although algorithm wise we didn’t learn new anything but now we know that strings are essentially an array of chars and we could utilize that fact going forward in string related problems.