JB TAK FODEGA NHI .... TB TK CHODEGA NHI .... (MAANG)

L17 N-Queens II

The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.
Given an integer n, return the number of distinct solutions to the n-queens puzzle.

Example 1:
Input: n = 4
Output: 2 [There are two distinct solutions to the 4-queens puzzle as shown]

Constraints:
- 1 <= nums.length <= 8

Notes

Note: Zoom for Better Understanding

in N-Queen I our task is finding the all the possible path and chessboard and follow the Rules of the N-Queen Placing

in this Problem out task is only count the possible path of the chessboard that follow all Rules

Code Zone!

Recursion Python Code

Recursion Java Code

Recursion C++ Code

Sb Mai He Kru ...

Khud Bhi Kr le Khuch ..... Nalayk

Time Complexity:N! x N
Reason:N! for generating All the Permutation and N: for loop 0 to N every Time Iterate

Space Complexity: O(N) + O(N) O(N) for the my ans DS and O(N) for the Recursive Stack Space.

Optimized Approch is Same that we learned preveslly only change [ We will Count the Path ]

Interview Docs File "All the Best" Team @DSAwithPrinceSingh