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

Added N-Queens Backtracking Algorithm to backtracking folder #1291

Merged
merged 11 commits into from
Oct 30, 2024

Conversation

shashmitha46
Copy link
Contributor

@shashmitha46 shashmitha46 commented Oct 25, 2024

📥 Pull Request

Description

Added the N-Queens algorithm to backtracking-algorithms folder, providing a Python solution with backtracking to solve the N-Queens placement problem.

Issue Fixed: Resolves issue #1159 (Adding N-Queens backtracking algorithm).

Fixes #1159

Type of change

  • Bug fix (non-breaking change which fixes an issue)
  • New feature (non-breaking change which adds functionality)
  • Breaking change (fix or feature that would cause existing functionality to not work as expected)
  • Documentation update

Checklist:

  • My code follows the style guidelines of this project
  • I have performed a self-review of my code
  • I have commented my code, particularly in hard-to-understand areas
  • I have added tests that prove my fix is effective or that my feature works
  • New and existing unit tests pass locally with my changes
  • Any dependent changes have been merged and published in downstream modules

Copy link

@github-actions github-actions bot left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👋 Hi @shashmitha46! Thank you for submitting your first pull request to the Algo project. Great job on the contribution! 🎉 We appreciate your efforts, and our team will review it soon. If you have any questions, feel free to ask. Keep up the great work! 🚀

Copy link

@github-actions github-actions bot left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

🎉 Great job, @shashmitha46! Thank you for submitting your pull request. We appreciate your contribution, and our team will review it shortly.

Copy link

github-actions bot commented Oct 25, 2024

⚡️ Lighthouse Report for the Deploy Preview of this PR 🚀

🔗 Site: Algo | Live Site

URL 🌐 Performance Accessibility Best Practices SEO 📊
/algo/ 🟡 54 🟢 96 🟡 75 🟡 86 📄
/algo/docs 🔴 49 🟢 96 🟡 75 🟢 100 📄
/algo/blog 🟡 67 🟢 92 🟢 96 🟡 86 📄

@ajay-dhangar ajay-dhangar added gssoc-ext Contributions made as part of GirlScript Summer of Code Extended Edition. level1 GirlScript Summer of Code | Contributor's Levels labels Oct 25, 2024
Copy link
Owner

@ajay-dhangar ajay-dhangar left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please read our contribution guideline for a better understanding of our format and expectations. When writing content, please follow the guidelines to ensure that your contributions are accepted.

Copy link
Owner

@ajay-dhangar ajay-dhangar left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

update your code based on our format

docs/backtracking-algorithms/n-queens_algorithm.md Outdated Show resolved Hide resolved
Copy link
Owner

@ajay-dhangar ajay-dhangar left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Done

@ajay-dhangar ajay-dhangar merged commit b5eb5e0 into ajay-dhangar:main Oct 30, 2024
Copy link

🎉🎉 Thank you for your contribution! Your PR #1291 has been merged! 🎉🎉

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
gssoc-ext Contributions made as part of GirlScript Summer of Code Extended Edition. level1 GirlScript Summer of Code | Contributor's Levels
Projects
None yet
Development

Successfully merging this pull request may close these issues.

[Feature]: <Feature Name>
2 participants