https://leetcode.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/ Minimum Adjacent Swaps to Reach the Kth Smallest Number - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com ==문제== num이 주어질 때 그 num을 구성하는 숫자들로 만들 수 있는 num보다 큰 숫자들을 wonderful 하다고 말한다. 그 wonderful in..