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 <= 1000s consists of lowercase English letters.Note: This question is the same as 316: https://leetcode.com/problems/remove-duplicate-letters/
Solutions for this problem are being prepared.
Try solving it yourselfLeetCode was HARD until I Learned these 15 Patterns • Ashish Pratap Singh • 1,002,155 views views
Watch 9 more video solutions →Practice Smallest Subsequence of Distinct Characters with our built-in code editor and test cases.
Practice on FleetCode