A problem with strings

Revision en3, by rangell, 2018-07-02 03:21:00

Hi guys

I'm trying to solve a strings problem. Where it is necessary to determine the length of the smallest string T that is not a substring S.

Σ = {0, 1}

Size of text S is: 1 ≤ S ≤ 105

Exemple:

S = "011101001", 000 is not a substring of S, so the leght is 3.

Someone can help me?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English rangell 2018-07-02 03:21:00 0 (published)
en2 English rangell 2018-07-02 03:15:30 110 (saved to drafts)
en1 English rangell 2018-07-02 03:15:01 345 Initial revision (published)