The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, you need to return all distinct solutions to the puzzle. Each solution must be a distinct board configuration with 'Q' for queens and '.' for empty spaces.
Click Run to execute sample tests.