CodingHardcod-g359

Subject N queensLevel Mid–Senior~30 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

The n-queens puzzle places n queens on an n x n chessboard so that no two attack each other (no shared row, column, or diagonal). Given an integer n (1..12), return the number of distinct solutions. Return an integer.

Implement

total_n_queens(n: int) → int

Examples

in[4]out2

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.