This repository contains implementations of various data structures and algorithms commonly used in computer science.

The following data structures have been implemented:

• Array
• Matrix
• String
• Set
• Map
• List
• Stack
• Queue
• Deque
• Linked List (Singly and Doubly)
• Binary Search Tree
• Heap
• Hash Table
• Trie
• Graph (Adjacency List and Adjacency Matrix)

The following algorithms have been implemented:

• Sorting Algorithms (Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Heap Sort, Counting Sort, Radix Sort)
• Search Algorithms (Linear Search, Binary Search)
• Graph Algorithms (Breadth-First Search, Depth-First Search, Dijkstra's Algorithm, Bellman-Ford Algorithm)

Contributions to this repository are always welcome. If you find any issues with the existing code or have an idea for a new feature, please open an issue or create a pull request.

This project is licensed under the MIT License. Feel free to use and modify the code as per your requirements.