dsa2 min read
Anagram Problems — Sorting Key, Frequency Vector, and Rolling Hash
Group anagrams, find anagram indices, and count anagram occurrences. Three approaches: sort key O(nk log k), frequency tuple O(nk), and sliding window O(n+k).
Read →
webcoderspeed.com
1 articles
Group anagrams, find anagram indices, and count anagram occurrences. Three approaches: sort key O(nk log k), frequency tuple O(nk), and sliding window O(n+k).