Valid board configurations


Suppose you are given a board with dimensions N by N. Given N, write a function that returns the number of possible arrangements of the board where N queens can be placed on the board without threatening each other (e.g. no 2 queens can share the same row, column, or diagonal).


Access restricted

Subscribe to premium account to see the solution.

Get premium now