Problems ListN Queens
Hard
There is a chessboard of size n x n. Your goal is to place n queens on the board such that no two queens attack each other. Return the number of distinct configurations where this is possible.
Example:
Input: n = 4
Output: 2