English | 简体ä¸ć–‡ | Deutsch | 日本語 | í•śęµě–´
Minimal and clean example implementations of data structures and algorithms in Python 3.
Thanks for your interest in contributing! There are many ways to contribute to this project. Get started here
For running all tests write down:
$ python3 -m unittest discover tests
For running some specific tests you can do this as following (Ex: sort):
$ python3 -m unittest tests.test_sort
For running all tests write down:
$ python3 -m pytest tests
If you want to use the API algorithms in your code, it is as simple as:
$ pip3 install algorithms
You can test by creating a python file: (Ex: use merge_sort in sort)
from algorithms.sort import merge_sort
if __name__ == "__main__":
my_list = [1, 8, 3, 5, 6]
my_list = merge_sort(my_list)
print(my_list)If you want to uninstall algorithms, it is as simple as:
$ pip3 uninstall -y algorithms
- arrays
- backtrack
- bfs
- bit
- calculator
- dfs
- dp
- graph
- heap
- linkedlist
- map
- maths
- matrix
- queues
- search
- set
- sort
- stack
- strings
- fizzbuzz
- delete_reoccurring_characters
- strip_url_params
- validate_coordinates
- domain_extractor
- merge_string_checker
- add_binary
- breaking_bad
- decode_string
- encode_decode
- group_anagrams
- int_to_roman
- is_palindrome
- license_number
- make_sentence
- multiply_strings
- one_edit_distance
- rabin_karp
- reverse_string
- reverse_vowel
- reverse_words
- roman_to_int
- word_squares
- unique_morse
- judge_circle
- strong_password
- caesar_cipher
- contain_string
- count_binary_substring
- repeat_string
- tree
- unix
- union-find
The repo is maintained by
And thanks to all the contributors who helped in building the repo.