N Queens Problem

Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

Explanation:

A queen can attack another queen if they are in the same row, column, or diagonal. You need to find and print all valid configurations where queens do not attack each other.

Input:

Single integer 'N' representing the size of the chessboard and the number of queens.

Output:

Each line represents one valid chessboard configuration with 'N' queens. Each line contains 'N * N' elements (0 and 1) printed in a single row and separated by spaces. '1' indicates a queen's position, whereas '0' indicates an empty space.

Example:

Input:

4

Output:

0 0 1 0 1 0 0 0 0 0 0 1 0 1 0 0
0 1 0 0 0 0 0 1 1 0 0 0 0 0 1 0

Constraints:

1

Question

N Queens Problem

Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

Explanation:

A queen can attack another queen if they are in the same row, column, or diagonal. You need to find and print all valid configurations where queens do not attack each other.

Input:

Single integer 'N' representing the size of the chessboard and the number of queens.

Output:

Each line represents one valid chessboard configuration with 'N' queens. Each line contains 'N * N' elements (0 and 1) printed in a single row and separated by spaces. '1' indicates a queen's position, whereas '0' indicates an empty space.

Example:

Input:

Output:

0 0 1 0 1 0 0 0 0 0 0 1 0 1 0 0
0 1 0 0 0 0 0 1 1 0 0 0 0 0 1 0

Constraints:

1 <= N <= 10
Time Limit: 1 sec

Note:

You do not need to print anything, as it is already handled. Just implement the function as specified.

Accepted Answer

The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.

Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not attack each other.
Generate and print valid configurations where queens are placed safely.
Consider constraints and time limit for efficient solution.
Example: For N=4, valid configurations are: 0010100000101000 and 0100000110000100.

N Queens Problem

Explanation:

Input:

Output:

Example:

Input:

Output:

Constraints:

Note:

MagicBricks Software Developer interview questions & answers

Popular interview questions of Software Developer