mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
daa1c7529a
* ci: Add `B023` to `.flake8` ignores * refactor: Return `bool`/raise Exception * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * revert: Remove previous branch commit * Update data_structures/binary_tree/segment_tree_other.py Co-authored-by: Christian Clauss <cclauss@me.com> * feat: Apply `__repr__` changes * chore: Fix failing tests * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update data_structures/binary_tree/segment_tree_other.py Co-authored-by: Christian Clauss <cclauss@me.com> * test: Fix doctests * random.choice(population_score[:N_SELECTED])[0] * Update basic_string.py Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Christian Clauss <cclauss@me.com> |
||
|---|---|---|
| .. | ||
| __init__.py | ||
| circular_linked_list.py | ||
| deque_doubly.py | ||
| doubly_linked_list_two.py | ||
| doubly_linked_list.py | ||
| from_sequence.py | ||
| has_loop.py | ||
| is_palindrome.py | ||
| merge_two_lists.py | ||
| middle_element_of_linked_list.py | ||
| print_reverse.py | ||
| singly_linked_list.py | ||
| skip_list.py | ||
| swap_nodes.py | ||