dsa · medium
Group Anagrams
StringHash Map
Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Return a list of lists.
Arguments
strs— the list of strings
**Example 1:** `` Input: strs = ["eat","tea","tan","ate","nat","bat"] Output: [["bat"],["nat","tan"],["ate","eat","tea"]] ``
Constraints
1 <= strs.length <= 4*10^4 Hidden tests include near-max size for this bound; a slower-than-intended solution TLEs.
Examples
Example 1
Input: ["eat","tea","tan","ate","nat","bat"] Expected: [["bat"],["nat","tan"],["ate","eat","tea"]]
Example 2
Input: [""] Expected: [[""]]