## N-Queens II

QUESTION Follow up for N-Queens problem. Now, instead outputting board configurations, return the total number of distinct solutions. This question is provided by LeetCode.

QUESTION The n-queens puzzle is the problem of placing n queens on an n*n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens puzzle. Each solution contains a distinct board configuration of the n-queens’ placement, where ‘Q’ and ‘.’ both indicate a queen and Read the full article…