You are given a string s consisting of lowercase English letters.
In one operation, you can select any substring of s that is not the entire string and sort it in non-descending alphabetical order.
Return the minimum number of operations required to make s sorted in non-descending order. If it is not possible, return -1.
Example 1:
Input: s = "dog"
Output: 1
Explanation:
"og" to "go".s = "dgo", which is sorted in ascending order. Thus, the answer is 1.Example 2:
Input: s = "card"
Output: 2
Explanation:
"car" to "acr", so s = "acrd"."rd" to "dr", making s = "acdr", which is sorted in ascending order. Thus, the answer is 2.Example 3:
Input: s = "gf"
Output: -1
Explanation:
s under the given constraints. Thus, the answer is -1.Constraints:
1 <= s.length <= 105s consists of only lowercase English letters.Loading editor...
"dog"