Consider an infinite wraparound string base formed by repeating the lowercase English alphabet indefinitely: "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz...".

Given a string s, return the number of unique non empty substrings of s that also appear as substrings in base.

Constraints:

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

• s consists 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.