You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We are looking to enhance our algorithm library by adding a backtracking algorithm implemented in Python. Backtracking is a powerful technique for solving problems incrementally, and it can be used in various applications such as solving puzzles, pathfinding, and combinatorial problems.
Requirements
Implement a backtracking algorithm for one of the following problems:
N-Queens Problem
Sudoku Solver
Subset Sum Problem
Permutations of a string
The implementation should be well-documented, with clear explanations of the algorithm and its time complexity.
Include unit tests to verify the correctness of the implementation.
Guidelines
Follow the project's coding standards and style guidelines.
Ensure that your code is efficient and optimized.
Submit your code as a pull request, and include a description of the changes made.
Labels
Hacktoberfest
enhancement
help wanted
Additional Notes
Feel free to reach out if you have any questions or need guidance on which problem to implement. Happy coding!
The text was updated successfully, but these errors were encountered:
Issue: Implement Backtracking Algorithm in Python
Description
We are looking to enhance our algorithm library by adding a backtracking algorithm implemented in Python. Backtracking is a powerful technique for solving problems incrementally, and it can be used in various applications such as solving puzzles, pathfinding, and combinatorial problems.
Requirements
Guidelines
Labels
Additional Notes
Feel free to reach out if you have any questions or need guidance on which problem to implement. Happy coding!
The text was updated successfully, but these errors were encountered: