Problem 467 · Medium

Unique Substrings in Wraparound String

Count unique substrings of a wraparound string where letters are consecutive (a-z with z→a).

Open the interactive visualisation