Problemintro
Lexicographic successor of a permutation
Also called next permutation problem.
Given a permutation, return the lexicographically next permutation of the same items.
Given a permutation, return the lexicographically next permutation of the same items.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag G1NQQB Edit this page History Report an error