Problem 1763 · Easy
Find the earliest longest substring containing both cases of every letter it uses.
Open the interactive visualisation