See DFS pattern in N-Queens
steps: k numschoices each step: all other numbers from 1 .. npossibility checker: next number must be greater than all selected numbers
An easy DFS problem.
combinations
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||