Previous Permutation With One Swap

Given an array of integers, return the lexicographically largest permutation that is smaller than the original and can be obtained with exactly one swap (or the original if none exists). The core challenge is choosing which pair to swap—find the rightmost position where a decrease is possible and exchange it with the largest smaller distinct value to its right.