https://github.com/bhartik021/leetcode-30-days-of-javascript
Welcome to the LeetCode 30 Days JavaScript Solution Repository! In this repository, you will find JavaScript solutions to the LeetCode 30-Day Challenge problems. This collection of solutions is designed to help you enhance your problem-solving skills, improve your algorithmic thinking, and become a better programmer.
https://github.com/bhartik021/leetcode-30-days-of-javascript
Last synced: 6 months ago
JSON representation
Welcome to the LeetCode 30 Days JavaScript Solution Repository! In this repository, you will find JavaScript solutions to the LeetCode 30-Day Challenge problems. This collection of solutions is designed to help you enhance your problem-solving skills, improve your algorithmic thinking, and become a better programmer.
- Host: GitHub
- URL: https://github.com/bhartik021/leetcode-30-days-of-javascript
- Owner: bhartik021
- License: mit
- Created: 2023-08-11T17:56:54.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2023-08-16T17:50:04.000Z (about 2 years ago)
- Last Synced: 2025-04-11T20:19:48.876Z (6 months ago)
- Language: JavaScript
- Homepage:
- Size: 154 KB
- Stars: 2
- Watchers: 1
- Forks: 3
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# LeetCode 30 Days of JavaScript
Welcome to the LeetCode 30 Days JavaScript Solution Repository! In this repository, you will find JavaScript solutions to the LeetCode 30-Day Challenge problems. This collection of solutions is designed to help you enhance your problem-solving skills, improve your algorithmic thinking, and become a better programmer.
## Table of Contents
1. [Introduction](#introduction)
2. [Usage](#usage)
3. [Problem List](#problem-list)
5. [License](#license)
## Introduction
The LeetCode 30-Day Challenge is a great opportunity to challenge yourself with a variety of coding problems that cover different concepts and algorithms. This repository aims to provide clear and concise JavaScript solutions for each day's challenge, along with explanations and relevant resources.
## Usage
To make the most out of this repository:
1. Clone the repository to your local machine using the following command:
```bash
git clone https://github.com/bhartik021/Leetcode-30-days-of-Javascript.git
```
2. Navigate to the cloned repository:
```bash
cd Leetcode-30-days-of-Javascript
```
## Problem List
| S. No. | Problem Name | Problem No. | Problem Link | Problem Level | Solution Folder |
| ------ | ------------ | ----------- | ------------ | ------------- | -------- |
| 1 | Create Hello World Function | 2667 |[Link](https://leetcode.com/problems/create-hello-world-function/?envType=study-plan-v2&envId=30-days-of-javascript) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2667.%20Create%20Hello%20World%20Function/Solution.js) |
| 2 | Counter | 2620 | [Link](https://leetcode.com/problems/counter/?envType=study-plan-v2&envId=30-days-of-javascript) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2620.%20Counter/Solution.js) |
| 3 | To Be Or Not To Be | 2704 | [Link](https://leetcode.com/problems/to-be-or-not-to-be/?envType=study-plan-v2&envId=30-days-of-javascript) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2704.%20To%20Be%20Or%20Not%20To%20Be/Solution.js) |
| 4 | Counter II | 2665 | [Link](https://leetcode.com/problems/counter-ii/?envType=study-plan-v2&envId=30-days-of-javascript) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2665.%20Counter%20II/Solution.js) |
| 5 | Apply Transform Over Each Element in Array | 2635 | [Link](https://leetcode.com/problems/apply-transform-over-each-element-in-array/?envType=study-plan-v2&envId=30-days-of-javascript) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2635.%20Apply%20Transform%20Over%20Each%20Element%20in%20Array/Solution.js) |
| 6 | Filter Elements from Array | 2634 | [Link](https://leetcode.com/problems/filter-elements-from-array/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2634.%20Filter%20Elements%20from%20Array/Solution.js) |
| 7 | Array Reduce Transformation | 2626 | [Link](https://leetcode.com/problems/array-reduce-transformation/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2626.%20Array%20Reduce%20Transformation/Solution.js) |
| 8 | Function Composition | 2629 | [Link](https://leetcode.com/problems/function-composition/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2629.%20Function%20Composition/Solution.js) |
| 9 | Return Length of Arguments Passed | 2703 | [Link](https://leetcode.com/problems/return-length-of-arguments-passed/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2703.%20Return%20Length%20of%20Arguments%20Passed/Solution.js) |
| 10 | Allow One Function Call | 2666 | [Link](https://leetcode.com/problems/allow-one-function-call/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2666.%20Allow%20One%20Function%20Call/Solution.js) |
| 11 | Memoize | 2623 | [Link](https://leetcode.com/problems/memoize/) | Medium | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2623.%20Memoize/Solution.js) |
| 12 | Add Two Promises | 2723 | [Link](https://leetcode.com/problems/add-two-promises/?envType=study-plan-v2&envId=30-days-of-javascript) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2723.%20Add%20Two%20Promises/Solution.js) |
| 13 | Sleep | 2621 | [Link](https://leetcode.com/problems/sleep/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2621.%20Sleep/Solution.js) |
| 14 | Timeout Cancellation | 2715 | [Link](https://leetcode.com/problems/timeout-cancellation/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2715.%20Timeout%20Cancellation/Solution.js) |
| 15 | Interval Cancellation | 2725 | [Link](https://leetcode.com/problems/interval-cancellation/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2725.%20Interval%20Cancellation/Solution.js) |
| 16 | Promise Time Limit | 2637 | [Link](https://leetcode.com/problems/promise-time-limit/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2637.%20Promise%20Time%20Limit/Solution.js) |
| 17 | Cache With Time Limit | 2622 | [Link](https://leetcode.com/problems/cache-with-time-limit/) | Medium | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2622.%20Cache%20With%20Time%20Limit/Solution.js) |
| 18 | Debounce | 2627 | [Link](https://leetcode.com/problems/debounce/) | Medium | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2627.%20Debounce/Solution.js) |
| 19 | Execute Asynchronous Functions in Parallel | 2721 | [Link](https://leetcode.com/problems/execute-asynchronous-functions-in-parallel/) | Medium | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2721.%20Execute%20Asynchronous%20Functions%20in%20Parallel/Solution.js) |
| 20 | Is Object Empty | 2727 | [Link](https://leetcode.com/problems/is-object-empty/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2727.%20Is%20Object%20Empty/Solution.js) |
| 21 | Chunk Array | 2677 | [Link](https://leetcode.com/problems/chunk-array/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2677.%20Chunk%20Array/Solution.js) |
| 22 | Array Prototype Last | 2619 | [Link](https://leetcode.com/problems/array-prototype-last/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2619.%20Array%20Prototype%20Last/Solution.js) |
| 23 | Group By | 2631 | [Link](https://leetcode.com/problems/group-by/) | Medium | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2631.%20Group%20By/Solution.js) |
| 24 | Sort By | 2724 | [Link](https://leetcode.com/problems/sort-by/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2724.%20Sort%20By/Solution.js) |
| 25 | Join Two Arrays by ID | 2722 | [Link](https://leetcode.com/problems/join-two-arrays-by-id/) | Medium | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2722.%20Join%20Two%20Arrays%20by%20ID/Solution.js) |
| 26 | Flatten Deeply Nested Array | 2625 | [Link](https://leetcode.com/problems/flatten-deeply-nested-array/) | Medium | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2625.%20Flatten%20Deeply%20Nested%20Array/Solution.js) |
| 27 | Compact Object | 2705 | [Link](https://leetcode.com/problems/compact-object/) | Medium | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2705.%20Compact%20Object/Solution..js) |
| 28 | Event Emitter | 2694 | [Link](https://leetcode.com/problems/event-emitter/) | Medium | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2694.%20Event%20Emitter/Solution.js) |
| 29 | Array Wrapper | 2695 | [Link](https://leetcode.com/problems/array-wrapper/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2695.%20Array%20Wrapper/Solution.js) |
| 30 | Calculator with Method Chaining | 2726 | [Link](https://leetcode.com/problems/calculator-with-method-chaining/) | Easy | [Solution](https://github.com/bhartik021/LeetCode-30-Days-of-JavaScript/blob/main/2726.%20Calculator%20with%20Method%20Chaining/Solution.js) |
## License
This repository is licensed under the `MIT License`.
_Happy coding and best of luck with your LeetCode 30-Day Challenge journey! If you find this repository helpful, consider giving it a ⭐ to show your support. If you have any questions or suggestions, feel free to reach out. Let's grow and learn together!_