This is second fresh attempt to study Computer Algorithms and Data Structures by following the MIT Course.
In this repository I'm using Python, in order to also gain some practice, like in Kata! I try to make them as good as possible but I take no responsibility for any problems or errors you may incur if you try to use them :)
- Finding peaks in arrays, both 1-dimensional and 2-dimensional arrays.
- Merge of N arrays (lists)
- Graph (using adjacency lists for its implementation)
- Breadth-first Traversal (BFT)
- MaxHeap and basic operations
- Python 3.12
- Poetry 1.8.2 or better
- Nox 1.0.3
As alternative, you can use the bundled remote container configuration for Visual Studio Code.
You can install My Python Kata via pip from PyPI:
$ pip install my-python-kataOpen this project in Visual Studio Code with remote container extenstion and have fun :)
Contributions are very welcome. To learn more, see the Contributor Guide.
Distributed under the terms of the MIT license, My Python Kata is free and open source software.
If you encounter any problems, please file an issue along with a detailed description.
This project was generated from @cjolowicz's Hypermodern Python Cookiecutter template.