lexicographically-smallest-string-after-deleting-duplicate-characters

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given a string <code>s</code> that consists of lowercase English letters.

You can perform the following operation any number of times (possibly zero times):

<ul>
	<li>Choose any letter that appears at least twice in the current string <code>s</code> and delete any one occurrence.</li>
</ul>

Return the lexicographically smallest resulting string that can be formed this way.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;aaccb&quot;

Output: &quot;aacb&quot;

Explanation:

We can form the strings <code>&quot;acb&quot;</code>, <code>&quot;aacb&quot;</code>, <code>&quot;accb&quot;</code>, and <code>&quot;aaccb&quot;</code>. <code>&quot;aacb&quot;</code> is the lexicographically smallest one.

For example, we can obtain <code>&quot;aacb&quot;</code> by choosing <code>&#39;c&#39;</code> and deleting its first occurrence.
</div>

Example 2:

<div class="example-block">
Input: s = &quot;z&quot;

Output: &quot;z&quot;

Explanation:

We cannot perform any operations. The only string we can form is <code>&quot;z&quot;</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 105</code></li>
	<li><code>s</code> contains lowercase English letters only.</li>
</ul>

Weekly Contest 485

weekly-contest-485

lexSmallestAfterDeletion

Senior Staff

Lexicographically Smallest String After Deleting Duplicate Characters

Hash Table

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