#1081

Smallest Subsequence of Distinct Characters

specialist · 665 · lc medium +30 · verified · 63.1% accepted · 2,756 likes · top 65%

Description

Given a string s, return the lexicographically smallest subsequence of s that includes every distinct character of s exactly once.

Example 1:

Input: s = "bcabc"

Output: "abc"

Example 2:

Input: s = "cbacdcbc"

Output: "acdb"

Code

1

2

3

class Solution:
    def smallestSubsequence(self, s: str) -> str:

class Solution:
    def smallestSubsequence(self, s: str) -> str: