This repository contains solutions to various Data Structures and Algorithms (DSA) problems implemented in Python. It serves as a collection of practice codes to help you master DSA concepts and improve problem-solving skills.
This repository is designed to help programmers who are learning or practicing Data Structures and Algorithms (DSA). All solutions are written in Python and are organized by data structure or algorithm type for easy reference.
- Arrays
- Linked Lists
- Stacks
- Queues
- Trees
- Graphs
- Hash Tables
- Sorting Algorithms
- Quick Sort
- Merge Sort
- Bubble Sort
- Insertion Sort
- Selection Sort
- Searching Algorithms
- Binary Search
- Linear Search
- Dynamic Programming
- Greedy Algorithms
- Backtracking
- Divide and Conquer
- Fork the repository.
- Create a new branch (
git checkout -b feature-branch
). - Commit your changes (
git commit -m 'Add feature'
). - Push to the branch (
git push origin feature-branch
). - Create a new pull request.
Feel free to submit a pull request for any DSA solution, bug fix, or optimization!
This repository is licensed under the MIT License. See LICENSE for more information.