N-Queens II

class Solution { public int totalNQueens(int n) { int[][] matrix = new int[n][n]; int[] hashPath1 = new int[n]; int[] hashPath2 = new int[2*n -1]; int[] hashPath3 = new int[2*n -1]; return queens(0,n,matrix...