Minimum Possible Integer After at Most K Adjacent Swaps On Digits
You are given a string num representing the digits of a very large integer and an integer k. You are allowed to swap any two adjacent digits of the integer at most k times.
Return the minimum integer you can obtain also as a string.
Example 1
Input
num = "4321", k = 4Output
"1342"The steps to obtain the minimum integer from 4321 with 4 adjacent swaps produce 1342.
Example 2
Input
num = "100", k = 1Output
"010"It's ok for the output to have leading zeros, but the input is guaranteed not to have any leading zeros.
Constraints
- 1 <= num.length <= 3 * 10^4
- num consists of only digits and does not contain leading zeros.
- 1 <= k <= 10^9