Leetcode 1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number

Find the k-th lexicographically next permutation of the digit string (the k-th smallest greater permutation) and return the minimum number of adjacent digit swaps needed to transform the original string into that target permutation. This combines generating next-permutations and counting the minimal adjacent moves to reorder digits.