LC 31

Next Permutation

Medium · LC 1–100

arraytwo-pointers
Free

Candidate solution routes

Primary

Permutation backtracking

Free

Invariant: At depth pos, path contains exactly pos distinct indices, used matches path exactly, and equal values at one level expand through only their canonical representative.

candidate confidence: 0.565 · metadata_only

Alternate 1

Opposite-Direction Two Pointers

Free

Invariant: Every uneliminated pair uses endpoints inside [l,r]; a moved endpoint is proven unable to pair with any remaining opposite endpoint to satisfy the goal.

candidate confidence: 0.452 · metadata_only

Alternate 2

Same-Direction / Read-Write Pointers

Free

Invariant: After processing a[0:read], a[0:write] is exactly its correct stable filtered output, with write no farther than read+1.

candidate confidence: 0.434 · metadata_only

How to use this page

Read the statement and constraints first, then validate recognition signals, invariant, and complexity. Candidate score is not correctness evidence.