Secret.Codes's blog

By Secret.Codes, history, 19 months ago, In English,

I am a beginner. I know basic of KMP, suffix array. I can also generate prefix function,lcp(longest common prefix) only. Please provide some good problems on them. Please try give mainly DIV 2 C and D type(codeforces is better, but you can give also from any other judge) . Because I am a beginner a solved only 4 or 5 problems of those algorithm. If there are good problems harder than Div2 C or D or any other online judge which should be solved to become better , Give them too I will solve them later.

 
 
 
 
  • Vote: I like it  
  • +6
  • Vote: I do not like it  

»
19 months ago, # |
  Vote: I like it 0 Vote: I do not like it

This list of problems may be good place to start although I can't guarantee that they involve only KMP problems:

https://a2oj.com/category?ID=29

Here is a problem I personally solved using KMP:

http://acm.timus.ru/problem.aspx?space=1&num=1423&locale=en

»
11 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Competitive Programming 1 has a bunch of problems on Suffix Array (mostly from UVa OJ).

pdf