Revision en3, by X-O__O-X, 2020-11-22 07:35:22

Given integers n and k such that

0 < n <= 10^6

0 < k <= 10^3

and a string S of length n.

Find any substring of length k in S with maximum number of occurrences. I don't care about the obvious complete search solution. Also, no need for complete solution. just some hints. what topic to look for ?etc.


n=13 k=3


ans is "abc" repeated 4 times.


  Rev. Lang. By When Δ Comment
en3 English X-O__O-X 2020-11-22 07:35:22 83
en2 English X-O__O-X 2020-11-22 07:33:26 8
en1 English X-O__O-X 2020-11-22 07:31:54 313 Initial revision (published)