Sumit Gera
BAN USER
Comments (4)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
Wrong headers included :)
- Sumit Gera February 17, 2013Comment hidden because of low score. Click to expand.
0
of 0 vote
How does complexity doesn't seem to be O(n)?
- Sumit Gera February 17, 2013Comment hidden because of low score. Click to expand.
0
of 0 vote
Yeah hashing is the most efficient method for problems like: dictionary searching.
- Sumit Gera February 17, 2013Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
What do you think about the time complexity of your algorithm? Though this is the only solution I was able to figure out, but it seems to be linear, no?
- Sumit Gera February 18, 2013