Amarkant814
diff --git a/‎May Leetcode Challenge 2021/29 N-queensII.py
Copy file name to clipboard
+16Lines changed: 16 additions & 0 deletions b/‎May Leetcode Challenge 2021/29 N-queensII.py
Copy file name to clipboard
+16Lines changed: 16 additions & 0 deletions
@@ -0,0 +1,16 @@
+class Solution:
+    def totalNQueens(self, n: int) -> int:
+        
+        def dfs(board, i, c1, c2, c3):
+            if i == n:
+                self.ans += 1
+                
+            for j in range(n):
+                if c1 & 1<<j or c2 & 1<<i-j+n or c3 & 1<<i+j: continue
+                dfs(board + [j], i + 1, c1 ^ 1<<j, c2 ^ 1<<i-j+n, c3 ^ 1<<i+j)
+                
+        self.ans = 0
+        dfs([], 0, 0, 0, 0)
+        
+        return self.ans
+