Create 0052-N-Queens-ii.java

[sumit16sharma]

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.

Input: n = 4 Output: 2 Explanation: There are two distinct solutions to the 4-queens puzzle as shown.

[a93a]

Could you please follow the Contribution Guildelines and provide Submission URL and use the PR template. Thanks.