Create anagram map from the dictionary

[aravindsrivats]

Creating the anagram map from the dictionary file to store all words in the format: key = anagram string ; value = all possible strings with that anagram

[aravindsrivats]

We are using a anagram map to store the words @asrayousuf @aravindram94 so that we don't have to compare the same words twice.

[nsparatkar]

@aravindsrivats : The key should be the sorted lettered word!

[aravindsrivats]

Yes. That will be the key. The value will be a list of words and the score.

[nsparatkar]

@aravindsrivats : At which position is the score going to be?

[aravindsrivats]

I'll return you the Word object in which, the word will be each word separated by spaces and score as its common score.

[nsparatkar]

@aravindsrivats : Why a space separated list? You can have a list. It becomes easier to compute.

[aravindsrivats]

Compute what? The score is going to be calculated using the key.

[nsparatkar]

@aravindsrivats : is there an element names score in the object? Or is it going to be appended to the list in the map?

[aravindsrivats]

This is the final structure. Map < String, String>
Key will be sorted word. Value will be "score anagram1 anagram2 anagram3 . . " If there is no anagram Value will be "score"

[aravindram94]

It cant be . bcoz after sorting u lose the word . so u cant store the score alone

[aravindsrivats]

Sorry. It will be "score word"

[aravindram94]

But the whole point is why do u bother about the traversing the list ! it is a performance issue man! So performance doesnot matter...

[aravindsrivats]

Its not about performance. Its about stupidity. Why go over the same set of characters again and again?

[aravindram94]

okay!

[aravindram94]

can v discuss about the signature of the function?

[aravindsrivats]

Map of the following structure is generated. Map <String, String>