History

Prathamesh Gadekar 84f101ca6e Add/generate parentheses iterative approach (#10024 ) * Generate parantheses iterative * Generate parantheses iterative * Generating parantheses code using iterative approach * Update generate_parentheses_iterative.py * updating DIRECTORY.md * Update generate_parentheses_iterative.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update generate_parentheses_iterative.py * Update generate_parentheses_iterative.py * Update generate_parentheses_iterative.py --------- Co-authored-by: nightmare10123 <pgadekar10123@gmail.com> Co-authored-by: Maxim Smolskiy <mithridatus@mail.ru> Co-authored-by: MaximSmolskiy <MaximSmolskiy@users.noreply.github.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>		2025-08-28 01:22:12 +03:00
..
README.md	Add README files 1/7 (#5754 )	2021-11-04 18:49:36 +08:00
__init__.py	Add __init__.py files in all the directories (#2503 )	2020-09-28 19:42:36 +02:00
all_combinations.py	doctest all_combinations.py (#12506 )	2025-01-12 17:54:23 -08: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	[pre-commit.ci] pre-commit autoupdate (#11322 )	2024-03-13 07:52:41 +01:00
combination_sum.py	Combination sum fix and test cases (#10193 )	2025-08-28 00:07:46 +03:00
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
generate_parentheses_iterative.py	Add/generate parentheses iterative approach (#10024 )	2025-08-28 01:22:12 +03: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.py	Fix n-queens problem (#12583 )	2025-02-22 11:16:29 +03:00
n_queens_math.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
sudoku.py	Enable ruff RUF002 rule (#11377 )	2024-04-22 21:51:47 +02:00
sum_of_subsets.py	Add tests and cleanup sum_of_subsets algorithm (#12746 )	2025-05-23 00:07:43 +03:00
word_break.py	Add Word Break algorithm (#11687 )	2024-10-02 17:03:48 -07:00
word_ladder.py	Add word ladder algorithm in backtracking (#11590 )	2024-10-01 19:48:17 -07: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.