This repository contains a collection of algorithm and data structure problems implemented in Python. The problems are categorized based on their type and complexity, ranging from basic arrays to advanced graph algorithms.
- 1D Dynamic Programming
- 2D Dynamic Programming
- Advanced Graphs
- Arrays
- Backtracking
- Binary Search
- Bit Manipulation
- Graphs
- Greedy Algorithms
- Heaps
- Intervals
- Linked Lists
- Sliding Window
- Stack
- Trie
- Two Pointers
- Math and Geometry
To clone the repository, run the following command:
git clone https://github.com/saurav1004/EverythingDSA.gitWe welcome contributions to this repository. If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement". Don't forget to give the project a star! Thanks again!
Create your Feature Branch (git checkout -b feature/AmazingFeature) Commit your Changes (git commit -m 'Add some AmazingFeature') Push to the Branch (git push origin feature/AmazingFeature) Open a Pull Request
Distributed under the MIT License. See LICENSE for more information.