Algorithm · ByteDance · Hard
Requirements For a string s, delete repeated letters so that each distinct letter occurs exactly one time. Of all strings that satisfy this condition, return the one that comes first in lexicographic order. Examples Notes The interview allocates about 30 minutes to discussing projects and database, Redis, and Kafka fundamentals, so approximately 30 minutes remain for the programming exercise. Preparation Walk through both examples manually.
Checking your access…