This repository documents my exploration of data structures and algorithms (DSA) using JavaScript. It serves as a personal playground to learn, experiment, and implement various DSA concepts.
These instructions will get you set up to contribute to this project.
You'll need the following things installed on your system:
- Node.js and npm (or yarn): Node.js
-
Clone the repository:
git clone https://github.com/KrshnK/DSA-with-JS.git
-
Navigate to the project directory:
cd DSA-with-JS
-
Install dependencies:
npm install
Here's a list of common DSA topics covered (or potentially covered) in this repository:
- Arrays: Basic operations, searching, sorting, manipulation
- Linked Lists: Singly linked lists, doubly linked lists, operations
- Stacks: LIFO (Last-In-First-Out) principle, implementation, applications
- Queues: FIFO (First-In-First-Out) principle, implementation, applications
- Trees: Binary trees, binary search trees (BST), operations, traversals (inorder, preorder, postorder)
- Hash Tables: Key-value pair storage, collision resolution techniques
- Graphs: Adjacency list, adjacency matrix representation, graph traversals (BFS, DFS)
- Heaps: Min-heaps, max-heaps, implementation, applications (priority queues)
- Sorting Algorithms: Bubble sort, insertion sort, selection sort, merge sort, quick sort, heap sort (time and space complexities)
- Searching Algorithms: Linear search, binary search (for sorted arrays)
- Recursion: Understanding recursive functions, common problems solved with recursion
We encourage contributions to this project! Here's how you can get involved:
- Fork the repository on GitHub.
- Create a new branch for your feature or bug fix.
- Make your changes and commit them to your branch.
- Push your changes to your forked repository.
- Create a pull request from your forked repository to the upstream repository.
Please refer to the GitHub contribution guidelines for more details: https://docs.github.com/contributing
This project is licensed under the MIT License - see the LICENSE file for details.