Available question text
Return the lexicographically smallest subsequence of s that contains every distinct character exactly once while preserving relative order. The core challenge is choosing which duplicates to keep or drop to minimize order, typically tackled with a greedy monotonic-stack approach.
Related questions
Continue with questions that share topics or the same question type.
- Append Characters to String to Make Subsequence
Coding
- Longest Substring with At Most K Distinct Characters
Coding · Hash Table · Sliding Window · String
- Longest Substring with At Most Two Distinct Characters
Coding
- Longest Substring with K Distinct Characters
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1081. Smallest Subsequence of Distinct Characters
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source