Sign in
The image displays a screenshot of a computer screen, likely from a coding platform or documentation website. The content is a problem description titled "31. Next Permutation". The problem is categorized as "Medium" difficulty and is tagged with "Topics" and "Companies".

The text explains what a permutation of an array of integers is and defines the "next permutation" as the lexicographically next greater permutation of the integers. It provides examples:
- For `arr = [1,2,3]`, the next permutation is `[1,3,2]`.
- For `arr = [2,3,1]`, the next permutation is `[3,1,2]`.
- It states that `[3,2,1]` does not have a lexicographical larger rearrangement, implying it would reset to the smallest possible order, `[1,2,3]`.

The problem statement requires finding the next permutation of a given array of integers `nums` in-place, using only constant extra memory.

An "Example 1" is provided:
- Input: `nums = [1,2,3]`
- Output: `[1,3,2]`

At the bottom of the screen, there are icons indicating likes (21.9K), dislikes, comments (542), favorites, and a share/view button. A green dot labeled "95 Online" suggests there are 95 users currently viewing this content. The background is dark, typical of a code editor or a dark theme website. The computer is positioned in an environment that is not discernible from the image. There are no people visible in the image.
FM-gfeRi2

Sep 20, 2026, 9:57 AM

Unknown, Unknown

Stake attention in this memory

Intelligent
Problem-solving
Focus
Curious
Analytical

The image displays a screenshot of a computer screen, likely from a coding platform or documentation website. The content is a problem description titled "31. Next Permutation". The problem is categorized as "Medium" difficulty and is tagged with "Topics" and "Companies". The text explains what a permutation of an array of integers is and defines the "next permutation" as the lexicographically next greater permutation of the integers. It provides examples: - For `arr = [1,2,3]`, the next permutation is `[1,3,2]`. - For `arr = [2,3,1]`, the next permutation is `[3,1,2]`. - It states that `[3,2,1]` does not have a lexicographical larger rearrangement, implying it would reset to the smallest possible order, `[1,2,3]`. The problem statement requires finding the next permutation of a given array of integers `nums` in-place, using only constant extra memory. An "Example 1" is provided: - Input: `nums = [1,2,3]` - Output: `[1,3,2]` At the bottom of the screen, there are icons indicating likes (21.9K), dislikes, comments (542), favorites, and a share/view button. A green dot labeled "95 Online" suggests there are 95 users currently viewing this content. The background is dark, typical of a code editor or a dark theme website. The computer is positioned in an environment that is not discernible from the image. There are no people visible in the image.

Loading AttnAds…

transactions
revenues
stakers
Earliest
Latest
Highest stake

No transactions found

More from Unknown

Nearby

this memory

nearby events

FM-gfeRi2

Sep 20, 2026, 9:57 AM

Unknown, Unknown

Licensed under Creative Commons Attribution 4.0 International License. You are free to share and adapt this content with proper attribution.