Medium

Quiz

#467 Unique Substrings in Wraparound String

APPROACH

Define the infinite string base as the English lowercase alphabet repeated cyclically without end: "...xyzabcdefghijklmnopqrstuvwxyzabc...". Given string s, return the number of distinct non-empty substrings of s that are also substrings of base.

Example 1:

Input: s = "a"

Output: 1

Explanation: Only the substring "a" of s is in base.

Example 2:

Input: s = "cac"

Output: 2

Explanation: There are two substrings ("a", "c") of s in base.

Example 3:

Input: s = "zab"

Output: 6

Explanation: There are six substrings ("z", "a", "b", "za", "ab", and "zab") of s in base.

1 of 4

1:00

What is the optimal approach for this problem?