Given an array of strings strs, group the anagrams together. You can return the answer in any order.
Given an array of strings strs, group the anagrams. 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 lower-case English letters.SOLUTION:
Algorithm/Approach:
import java.util.*;
class Solution
{
public static List < List < String >> groupAnagrams(String[] strs)
{
List < List < String >> result = new ArrayList < > ();
String strn[] = new String[strs.length];
for (int i = 0; i < strs.length; i++)
{
char chr[] = strs[i].toCharArray();
Arrays.sort(chr);
strn[i] = String.valueOf(chr);
}
HashMap < String, ArrayList < String >> hmap = new HashMap < String, ArrayList < String >> ();
for (int i = 0; i < strs.length; i++)
{
if(hmap.containsKey(strn[i]))
{
ArrayList < String > list = hmap.get(strn[i]);
list.add(strs[i]); hmap.put(strn[i], list);
}
else
{
ArrayList < String > list = new ArrayList < > ();
list.add(strs[i]);
hmap.put(strn[i], list);
result.add(list);
}
}
return result;
}
}
Input: strs = ["eat","tea","tan","ate","nat","bat"]
Output: [["bat"],["nat","tan"],["ate","eat","tea"]]
Submitted by CHATTETI.THARUN (Tharun)
Download packets of source code on Coders Packet
Comments