Categorygithub.com/szhou12/leetcode-goleetcode0051-N-Queens
package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
Overview
Dependencies
1
Dependents
0

# README

51. N-Queens

Solution idea

DFS

Pruning: check if the column to place a new Queen is:

  1. vertical to any previous Queens' column;

  2. diagonal to any previous Queens (slope == 1)

  3. reversely diagonal to any previous Queens (slope == -1)

Time = $n\times T(n-1) + O(n)$ where O(n) is for check valid = $O(n!)$ OR $O(n^n)$ ???

Space = $O(n)$