Smallest Subsequence of Distinct Characters (LeetCode 316)
MediumLeetCode 316 · String Building & Greedy · Google, Amazon +7 · 23:04Remove Duplicate Letters · Why Monotonic Stack · Intuition · Leetcode - 316 · Same as Leetcode 1081My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 316 Smallest Subsequence of Distinct Characters by codestorywithMIK: Strings, Medium. Topics: String, Stack, Greedy, Monotonic Stack. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- String, Stack, Greedy, Monotonic Stack
- Patterns
- String Building & Greedy
- Chapter
- Strings
- Duration
- 23:04
Related problems
- Words Within Two Edits of Dictionary (LeetCode 2452)
- Check If Two String Arrays are Equivalent (LeetCode 1662)
- Orderly Queue -(Amazon): Explanation ➕ Live Coding (LeetCode 899)
- Make The String Great (LeetCode 1544)
- Detect Capital -(GOOGLE) : Explanation ➕ Live Coding 🧑🏻💻👩🏻💻 (LeetCode 520)
- Delete Columns to Make Sorted (LeetCode 944)
- Restore IP Addresses (LeetCode 93)
- Concatenated Words (LeetCode 472)