class Solution {
public List<List> groupAnagrams(String[] strs)
{
List<List> p=new ArrayList<>();
Map<String,List> map=new HashMap<>();
for(String h:strs)
{
int count[]=new int[26];
Arrays.fill(count,0);
for(int i=0;i<h.length();i++)
{
char t=h.charAt(i);
int index1=t-‘a’;
count[index1]=count[index1]+1;
}
StringBuilder st=new StringBuilder();
for(int xt:count)
{
st.append("#");
st.append(xt);
}
String temp2=st.toString();
List li=map.getOrDefault(temp2,new ArrayList());
li.add(h);
map.put(temp2,li);
}
return new ArrayList<>(map.values());
}
}
if this is a optimize approach the why its take 18 ms run time on leetcode
