lexicographically-smallest-string-after-substring-operation

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> consisting of lowercase English letters. Perform the following operation:

<ul>
	<li>Select any non-empty substring then replace every letter of the substring with the preceding letter of the English alphabet. For example, &#39;b&#39; is converted to &#39;a&#39;, and &#39;a&#39; is converted to &#39;z&#39;.</li>
</ul>

Return the lexicographically smallest string after performing the operation.

&nbsp;
Example 1:

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

Output: &quot;baabc&quot;

Explanation:

Perform the operation on the substring starting at index 0, and ending at index 1 inclusive.
</div>

Example 2:

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

Output: &quot;az&quot;

Explanation:

Perform the operation on the last letter.
</div>

Example 3:

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

Output: &quot;abaab&quot;

Explanation:

Perform the operation on the substring starting at index 1, and ending at index 4 inclusive.
</div>

Example 4:

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

Output: &quot;kddsbncd&quot;

Explanation:

Perform the operation on the entire string.
</div>

&nbsp;
Constraints:

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