Smallest Subsequence of Distinct Characters - Video Solutions

MediumStringStackGreedyMonotonic Stack

LeetCode was HARD until I Learned these 15 Patterns

13:001,002,155 views

10 video solutions available

Smallest Subsequence of Distinct Characters - Video Solution

Watch 10 video solutions for Smallest Subsequence of Distinct Characters, a medium level problem involving String, Stack, Greedy. This walkthrough by Ashish Pratap Singh has 1,002,155 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.

Problem Statement

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-duplicate-letters/

Read full problem with examples

Continue Learning

Practice this problem

Solve it on FleetCode

Read Solution & Explanation

Detailed text walkthrough

Smallest Subsequence of Distinct Characters - Video Solutions

LeetCode was HARD until I Learned these 15 Patterns

Minimum Window Substring - Airbnb Interview Question - Leetcode 76

Longest Common Subsequence - Dynamic Programming - Leetcode 1143

Distinct Subsequences - Dynamic Programming - Leetcode 115 - Python

Remove Duplicate Letters | Leetcode #316

remove duplicate letters | leetcode 316 | smallest subsequence of distinct characters| leetcode 1081

Remove Duplicate Letters | Why Monotonic Stack | Intuition | GOOGLE | Leetcode - 316

Append Characters to Strings to Make Subsequence - Leetcode 2486 - Python

LeetCode | 1081. Smallest Subsequence of Distinct Characters | Monotonic Stack

Leetcode 1081. Smallest Subsequence of Distinct Characters | Medium| IIITian

Smallest Subsequence of Distinct Characters - Video Solution

Problem Statement

Continue Learning

Smallest Subsequence of Distinct Characters - Video Solutions

LeetCode was HARD until I Learned these 15 Patterns

Minimum Window Substring - Airbnb Interview Question - Leetcode 76

Longest Common Subsequence - Dynamic Programming - Leetcode 1143

Distinct Subsequences - Dynamic Programming - Leetcode 115 - Python

Remove Duplicate Letters | Leetcode #316

remove duplicate letters | leetcode 316 | smallest subsequence of distinct characters| leetcode 1081

Remove Duplicate Letters | Why Monotonic Stack | Intuition | GOOGLE | Leetcode - 316

Append Characters to Strings to Make Subsequence - Leetcode 2486 - Python

LeetCode | 1081. Smallest Subsequence of Distinct Characters | Monotonic Stack

Leetcode 1081. Smallest Subsequence of Distinct Characters | Medium| IIITian

Smallest Subsequence of Distinct Characters - Video Solution

Problem Statement

Continue Learning