Hi Gene,
This works. Thanks for your suggestion.
Regards,
Vaibhav
On Tue, Nov 16, 2010 at 8:51 AM, Gene wrote:
> Your description is imprecise. I guess you mean the answer is "B,"
> not "D" as you said. The following may be based on an improper
> reading of your description. For example I'm
i guess you dont require first hash at all.create a hash map
that maps a letter to a set of keys now once you have all your sets you can
just compare the input set with your the formed sets...
On Tue, Nov 16, 2010 at 8:51 AM, Gene wrote:
> Your description is imprecise. I guess
Your description is imprecise. I guess you mean the answer is "B,"
not "D" as you said. The following may be based on an improper
reading of your description. For example I'm assuming that each
letter maps to each int at most once. And each set of ints maps to
exactly one letter.
Your method i
