bits
BAN USER
Comments (3)
Reputation 20
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
How is your solution any different than just using a hash table?
Ignore case-sensitivity issues, large string issues,a nd other issues
I would like to know are you doing any better in time complexity as compared to a straight forward hash table approach? Or are we doing better in space complexity?
Comment hidden because of low score. Click to expand.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Couple of days ago, same question was asked on stackoverflow.
- bits February 20, 2011I also posted a working solution to this problem. Its recursion based.
Google for "Array manipulation interview question StackOverflow"
(upvote if you think my submission is correct)