CareerCup

in this questions i would like to ask the interviewer about the type of keys and values and what operations are required.
then i will suggest the data structure.

in this questions i would like to ask the interviewer about the type of keys and values and what operations are required.
then i will suggest the data structure.

We can use Map.

We can use hash map to achieve this. The time complexity to search a key would be O(1).

B-Tree with index?
Should I hold them all in memory?

1) distinct keys and distinct values -> hashing, have a good hash function to have minimum collision and in case of collision have chaining
2) non-distinct keys and distinct values -> Still hashing but hash table of relatively smaller size and if we know that the values are spread uniformly over the namespace/alphabet we can do bucketing.
3) non-distinct keys and non-distinct values -> Hashing, hash table of small size and another hash map for values <value,count> with count as number of times the value has occurred.

1.Ask the purpose
2.State your assumption: mine is - It must be to cache data,esp rendered HTML from a DB
3.Propose the solution: memcache in my case.

1.Ask the purpose
2.State your assumption: mine is - It must be to cache data,esp rendered HTML from a DB
3.Propose the solution: memcache in my case.

1.Ask the purpose
2.State your assumption: mine is - It must be to cache data,esp rendered HTML from a DB
3.Propose the solution: memcache in my case.