may you please provide the complete list of string based algorithms needed to solve most of string based problems?
some of them can also be solved by dynamic programming like the edit distance problem, number f unique palindromes, etc.
may you also start a thread of problems based on these!
just use the problem tags
suffix array http://www.codechef.com/tags/problems/suffix-array
note that some problems can be solved by more than one technique.
i would suggest you to first solve 4- problems of KMP, rabin-karp, aho-corasick, Dynamic programming and only then move on to suffix arrays and suffix trees.
thank you redd!