✅🔥JAVA [Easy to Understand] | Very Easy Solution | HashMap
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public List<List<String>> groupAnagrams(String[] strs){\n        List<List<String>>s=new ArrayList<>();\n        Map<String,List<String>>map=new LinkedHashMap<>();\n        \n        for(String e:strs){\n            char ch[]=e.toCharArray();\n            Arrays.sort(ch);\n            String str=new String(ch);\n            \n            if(!map.containsKey(str)){\n                map.put(str,new ArrayList<>());\n            }\n            map.get(str).add(e);\n        }\n        s.addAll(map.values());\n        return s;\n    }\n}\n```
['Hash Table', 'Sorting', 'Java']