# Permutations II: Interview Notes

Permutations II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort and backtrack with a used[] array; skip nums[i] when it equals nums[i-1] and nums[i-1] is not used, so each duplicate value is picked in order.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n * n!).

## Common mistake

Generating all n! permutations and uniquing afterward, or skipping the equal-neighbor rule.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at this tool.