Code Room
CodingMedium
Question
Given an array of integers nums, rearrange it IN PLACE into the lexicographically next greater permutation of its elements. If no greater permutation exists (the array is in descending order), rearrange it to the lowest order (ascending). Return the resulting array. Must use O(1) extra space. Constraints: 1 <= len(nums) <= 10^4, 0 <= nums[i] <= 100.
Implement
next_permutation(nums: list[int]) → list[int]Examples
in
[[1,2,3]]out[1,3,2]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Learn the concepts
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.
Run or narrate your approach, then ask the coach.