remove-duplicate-letters

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given a string <code>s</code>, remove duplicate letters so that every letter appears once and only once. The relative order of the letters that were not removed must be preserved. You must make sure your result is the smallest in lexicographical order among all possible results.

&nbsp;
Example 1:

<pre>
Input: s = &quot;bcabc&quot;
Output: &quot;abc&quot;
</pre>

Example 2:

<pre>
Input: s = &quot;cbacdcbc&quot;
Output: &quot;acdb&quot;
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 104</code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

&nbsp;
Note: This question is the same as 1081: <a href="https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/" target="_blank">https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/</a>

removeDuplicateLetters

Remove Duplicate Letters

String

Stack

Greedy

Monotonic Stack

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

Given a string s, remove duplicate letters so that every letter appears once and only once. The relative order of the letters that were not removed must be preserved. You must make sure your result is the smallest in lexicographical order among all possible results.

 

Example 1:


Input: s = "bcabc"
Output: "abc"


Example 2:


Input: s = "cbacdcbc"
Output: "acdb"


 

Constraints:

 * 1 <= s.length <= 104
 * s consists of lowercase English letters.

 

Note: This question is the same as 1081: https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/ [https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/]