Problem 1987 · Hard

Number of Unique Good Subsequences

Count the distinct good binary subsequences of a string, with no leading zeros except a single zero. The visual tracks counts for each ending character as the string is scanned.

Open the interactive visualisation