Group Anagrams

Given n strings consisting only of lowercase English letters, group all strings that are anagrams of one another.

Two strings are anagrams if they contain exactly the same characters with the s...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: