mathdatech/Python

Fork 0

mirror of https://github.com/TheAlgorithms/Python.git synced 2025-05-10 06:13:57 +00:00

History

Hardik Pawar 4de67b014c Improve comments, add doctests to coloring.py

2024-09-30 20:35:42 +05:30

__init__.py

Add __init__.py files in all the directories (#2503 )

2020-09-28 19:42:36 +02:00

all_combinations.py

[pre-commit.ci] pre-commit autoupdate (#11322 )

2024-03-13 07:52:41 +01:00

all_permutations.py

Fixes #9943 (#10252 )

2024-06-02 20:00:26 -07:00

all_subsequences.py

Fixes #9943 (#10252 )

2024-06-02 20:00:26 -07:00

coloring.py

Improve comments, add doctests to coloring.py

2024-09-30 20:35:42 +05:30

combination_sum.py

Upgrade to Python 3.12 (#9576 )

2023-10-03 14:47:10 +05:30

crossword_puzzle_solver.py

Enable ruff PLR5501 rule (#11332 )

2024-03-28 18:25:41 +01:00

generate_parentheses.py

Generate parentheses (#10903 )

2023-10-29 13:55:31 +01:00

hamiltonian_cycle.py

[pre-commit.ci] pre-commit autoupdate (#11322 )

2024-03-13 07:52:41 +01:00

knight_tour.py

[pre-commit.ci] pre-commit autoupdate (#11473 )

2024-07-02 07:02:29 +02:00

match_word_pattern.py

Match a pattern and String using backtracking (#9861 )

2023-10-06 11:45:10 +13:00

minimax.py

[pre-commit.ci] pre-commit autoupdate (#11322 )

2024-03-13 07:52:41 +01:00

n_queens_math.py

[pre-commit.ci] pre-commit autoupdate (#11322 )

2024-03-13 07:52:41 +01:00

n_queens.py

[pre-commit.ci] pre-commit autoupdate (#11322 )

2024-03-13 07:52:41 +01:00

power_sum.py

Updated test cases of power_sum.py (#9978 )

2023-10-14 04:31:43 -04:00

rat_in_maze.py

UPDATED rat_in_maze.py (#9148 )

2023-10-04 20:43:17 +02:00

README.md

Add README files 1/7 (#5754 )

2021-11-04 18:49:36 +08:00

sudoku.py

Enable ruff RUF002 rule (#11377 )

2024-04-22 21:51:47 +02:00

sum_of_subsets.py

[pre-commit.ci] pre-commit autoupdate (#11322 )

2024-03-13 07:52:41 +01:00

word_search.py

backtracking -> word_search - replacing the example in doctest (#10188 )

2023-10-10 00:16:02 -04:00

README.md

Backtracking

Backtracking is a way to speed up the search process by removing candidates when they can't be the solution of a problem.