Optimal Logical Puzzle Coding | Dataford Interview Questions

Implement a function to solve a specific logical puzzle, focusing on optimal time and space complexity.

Solve the N-Queens puzzle: place n queens on an n x n chessboard so that no two queens share a row, column, or diagonal. Return one valid placement as a list where the value at index r is the column chosen for row r; return [] if no solution exists.

Function signature: def solve_n_queens(n):

Constraints: 1 <= n <= 12. Any valid placement is accepted.

Constraints

1 <= n <= 12
Return one valid placement, not every placement
The returned list must contain exactly one column for each row
Return [] when no valid placement exists

Function Signature

def solve_n_queens(n):

Your question is Optimal Logical Puzzle Coding. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem