Welcome to the Algorithms in JavaScript repository!
This repo contains clean and well-documented implementations of fundamental and advanced algorithms using modern JavaScript (ES6+). A helpful resource for coding interview preparation, competitive programming, or deepening your understanding of algorithms.
This repository contains implementation of algorithms categorized by type. Each algorithm file includes:
- Problem Description
- Time and Space Complexity
- JavaScript Implementation
- Sample Input/Output
- Linear Search
- Binary Search
- Interpolation Search
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Tower of Hanoi
- Fibonacci Sequence
- Binary Search (recursive)
- Climbing Stairs
- Longest Common Subsequence
- 0/1 Knapsack Problem
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Dijkstra’s Algorithm
- Activity Selection
- Huffman Coding
More algorithms will be added regularly.
# Clone the repository
git clone https://github.com/your-username/algorithms-js.git
# Navigate into the directory
cd algorithms-js
# Run a file using Node.js
node folder_name/file_name.js
If this repo helps you, don’t forget to star it and share it!
---
Would you like me to personalize this with your GitHub repo name or add more example code blocks?