This repository contains my collection of solved DSA (Data Structures and Algorithms) questions. I have solved these questions from various online platforms like LeetCode, HackerRank, and Codeforces, as well as from different textbooks and online tutorials.
The purpose of this repository is to showcase my progress in Data Structures and Algorithms (DSA) and provide a resource for other learners to use for reference or practice. This collection contains my solutions to various DSA questions from different platforms, including LeetCode, HackerRank, and Codeforces.
I created this repository as a way to track my learning progress in DSA. It serves as a personal record of my accomplishments and helps me see how much I have improved over time. Additionally, I hope that this repository can be a helpful resource for other learners who are also studying DSA.
Some of the platforms I have used to solve these questions include:
- LeetCode
- HackerRank
- Codeforces
- GeeksforGeeks
The collection covers a wide range of DSA topics, including but not limited to:
- Array and String Manipulation
- Linked Lists
- Trees and Graphs
- Searching and Sorting Algorithms
- Dynamic Programming
- Greedy Algorithms
If you want to use this repository to practice or reference, you can clone the repository to your local machine using the command below:
git clone https://github.com/Nandu0786b/DSA.git
Each question is stored in its own file with the corresponding title. You can easily navigate through the files to find questions that you want to practice or reference.
If you would like to contribute to this repository, feel free to submit a pull request. You can add new questions or improve existing ones by adding more efficient solutions or better explanations.
This repository is licensed under the MIT License.
Please note that these solutions are provided for educational purposes only. They may not be the optimal or most efficient solutions, and there may be better ways to approach these problems. I encourage you to try to solve the problems on your own before consulting these solutions.