for sin strs:

sortedS=''.join(sorted(s))

res[sortedS].append(s)

return res.values()

returnlist(res.values())

for c in s:

count[ord(c) - ord('a')] += 1

res[tuple(count)].append(s)

return res.values()

returnlist(res.values())

* Time complexity: $O(m * n)$

* Space complexity: $O(m)$

> Where $m$ is the number of stringsand $n$ is the length of the longest string.

> Where $m$ is the number of stringsand $n$ is the length of the longest string.