Given a string s, return true if s can be formed by repeating one of its proper substrings multiple times. Otherwise, return false.

Note: A proper substring is a non-empty substring that is not equal to s itself.

Constraints:

• $1 \leq$ s.length $\leq 10^4$

• s consists only of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.