Data Structures.

[nsparatkar]

What are the data structures that we are going to use?
The sowpods.txt will be stored in the following map :
map <sorted letters word , an array list of all the anagrams>

[asrayousuf]

There will a anagram list in a hash map with the key=sorted_word and value=space separated list of words that are anagrams

Group 1 results will be in the format of a hash map called sorted_list with key=suggested_word and value=scoreOfTheWord

[theCuriosityEnthusiast]

Why not append the anagram score to the value of the hash map? Like <"art",
"25, art, rat, tar">

On 24 July 2015 at 12:21, asrayousuf notifications@github.com wrote:

There will a anagram list in a hash map with the key=sorted_word and
value=space separated list of words that are anagrams

Group 1 results will be in the format of a hash map called sorted_list
with key=suggested_word and value=scoreOfTheWord

—
Reply to this email directly or view it on GitHub
#1 (comment)
.

[Jayasruthi]

final output is map with score and word?

[asrayousuf]

That we can do if we are pre computing word scores.But we decided we will not precompute, right?

Yes, Jayasruthi

[theCuriosityEnthusiast]

Fine.. Lets not precompute it so we have Map<String SortedSeq, String
anagramsAppendedTogether> ?

On 24 July 2015 at 12:29, asrayousuf notifications@github.com wrote:

That we can do if we are pre computing word scores.But we decided we will
not precompute, right?

Yes, Jayasruthi

—
Reply to this email directly or view it on GitHub
#1 (comment)
.

[asrayousuf]

Yup

[nsparatkar]

Why are we appending the anagrams together? We can have an arraylist. I think it will be easier to just have an iterator rather than doing lookup for space.

[aravindram94]

Eveery one update the read me file about what your work is !

[aravindsrivats]

Donot update the readme. I'll update the readme for each.