Problem 467 · Medium
Count unique substrings of a wraparound string where letters are consecutive (a-z with z→a).
Open the interactive visualisation