N-Queens - Read Statement

Place $n$ queens on an $n \times n$ chessboard so that no two queens attack each other (same row, column, or diagonal).

Return all distinct solutions. Each solution is a board configuration where 'Q' and '.' indicate a queen and empty square.