A comprehensive collection of solutions for the 30 Days of JavaScript Study Plan on LeetCode
Getting Started β’ Problems β’ Contributing β’ License
This repository contains my solutions for the 30 Days of JavaScript Study Plan on LeetCode. This focused journey covers essential JavaScript concepts including closures, array transformations, promises, and more.
- β Complete solutions for all problems
- π Clean, well-documented code
- π― Organized by topic categories
- π Direct links to LeetCode problems
- π‘ Best practices and modern JavaScript
# Clone this repository
git clone https://github.com/yourusername/30-days-of-javascript.git
# Navigate to the project directory
cd 30-days-of-javascript
# Run any solution
node closures/2667.js| LeetCode # | Difficulty | Problem | Solution |
|---|---|---|---|
| 2667 | Create Hello World Function | Code | |
| 2620 | Counter | Code | |
| 2704 | To Be Or Not To Be | Code | |
| 2665 | Counter II | Code |
| LeetCode # | Difficulty | Problem | Solution |
|---|---|---|---|
| 2635 | Apply Transform Over Each Element in Array | Code | |
| 2634 | Filter Elements from Array | Code | |
| 2626 | Array Reduce Transformation | Code |
| LeetCode # | Difficulty | Problem | Solution |
|---|---|---|---|
| 2629 | Function Composition | Code | |
| 2703 | Return Length of Arguments Passed | Code | |
| 2666 | Allow One Function Call | Code | |
| 2623 | Memoize | Code |
| LeetCode # | Difficulty | Problem | Solution |
|---|---|---|---|
| 2723 | Add Two Promises | Code | |
| 2621 | Sleep | Code | |
| 2715 | Timeout Cancellation | Code | |
| 2725 | Interval Cancellation | Code | |
| 2637 | Promise Time Limit | Code | |
| 2622 | Cache With Time Limit | Code | |
| 2627 | Debounce | Code | |
| 2721 | Execute Asynchronous Functions in Parallel | Code |
| LeetCode # | Difficulty | Problem | Solution |
|---|---|---|---|
| 2727 | Is Object Empty | Code | |
| 2677 | Chunk Array | Code | |
| 2619 | Array Prototype Last | Code | |
| 2631 | Group By | Code | |
| 2724 | Sort By | Code | |
| 2722 | Join Two Arrays by ID | Code | |
| 2625 | Flatten Deeply Nested Array | Code | |
| 2705 | Compact Object | Code |
| LeetCode # | Difficulty | Problem | Solution |
|---|---|---|---|
| 2694 | Event Emitter | Code | |
| 2695 | Array Wrapper | Code | |
| 2726 | Calculator with Method Chaining | Code |
Total Problems: 30
βββ Easy: 20
βββ Medium: 10
βββ Hard: 0
Completion: 0% ββββββββββββββββββββ
Contributions, issues, and feature requests are welcome! Feel free to check the issues page.
- Fork the project
- Create your feature branch (
git checkout -b feature/AmazingFeature) - Commit your changes (
git commit -m 'Add some AmazingFeature') - Push to the branch (
git push origin feature/AmazingFeature) - Open a Pull Request
This project is licensed under the MIT License - see the LICENSE file for details.
- LeetCode for providing the excellent study plan
- The JavaScript community for continuous inspiration
Made with β€οΈ and JavaScript