Group strings that are anagrams

Q: Group strings that are anagrams

This question evaluates string-processing and data-structuring competency, focusing on identifying and grouping anagrams through comparison of unordered character multisets.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

Given an array of strings, group the strings into lists such that each list contains strings that are anagrams of each other.

Definition

Two strings are anagrams if they contain the same characters with the same frequencies (order does not matter).

Input

strs : an array of strings (assume lowercase English letters).

Output

Return a list of groups, where each group is a list of anagram strings.
The order of groups does not matter. The order of strings within a group does not matter.

Example

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

Output (one valid answer): [ ["eat","tea","ate"], ["tan","nat"], ["bat"] ]

Constraints (assumed)

1 <= len(strs) <= 10^4
0 <= len(strs[i]) <= 100
Total characters across all strings <= 10^6