minimum-operations-to-transform-string

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> consisting only of lowercase English letters.

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

<ul>
	<li>
	Choose any character <code>c</code> in the string and replace every occurrence of <code>c</code> with the next lowercase letter in the English alphabet.
	</li>
</ul>

Return the minimum number of operations required to transform <code>s</code> into a string consisting of only <code>&#39;a&#39;</code> characters.

Note: Consider the alphabet as circular, thus <code>&#39;a&#39;</code> comes after <code>&#39;z&#39;</code>.

&nbsp;
Example 1:

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

Output: 2

Explanation:

<ul>
	<li>Change <code>&#39;y&#39;</code> to <code>&#39;z&#39;</code> to get <code>&quot;zz&quot;</code>.</li>
	<li>Change <code>&#39;z&#39;</code> to <code>&#39;a&#39;</code> to get <code>&quot;aa&quot;</code>.</li>
	<li>Thus, the answer is 2.</li>
</ul>
</div>

Example 2:

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

Output: 0

Explanation:

<ul>
	<li>The string <code>&quot;a&quot;</code> only consists of <code>&#39;a&#39;</code>​​​​​​​ characters. Thus, the answer is 0.</li>
</ul>
</div>

&nbsp;
Constraints:

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

Weekly Contest 466

weekly-contest-466

minOperations

Senior

Minimum Operations to Transform String

String

Greedy

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 consisting only of lowercase English letters.

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

 * Choose any character c in the string and replace every occurrence of c with the next lowercase letter in the English alphabet.

Return the minimum number of operations required to transform s into a string consisting of only 'a' characters.

Note: Consider the alphabet as circular, thus 'a' comes after 'z'.

 

Example 1:

Input: s = "yz"

Output: 2

Explanation:

 * Change 'y' to 'z' to get "zz".
 * Change 'z' to 'a' to get "aa".
 * Thus, the answer is 2.

Example 2:

Input: s = "a"

Output: 0

Explanation:

 * The string "a" only consists of 'a' characters. Thus, the answer is 0.

 

Constraints:

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