MathNet 2024-part-05 — 168 problems (EN–VI) Question 11

Let the alphabet has only two letters: $A$ and $B$. Is it possible to choose one word of length 5, one word of length 6, ..., one word of length 30 such that any word of length 300 contains one of the chosen words as substring?