# Beautiful Arrangement: Walkthrough

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

## Key idea

Backtrack over positions 1..n, placing an unused number x only when x % pos == 0 or pos % x == 0.

## 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(k) where k is the number of arrangements.

## Common mistake

Checking the divisibility condition against the value's original index rather than the position you are filling.

## 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 try it free.