This repository contains implementation code for various topics related to Data Structures and Algorithms in C++ language.
This repository includes code for the following topics:
- Arrays
- Linked Lists
- Stacks
- Queues
- Trees
- Graphs
- Sorting Algorithms
- Searching Algorithms
- Hash Tables
- Heaps
- Dynamic Programming
- Backtracking
- Greedy Algorithms
- Divide and Conquer
- Bit Manipulation
Each topic has its own directory with separate files containing implementations for different operations on the respective data structure or algorithm.
To run the code in this repository, you need to have a C++ compiler installed on your system. You can use any C++ compiler, but we recommend using GCC or Clang as they are widely used and have good support.
To use the code in this repository, follow these steps:
- Clone the repository to your local machine.
- Navigate to the directory of the topic you are interested in.
- Compile the code using your preferred C++ compiler.
- Run the compiled executable file.
Alternatively, you can also use an integrated development environment (IDE) such as Visual Studio Code or Code::Blocks to compile and run the code.
We welcome contributions to this repository in the form of bug fixes, improvements, and new implementations of data structures and algorithms. If you wish to contribute, please follow these guidelines:
- Fork the repository to your own account.
- Create a new branch with a descriptive name.
- Make your changes to the code.
- Test your changes to ensure they work correctly.
- Submit a pull request to merge your changes into the main repository.
We will review your changes and merge them if they meet our guidelines.
This repository is maintained by Prateek-Wayne.