Previous Permutation With One Swap
Given an array of positive integers arr (not necessarily distinct), return the lexicographically largest permutation that is smaller than arr, that can be made with exactly one swap. If it cannot be done, then return the same array.
Note that a swap exchanges the positions of two numbers arr[i] and arr[j].
Example 1
Input
arr = [3,2,1]Output
[3,1,2]Swapping 2 and 1 produces the largest permutation smaller than the original array.
Example 2
Input
arr = [1,1,5]Output
[1,1,5]This is already the smallest permutation.
Constraints
- 1 <= arr.length <= 10^4
- 1 <= arr[i] <= 10^4
Asked at 1 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.