Step 1-Traverse list of strings.
Step 2- Sort each string in ascending order and consider this sorted value as Key and original value as Value of corresponding key. Check if key is not present in dictionary that means it is occurring first time, so map a empty list to Key and append value in it, if key is already present then simple append the value.
Step 3- Now each key will contain list of strings which are anagram together.