Practice Real Company Assessment Patterns • Latest 2025–2026 Mock Tests

Programming Exercises

Write a function to perform the N-Queens Problem (find all valid configurations for placing N queens on an NxN chessboard)

Hard

Problem Statement

Write a function to perform the N-Queens Problem (find all valid configurations for placing N queens on an NxN chessboard)

Sample Input

N = 4

Sample Output

[[.Q.., ...Q, Q..., ..Q.], [..Q., Q..., ...Q, .Q..]]

Limits

Time: 2s · Memory: 256 MB

Code Editor
00:00
import java.util.*; public class Main { public static List<List<String>> solveNQueens() { int n = 4; // Your code here return new ArrayList<>(); } }
Log in or sign up to run or submit your code.Log inSign up
Input
N = 4
Expected Output
[[.Q.., ...Q, Q..., ..Q.], [..Q., Q..., ...Q, .Q..]]