zasa1010
BAN USER
Comments (4)
Followers (1)
Reputation 10
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
if the string contains all unique English words (worst case), it means about 150.000 words and if the length of each word is in average 10 bytes and 4 bytes for keeping the number of acurrance, in total 14 bytes for each word, the hash table will be 2GB which is not unreseanable and can be handle by desktop PC or a alptop.
- zasa1010 August 28, 2012Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
Reppamelajoung, Dev Lead at Absolute Softech Ltd
I have worked as a wedding photographer for the past two years, first as a photographer’s assistant and then ...
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
if you have a Space of O(n) for creating a max heap, why you do not use the hash map to prevent sorting which has O(nlogn) runtime complexity?
- zasa1010 August 28, 2012look at the solution which is provided above and let me know your opinion