Two strings are anagrams if and only if sorting their characters produces the same result.

Group Anagrams

medium

Acceptance: 55%

StringsArrays

You receive a collection of strings. Partition them into groups where every string in a group is an anagram of the others. Two strings are anagrams when one can be rearranged to form the other using every letter exactly once. The groups may be returned in any order.

Examples

Example 1:

Input:words = ["listen","enlist","google","silent","goelgo"]

Output:[["listen","enlist","silent"],["google","goelgo"]]

Explanation: 'listen', 'enlist', and 'silent' are mutual anagrams. 'google' and 'goelgo' form the other group.

Example 2:

Input:words = ["a"]

Output:[["a"]]

Explanation: A single string stands alone in its own group.

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Group Anagrams

Examples

Hints

Related Problems