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
To run the tests, clone the repo and run :
pytest
- array
- backtrack
- bfs
- bit
- calculator
- dfs
- dp
- graph
- heap
- linkedlist
- map
- maths
- matrix
- queues
- search
- set
- sort
- stack
- strings
- tree
- union-find
The repo is maintained by
And thanks to all the contributors who helped in building the repo.