N-Queens II

Explore the N-Queens II problem where you use backtracking to count all distinct ways of placing n queens on an n by n chessboard without conflicts. Understand problem constraints and practice implementing solutions that ensure no two queens attack each other in rows, columns, or diagonals.