This is dedicated repository for maintaining data structures and algorithm code. This repository will be helpful for students preparing for internships or campus placements.
Explore the docs »
View Demo
·
Report Bug
·
Request Feature
Table of Contents
To run any of the Code/Program follow this steps to run it locally on your machine. To get a local copy up and running follow these simple example steps.
Based on your choice of program choose your desired compiler to be installed on your machine
- Python
- C++
- C
Use this Repository to learn and prepare for your internships and campus placements. This repository will contain most of the Repository which will be helpful to students.
For more examples, please refer to the Documentation
- ADT / Linked List
- Binary Tree
- Graphs
- Linked List
- Miscellaneous
- Searching
- Sorting
- Backtracking
- Dynamic Programming
- Hashing
See the open issues for a full list of proposed features (and known issues).
Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.
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!
- Fork the Project
- 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.