Minimum Repeated Substring
A binary string is called repeated if it is even in length and its first half is identical to its last half. For example, the string are repeated string.
What is the minimum number of unique repeated substring one can have with a binary string of length 18?
Details and Assumptions
- The string has 2 unique repeated substrings .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
The string is 0 1 0 0 1 1 0 0 0 1 1 1 0 0 1 1 0 1 which has only 2 distinct repeated substrings namely 0 0 and 1 1 .