Skip to content

Latest commit

 

History

History
63 lines (49 loc) · 2.16 KB

README.md

File metadata and controls

63 lines (49 loc) · 2.16 KB
Raw

JavaScript Data Structures and Algorithms Series

Welcome to the JavaScript Data Structures and Algorithms (DSA) Series! This repository contains a collection of code examples and explanations for various data structures and algorithms implemented in JavaScript.

Overview

This repository is dedicated to showcasing different data structures and algorithms implemented in JavaScript. Each section contains a problem statement along with its solution and example usage in JavaScript.

Questions

  • Max Number in an Array
  • Reverse a String
  • Check Palindrome
  • Implement Stack
  • Implement Queue
  • Calculate Factorial
  • Check Prime Number
  • Remove Duplicates from Array
  • Calculate Fibonacci Series
  • Implement Binary Search
  • Check Anagrams
  • Rotate Array
  • Find Missing Number
  • Calculate Power
  • Implement Bubble Sort
  • Find Intersection of Arrays
  • Implement Linked List
  • Find Median of Sorted Arrays
  • Implement Priority Queue
  • Sieve of Eratosthenes
  • Find Longest Substring Without Repeating Characters
  • Implement Binary Tree with In-Order Traversal
  • Fibonacci Series with Memoization
  • Depth-First Search on a Graph
  • Reverse a Linked List
  • Find First Recurring Character
  • Merge Sort Algorithm

Usage

Each folder contains its own set of JavaScript files and explanations pertaining to a specific topic. To explore a particular concept:

  1. Navigate to the respective folder in the repository.
  2. Open the JavaScript file related to the concept you want to explore.
  3. Review the code comments and explanations provided within the file.
  4. Experiment with the code, modify it, and observe the outputs.

Contributions

Contributions to this series are welcome! If you'd like to contribute:

  • Fork the repository.
  • Create a new branch (git checkout -b feature/addition).
  • Make your modifications and add explanations as needed.
  • Commit your changes (git commit -am 'Add new feature').
  • Push to the branch (git push origin feature/addition).
  • Create a pull request.

Please ensure your code follows the repository's standards and includes appropriate comments and explanations for better understanding.

License

This project is licensed under the MIT License.