Smallest Subsequence of Distinct Characters

Given a string s, return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once.

DescriptionExplanationSolutions

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.

Hints

Hint 1

Companies

No companies reported yet.

Discussion

Sign in to join the discussion.

Loading discussion...

JavaJavaScriptTypeScriptPython3C#

Run

class Solution { public String smallestSubsequence(String s) { } }

Test results

No test cases yet.