-
Notifications
You must be signed in to change notification settings - Fork 63
Open
Labels
difficulty: mediumMedium difficulty problem.Medium difficulty problem.hacktoberfestHacktoberfest issue.Hacktoberfest issue.problemLeetCode problem.LeetCode problem.
Description
Difficulty
Medium
Problem Description
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 <= 1040 <= strs[i].length <= 100strs[i]consists of lowercase English letters.
Link
Metadata
Metadata
Assignees
Labels
difficulty: mediumMedium difficulty problem.Medium difficulty problem.hacktoberfestHacktoberfest issue.Hacktoberfest issue.problemLeetCode problem.LeetCode problem.