An open API service indexing awesome lists of open source software.

https://github.com/createunique/dsacodes


https://github.com/createunique/dsacodes

Last synced: 8 months ago
JSON representation

Awesome Lists containing this project

README

          

# 📚 Data Structures and Algorithms (DSA) Repository

## 📋 Overview

This GitHub repository contains a collection of Data Structures and Algorithms (DSA) implemented in various programming languages. These implementations serve as a reference for DSA concepts and can be useful for educational and coding interview preparation purposes.

The repository is organized into folders, each representing a different DSA category or algorithm. You can navigate through the folders to explore the code implementations. Feel free to use and modify these implementations as needed for your projects.

## 📑 Table of Contents

- [Data Structures](#data-structures)
- [Arrays](#arrays)
- [Linked Lists](#linked-lists)
- [Stacks](#stacks)
- [Queues](#queues)
- [Trees](#trees)
- [Graphs](#graphs)

- [Algorithms](#algorithms)
- [Sorting](#sorting)
- [Searching](#searching)
- [Dynamic Programming](#dynamic-programming)
- [Graph Algorithms](#graph-algorithms)

## 🌿 Data Structures

### Arrays

- [Array Implementation in C++](array/cpp)
- [Array Implementation in Python](array/python)
- [Array Implementation in Java](array/java)

### Linked Lists

- [Singly Linked List in C++](linked-list/cpp)
- [Doubly Linked List in Python](linked-list/python)
- [Circular Linked List in Java](linked-list/java)

### Stacks

- [Stack Implementation in C](stack/c)
- [Stack Implementation in Ruby](stack/ruby)
- [Expression Evaluation using Stack in Python](stack/python)

### Queues

- [Queue Implementation in C++](queue/cpp)
- [Priority Queue in Java](queue/java)
- [Circular Queue in Python](queue/python)

### Trees

- [Binary Search Tree in C++](tree/cpp)
- [AVL Tree in Java](tree/java)
- [Trie Implementation in Python](tree/python)

### Graphs

- [Graph Representation in C](graph/c)
- [Depth-First Search in Python](graph/python)
- [Shortest Path Algorithms in Java](graph/java)

## 🧩 Algorithms

### Sorting

- [Bubble Sort in C](sorting/c)
- [Quick Sort in Python](sorting/python)
- [Merge Sort in Java](sorting/java)

### Searching

- [Binary Search in C++](searching/cpp)
- [Linear Search in Python](searching/python)
- [Hashing Techniques in Java](searching/java)

### Dynamic Programming

- [Fibonacci Sequence in C](dynamic-programming/c)
- [Knapsack Problem in Python](dynamic-programming/python)
- [Longest Common Subsequence in Java](dynamic-programming/java)

### Graph Algorithms

- [Dijkstra's Algorithm in C++](graph-algorithms/cpp)
- [Breadth-First Search in Python](graph-algorithms/python)
- [Minimum Spanning Tree in Java](graph-algorithms/java)

## 🚀 Usage

Feel free to explore the code implementations by navigating to the respective folders. Each folder contains a README with specific instructions and explanations for that particular DSA or algorithm.

If you'd like to use any of these implementations in your project, follow the instructions provided in each folder's README. Be sure to respect the licensing terms mentioned in the individual code files, and consider contributing to the repository if you find any issues or have improvements to suggest.

## 🤝 Contributions

Contributions are welcome! If you'd like to contribute your own DSA implementations or improvements to existing code, please follow the contribution guidelines outlined in [CONTRIBUTING.md](CONTRIBUTING.md).

## 📄 License

This project is licensed under the MIT License. See the [LICENSE](LICENSE) file for details.