Available question text
Remove duplicate letters from s so each character appears exactly once and the resulting string is the smallest possible in lexicographic order. This is solved by a greedy monotonic-stack strategy that keeps one copy of each letter while using last-occurrence information (and a visited set) to decide safe removals.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Add to Make Parentheses Valid
Coding · Bracket Sequences · Greedy · Stack
- Minimum Insertions to Balance a Parentheses String
Coding · Bracket Sequences · Greedy · Stack
- Using a Robot to Print the Lexicographically Smallest String
Coding · Greedy · Hash Table · Stack
- Valid Parenthesis String
Coding · Bracket Sequences · Dynamic Programming · Greedy
Sources · 2 references
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 316. Remove Duplicate Letters
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
TikTok
Remove Duplicate Letters
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 69.8. This is not an interview probability.
View source