Problem Submissions Solution
Form Anagram Groups
Difficulty: Medium
Acceptance: 69.80%
Points: 30.00
You are given an **array** of strings. Your task is to group all strings that are anagrams of each other. The groups should be formed in the order of their first appearance in the original array. Note: The final output will be in **lexicographic** order.
Examples:
Expected Time Complexity: O(n k m log m)
Expected Space Complexity: O(n*m)
Constraints:
- 1<= arr.size() <=100
- 1<= arr[i].size() <=10
Companies:
Amazon Microsoft Goldman Sachs DE Shaw Morgan Stanly
Topics:
String Hashing
