tag:blogger.com,1999:blog-2682781734368178743.post4330600788851858262..comments2010-08-22T22:35:33.477-07:00Comments on Technical Interview Questions: String: Find First Non-Repeated Characteravid gardenernoreply@blogger.comBlogger2125tag:blogger.com,1999:blog-2682781734368178743.post-10490781075305627052010-08-22T22:35:33.477-07:002010-08-22T22:35:33.477-07:00The actual and correct answer for the input string...The actual and correct answer for the input string &quot;Bumblebee&quot; would be &#39;B&#39;. As &#39;B&#39; and &#39;b&#39; are different. The program correctly return &#39;B&#39;. In the case when the input string is &quot;bumblebee&quot; the above program correctly return &#39;u&#39;. The program is correct because once the hash table is built we loop over the characters of the original avid gardenerhttp://www.blogger.com/profile/08838915050477665426noreply@blogger.comtag:blogger.com,1999:blog-2682781734368178743.post-20041349518516890702010-08-22T16:08:18.259-07:002010-08-22T16:08:18.259-07:00This is not sufficient. It finds the first ascii c...This is not sufficient. It finds the first ascii character that has a count of one but it does not find the first character in a string that has a count of one.<br /><br />Say your string is: Bumblebee<br />Your answer would return &quot;l&quot; (because you are assuming the order of ascii characters) but the correct answer should be &quot;u&quot;. You could search the hash table for each entry Anonymousnoreply@blogger.com