Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/saiyamdubey/dsa_questions
This is my collection of solved DSA questions ... I am Prepairing for the Interview perspective ..
https://github.com/saiyamdubey/dsa_questions
arrarys binary-search cpp cprogramming hackerrank leetcode-solutions sliding-window sorting-algorithms two-pointers
Last synced: about 2 months ago
JSON representation
This is my collection of solved DSA questions ... I am Prepairing for the Interview perspective ..
- Host: GitHub
- URL: https://github.com/saiyamdubey/dsa_questions
- Owner: saiyamdubey
- Created: 2024-01-12T18:16:08.000Z (about 1 year ago)
- Default Branch: master
- Last Pushed: 2024-09-14T20:20:09.000Z (4 months ago)
- Last Synced: 2024-09-15T05:12:19.152Z (4 months ago)
- Topics: arrarys, binary-search, cpp, cprogramming, hackerrank, leetcode-solutions, sliding-window, sorting-algorithms, two-pointers
- Language: C++
- Homepage:
- Size: 1.01 MB
- Stars: 7
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Data Structures and Algorithms (DSA) Practice 🔆
This repository contains solutions to various Data Structures and Algorithms (DSA) questions implemented in C/C++. The purpose of this repository is to provide a resource for individuals studying DSA to practice and understand different problem-solving techniques.
### Table of Contents
Introduction
Directory Structure
Getting Started
Contribution Guidelines
License
Introduction
Data Structures and Algorithms are fundamental concepts in computer science and play a crucial role in writing efficient and scalable code. This repository aims to help you strengthen your understanding of DSA by providing solutions to a variety of problems.
Each problem is categorized based on its difficulty level and the specific DSA topic it covers. The solutions are implemented in C/C++ for clarity and simplicity.
#### Directory Structure
The repository is organized as follows:
mathematica
Copy code
├── Arrays
│ ├── 01_TwoSum.cpp
│ ├── 02_ThreeSum.cpp
│ └── ...
├── LinkedLists
│ ├── 01_ReverseLinkedList.cpp
│ ├── 02_DetectCycle.cpp
│ └── ...
├── Trees
│ ├── 01_InOrderTraversal.cpp
│ ├── 02_LevelOrderTraversal.cpp
│ └── ...
├── Sorting
│ ├── 01_BubbleSort.cpp
│ ├── 02_QuickSort.cpp
│ └── ...
├── Searching
│ ├── 01_BinarySearch.cpp
│ ├── 02_LinearSearch.cpp
│ └── ...
├── DynamicProgramming
│ ├── 01_Fibonacci.cpp
│ ├── 02_LongestCommonSubsequence.cpp
│ └── ...
└── README.md
Feel free to add new problems or suggest improvements to the existing ones.
#### Getting Started
Clone the repository to your local machine:
``` bash
git clone https://github.com/your-username/DSA-Practice.git
Navigate to the specific topic directory you want to work on:
```
```bash
cd DSA-Practice/Arrays
Choose a problem (e.g., 01_TwoSum.cpp) and open it in your preferred text editor or IDE.
```
Implement your solution.
Test your solution with sample inputs and make sure it produces the expected output.
Add, commit, and push your changes to your forked repository:
bash
Copy code
git add .
git commit -m "Add solution for TwoSum problem"
git push origin master
Create a pull request to the main repository.
### Contribution Guidelines
Contributions are welcome! Follow these guidelines to contribute:
#### Fork the repository.
Create a new branch for your feature or bug fix: git checkout -b feature/new-feature.
Make your changes and test thoroughly.
Add, commit, and push your changes to your forked repository.
Create a pull request to the main repository.
Please make sure your code follows the existing coding style, and include a clear and concise description of your changes in the pull request.
License
This repository is licensed under the MIT License - see the LICENSE file for details. Feel free to use the code for personal or educational purposes.
## Happy coding!