mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 13:49:30 +00:00
37cae3f561
* Updated test cases of power_sum.py * updated * updated. * remove extra comment and used ** instead of pow * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update backtracking/power_sum.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Tianyi Zheng <tianyizheng02@gmail.com> |
||
|---|---|---|
| .. | ||
| __init__.py | ||
| all_combinations.py | ||
| all_permutations.py | ||
| all_subsequences.py | ||
| coloring.py | ||
| combination_sum.py | ||
| hamiltonian_cycle.py | ||
| knight_tour.py | ||
| match_word_pattern.py | ||
| minimax.py | ||
| n_queens_math.py | ||
| n_queens.py | ||
| power_sum.py | ||
| rat_in_maze.py | ||
| README.md | ||
| sudoku.py | ||
| sum_of_subsets.py | ||
| word_search.py | ||
Backtracking
Backtracking is a way to speed up the search process by removing candidates when they can't be the solution of a problem.