Package g0001_0100.s0049_group_anagrams

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    49 - Group Anagrams.

    Medium

    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.

    Example 1:

    Input: strs = "eat","tea","tan","ate","nat","bat"

    Output: ["bat","nat","tan","ate","eat","tea"]

    Example 2:

    Input: strs = ""

    Output: [""]

    Example 3:

    Input: strs = "a"

    Output: ["a"]

    Constraints:

    • <code>1 <= strs.length <= 10<sup>4</sup></code>

    • 0 &lt;= strs[i].length &lt;= 100

    • strs[i] consists of lowercase English letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<List<String>> groupAnagrams(Array<String> strs)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait