English | 简体中文
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
- array
- 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
- tree
- union-find
The repo is maintained by
And thanks to all the contributors who helped in building the repo.