In the hash tables bootcamp solution of grouping anagrams (EPI Java), why is the insertion into the table O(nm)? Should it not be O(n)? Although it is a lower order term, I wanted to clarify.
In the hash tables bootcamp solution of grouping anagrams (EPI Java), why is the insertion into the table O(nm)? Should it not be O(n)? Although it is a lower order term, I wanted to clarify.