A non-empty string is called a minimal unique substring of s if and only if it satisfies:
(i) α occurs exactly once in s (uniqueness),
(ii) all proper prefixes of occur at least twice in s (mimimality), and
(iii) α > l for some constant l.
Give an optimal algorithm to enumerate all minimal unique substrings of s.