Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

N-Queen's Problem #2146

Merged
merged 1 commit into from
Oct 3, 2022
Merged

N-Queen's Problem #2146

merged 1 commit into from
Oct 3, 2022

Conversation

Ashutosh-Ray
Copy link
Contributor

I have submitted the N-Queen's Problem Dynamic Programming Question in Java. Please, accept the pull request for Hacktober Fest 2022.

Problem

  • 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 all distinct solutions to the n-queens puzzle. You may return the answer in any order.
    Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space, respectively.

Solution

  • Java solution with Time Complexity O(N*N)

I have submitted the N-Queen's Problem Dynamic Programming Question in Java. Please, accept the pull request for Hacktober Fest.
@fineanmol fineanmol added the hacktoberfest-accepted Accept for hacktoberfest, will merge later label Oct 3, 2022
@fineanmol fineanmol merged commit c245f3d into fineanmol:master Oct 3, 2022
@mohd-afnan-shahab
Copy link

hii @fineanmol Please assign me this issue.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
hacktoberfest-accepted Accept for hacktoberfest, will merge later
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants