1 problem

Let $w$ be a word of length at least $2$. A subword is most frequent if it maximizes the number of occurrences in $w$. Short-subword conjecture. At least one most frequent subword…