Given a list of words or phrases, group the words that are anagrams of each other. An anagram is a word or phrase formed from another word by rearranging its letters.

Constraints:

Let strs be the list of strings given as input to find the anagrams.

• $1 \leq$ strs.length $\leq 10^3$
• $0 \leq$ strs[i].length $\leq 100$
• strs[i] consists of lowercase English letters.

Note: The order in which the output is displayed doesn’t matter.