1081. Smallest Subsequence of Distinct Characters

LeetCodeStringStackGreedyMonotonic StackOpen on judge ↗

Given a string s, return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once. Example 1: Input: s = "bcabc" Output: "abc" Example 2: Input: s = "cbacdcbc" Output: "acdb" Constraints: - 1 <= s.length <= 1000 - s consists of lowercase English letters. Note: This question is the same as 316: https://leetcode.com/problems/remove-dup

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI