LC 46

Permutations

Medium · LC 1–100

arraybacktracking
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.740 · metadata_only

Alternate 1

Constraint-satisfaction backtracking

Free

Invariant: At recursion entry, the partial assignment satisfies every activated constraint and every auxiliary set/count exactly matches it; a pruned branch has no legal completion.

candidate confidence: 0.610 · 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.