[SOLVED] Simple Java Problem Hello, In my computer science class, we were assigned to design an annagrams class, which would create a HashMap of String => HashSet, a sorted sequence of letters mapped to all annagrams of those letters found in the dictionary. This was done. Sample entries from the "database": opst => 'spot', 'pots', 'tops', 'stop'; 'act' => 'act', 'cat'; Now, the new assignment is to generalize the class such that the class could find annagrams of sentences, not just single words. And the professor is suggesting that the mapping database should remain as-is, with no further modifications. Can someone please give a hint as to how this could possibly be done "the right way"? Sample of desired output: 'computer science' => 'cement occupiers', 'ecumenic copters'. Thank you.