1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number

LeetCodeTwo PointersStringGreedyOpen on judge ↗

You are given a string num, representing a large integer, and an integer k. We call some integer wonderful if it is a permutation of the digits in num and is greater in value than num. There can be many wonderful integers. However, we only care about the smallest-valued ones. - For example, when num = "5489355142": - The 1st smallest wonderful integer is "5489355214". - The 2nd smallest wonde

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI