Assign each alphabet a unique number
a-1
b-2
c-3
.
.
now for each word do addition something like this..

for e.g. if word is “cba” its unique sum is
3*(26)*(26)*(26) + 2*(26)*(26) + 1*(26)= watever

so by doing this,cab,abc,bac all would give this same sum and map to same hash position.

Of course this would reduce the time because we are not sorting but just adding.
So time reduces from nlogn to n.

Problem with this solution is we have to check the length of the string.

To take care of that ,here is sunny’s better solution.

assign each alphabet a unique prime number. Now instead of adding we multiply the corresponding prime values of each aplphabet in a word to get a unique number. This would take care of size too…

Cheers

(as there are 26 alphabets) and check and store this word’s position in some hash