Package g0001_0100.s0049_group_anagrams

Class Solution

java.lang.Object
g0001_0100.s0049_group_anagrams.Solution
public class Solution extends Object
49 - Group Anagrams.<p>Medium</p> <p>Given an array of strings <code>strs</code>, group <strong>the anagrams</strong> together. You can return the answer in <strong>any order</strong>.</p> <p>An <strong>Anagram</strong> is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> strs = [&ldquo;eat&rdquo;,&ldquo;tea&rdquo;,&ldquo;tan&rdquo;,&ldquo;ate&rdquo;,&ldquo;nat&rdquo;,&ldquo;bat&rdquo;]</p> <p><strong>Output:</strong> [[&ldquo;bat&rdquo;],[&ldquo;nat&rdquo;,&ldquo;tan&rdquo;],[&ldquo;ate&rdquo;,&ldquo;eat&rdquo;,&ldquo;tea&rdquo;]]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> strs = [&quot;&quot;]</p> <p><strong>Output:</strong> <a href="&quot;&quot;">&quot;&quot;</a></p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> strs = [&ldquo;a&rdquo;]</p> <p><strong>Output:</strong> <a href="&quot;a&quot;">&quot;a&quot;</a></p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= strs.length <= 10<sup>4</sup></code></li> <li><code>0 <= strs[i].length <= 100</code></li> <li><code>strs[i]</code> consists of lowercase English letters.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details