If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order). Examples: Input -> output 1,2,3 → 1,3,2 3,2,1 → 1,2,3 1,1,5 → 1,5,1 Problem explanation: Given a number, find the next highest number, using the same digits given in the array. For example: 1234 -> … Continue reading Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.