Can someone tell how should I learn string-processing algorithms? I currently know only z-function. Where to start learning suffix-array, suffix-tree, suffix-automaton and also in what order. Also is there a good collection of question related to this topic.
Trie, kmp, aho, suffix array, suffix automaton, suffix tree.
Edit: Alright now that I have a bit more time a slightly more serious answer: solve stuff, look for string problems in educationals, they're quite decent and https://mirror.codeforces.com/gym/102302/problem/K
Is this find odd one out? Because I have the answer.
a good place to learn trie, you can also find some problems there
Some other trie problems: