DSA problem
Group Anagrams
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. Two strings are anagrams of each other if and only if their sorted character sequences are identical, or equivalently if they have the exact same multiset of characters.
The goal is to partition the input list into groups such that every string within a group is an anagram of every other string in that group, and no two strings from different groups are anagrams. Each group is returned as a list of the original strings.
Examples
strs = ["eat","tea","tan","ate","nat","bat"][["bat"],["nat","tan"],["ate","eat","tea"]]strs = [""][[""]]strs = ["a"][["a"]]Constraints
- 1 <= strs.length <= 10^4
- 0 <= strs[i].length <= 100
- strs[i] consists of lowercase English letters.
3 hints and a full solution walkthrough with step-by-step visualizations are available in the practice editor.