N-Queens II

Explore how to solve the N-Queens II problem by applying backtracking to count all distinct ways of placing n queens on an n x n chessboard without conflicts. Understand the problem constraints and implement an efficient solution to handle up to n equals 9.