This repository is a collection of essential data structures and algorithms implemented in Python, designed to provide a convenient "toolkit" for developers. The purpose of this library is to offer reusable and efficient solutions to common challenges and save developers valuable time and effort.
- Clear Documentation: Each module consists of detailed explanations and comments to help you understand and integrate the code into your own projects.
- Time Complexity: The time complexity is calculated for various scenarios and is documented within the code comments. This provides insight into the efficiency of the implemented algorithms in different situations.
- Testing Cases: A collection of test cases are included to show and ensure the correctness and reliability of the implemented data structures and algorithms.
- Error Handling: Robust error handling mechanisms to provide informative error messages and improve the library's resilience in real-world applications.
- Python (Version 3.12.0)
- Node
- Singly Linked List (Basic functionality completed and tested. Looking for new features or methods to add.)
- Merge Sort for Linked Lists (Not working, need to be debugged and fixed.)
Contributions to this project are welcome! I am constantly looking to improve readability, code quality, and the efficiency of my code so feel free to submit issues or pull requests if you have any changes or suggestions to make.
For questions or feedback, please contact me on my profile.