Welcome to the JavaScript Data Structures and Algorithms repository! This repository contains implementations of various data structures and algorithms in JavaScript.
This repository serves as a collection of commonly used data structures and algorithms implemented in JavaScript. Whether you're studying for technical interviews or looking to strengthen your understanding of fundamental computer science concepts, this repository can serve as a valuable resource.
Here's a list of data structures currently implemented in this repository:
- Array
- Linked List
- Stack
- Queue
- Binary Search Tree
- Heap
- Hash Table
- Graph
Each data structure comes with its implementation along with methods to manipulate and interact with the data structure.
Here's a list of algorithms currently implemented in this repository:
- Sorting algorithms (Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort)
- Searching algorithms (Linear Search, Binary Search)
- Graph algorithms (Depth-First Search, Breadth-First Search, Dijkstra's Algorithm, A* Search)
- Dynamic Programming algorithms
- String manipulation algorithms
- And more!
Each algorithm comes with its implementation along with comments explaining the algorithm's logic and time complexity.
Contributions are welcome! If you have additional data structures or algorithms you'd like to contribute, feel free to open a pull request. Before contributing, please make sure to read our contributing guidelines.
This project is licensed under the MIT License - see the LICENSE file for details.