Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 262
What does the backtracking solution to N-Queens rely on to prune?
A
Sorting rows
B
Greedy placement
C
Placing queens row by row and tracking used columns and diagonals in sets/bitmasks, abandoning conflicting partial placements
D
Trying all n^n placements