Hi, I got a question in the interview about how to find the first non repeating char in a string. For example for string ABCA, B is the first non repeating char. It is easy to come up with a brute force algorithm by scanning the string. But is there an efficient way to do it?
thanks --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
