1830. Minimum Number of Operations to Make String Sorted

You are given a string s (0-indexed)​​​​​​. You are asked to perform the following operation on s​​​​​​ until you get a sorted string: - Find the largest index i such that 1 <= i < s.length and s[i] < s[i - 1]. - Find the largest index j such that i <= j < s.length and s[k] < s[i - 1] for all the possible values of k in the range [i, j] inclusive. - Swap the two characters at indices i - 1​​​​