Next Permutation LeetCode 31 | Dataford Interview Questions

Next Permutation (LeetCode 31).

Asked in the onsite stage. Given an array of integers nums, rearrange it in place into its next lexicographically greater permutation. If no greater permutation exists, rearrange it into ascending order. Return the modified array for testability.

Contract

Input: a nonempty list of integers.
Output: the same list object after modification.

Constraints

1 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
The input list must be modified in place

Function Signature

def next_permutation(nums):

Your question is Next Permutation LeetCode 31. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem