Construct Smallest Number From DI String (LeetCode 2375)
MediumLeetCode 2375 · String Building & Greedy · Google, Amazon +1 · 35:53Construct Smallest Number From DI String · Easy Approaches · Leetcode 2375My 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 2375 Construct Smallest Number From DI String by codestorywithMIK: Strings, Medium. Topics: String, Backtracking, Stack, Greedy. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- String, Backtracking, Stack, Greedy
- Patterns
- String Building & Greedy
- Asked at
- GoogleAmazonGoldman Sachs
- Chapter
- Strings
- Duration
- 35:53
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)