From b5f844c0f28a69d1cb788e505b0942e874acd121 Mon Sep 17 00:00:00 2001 From: Won Joon Thomas Choi <113500771+724thomas@users.noreply.github.com> Date: Mon, 16 Nov 2026 23:39:53 +0900 Subject: [PATCH] Create 1081. Smallest Subsequence of Distinct Characters.py --- ...llest Subsequence of Distinct Characters.py" | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 "leetcode3/\354\265\234\354\233\220\354\244\200/1081. Smallest Subsequence of Distinct Characters.py" diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/1081. Smallest Subsequence of Distinct Characters.py" "b/leetcode3/\354\265\234\354\233\220\354\244\200/1081. Smallest Subsequence of Distinct Characters.py" new file mode 100644 index 00000000..6b895984 --- /dev/null +++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/1081. Smallest Subsequence of Distinct Characters.py" @@ -0,0 +1,17 @@ +class Solution: + def smallestSubsequence(self, s: str) -> str: + last = {c: i for i, c in enumerate(s)} + stack = [] + visited = set() + + for i, c in enumerate(s): + if c in visited: + continue + + while stack and stack[-1] > c and last[stack[-1]] > i: + visited.remove(stack.pop()) + + stack.append(c) + visited.add(c) + + return "".join(stack)