GitHub repository: Creolestudios/unique-substrings-in-wraparound-string-leetcode
Created: 2024-02-22T09:53:23Z
Description: We define the string base to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so base will look like this: "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....". Given a string s, return the number of unique non-empty substrings of s are present in base.