tag:blogger.com,1999:blog-9182705499898252496.post1145629943858344616..comments2009-01-07T16:01:23.925-05:00Bill the Lizardhttp://www.blogger.com/profile/09810099093752485841noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-9182705499898252496.post-55185365146021389572009-01-07T16:01:00.000-05:002009-01-07T16:01:00.000-05:00I had a really similar interview question once. The interviewer asked, "If I have two lists of names, A and B, and I want to find all the names in list A that also appear in list B, what do I do?" I think you know the right answer. :)Bill the Lizardhttp://www.blogger.com/profile/09810099093752485841noreply@blogger.comtag:blogger.com,1999:blog-9182705499898252496.post-66575137681438768992009-01-07T12:37:00.000-05:002009-01-07T12:37:00.000-05:00Excellent post! I always like things like this. One problem I always see people do are searching for certain characters within a string, involving one loop to loop through the string, and another loop to go through the alphabet, and then count (O n*n), instead of building a hash table of values and comparing that to the character you are looking for.Anonymousnoreply@blogger.com