minimum-length-of-string-after-operations

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>.

You can perform the following process on <code>s</code> any number of times:

<ul>
	<li>Choose an index <code>i</code> in the string such that there is at least one character to the left of index <code>i</code> that is equal to <code>s[i]</code>, and at least one character to the right that is also equal to <code>s[i]</code>.</li>
	<li>Delete the closest occurrence of <code>s[i]</code> located to the left of <code>i</code>.</li>
	<li>Delete the closest occurrence of <code>s[i]</code> located to the right of <code>i</code>.</li>
</ul>

Return the minimum length of the final string <code>s</code> that you can achieve.

&nbsp;
Example 1:

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

Output: 5

Explanation: 
We do the following operations:

<ul>
	<li>Choose index 2, then remove the characters at indices 0 and 3. The resulting string is <code>s = &quot;bacbcbb&quot;</code>.</li>
	<li>Choose index 3, then remove the characters at indices 0 and 5. The resulting string is <code>s = &quot;acbcb&quot;</code>.</li>
</ul>
</div>

Example 2:

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

Output: 2

Explanation: 
We cannot perform any operations, so we return the length of the original string.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 2 * 105</code></li>
	<li><code>s</code> consists only of lowercase English letters.</li>
</ul>

Biweekly Contest 135

biweekly-contest-135

minimumLength

Senior

Minimum Length of String After Operations

Hash Table

String

Counting

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

You are given a string s.

You can perform the following process on s any number of times:

 * Choose an index i in the string such that there is at least one character to the left of index i that is equal to s[i], and at least one character to the right that is also equal to s[i].
 * Delete the closest occurrence of s[i] located to the left of i.
 * Delete the closest occurrence of s[i] located to the right of i.

Return the minimum length of the final string s that you can achieve.

 

Example 1:

Input: s = "abaacbcbb"

Output: 5

Explanation:
We do the following operations:

 * Choose index 2, then remove the characters at indices 0 and 3. The resulting string is s = "bacbcbb".
 * Choose index 3, then remove the characters at indices 0 and 5. The resulting string is s = "acbcb".

Example 2:

Input: s = "aa"

Output: 2

Explanation:
We cannot perform any operations, so we return the length of the original string.

 

Constraints:

 * 1 <= s.length <= 2 * 105
 * s consists only of lowercase English letters.