-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
28 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,28 @@ | ||
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: | ||
``` | ||
1 <= strs.length <= 104 | ||
0 <= strs[i].length <= 100 | ||
strs[i] consists of lowercase English letters. | ||
``` |