An open API service indexing awesome lists of open source software.

https://github.com/hozlucas28/adventjs-solutions-2024

Repository with the solutions of AdventJS (2024) programming challenges by @midudev.
https://github.com/hozlucas28/adventjs-solutions-2024

2024 adventjs challenges husky javascript jest midudev mit-license prettier testing typescript unit-testing

Last synced: 3 months ago
JSON representation

Repository with the solutions of AdventJS (2024) programming challenges by @midudev.

Awesome Lists containing this project

README

          


AdventJS Solutions [2024] ๐ŸŽ…๐ŸŽ„


Repository of AdventJS programming challenges by Midudev.


Summary โ€ข
Installation โ€ข
Challenges โ€ข
Related โ€ข
License โ€ข
Acknowledgments โ€ข
Contact




Summary



This repository serves as a housing solutions to programming challenges of AdventJS. AdventJS, a project developed by Midudev, offers a platform for developers to improve Python, JavaScript or TypeScript skills, through a series of daily challenges spanning 25 days. The challenge begins on December 1st and culminates on December 25th.

> This repository contains all the solutions in Python, JavaScript, and TypeScript.


Installation



  1. Clone the repository.

  2. Install the latest version of Node.js.

  3. Navigate to the directory where you cloned the repository with your favorite CLI.

  4. Run npm install in your CLI to install all necessary packages.

  5. Finally, run npm test in your CLI to execute all challenges/tests (only available for TypeScript files).

> **Note:** If you want to run a specific challenge/test, execute `npm run test:challenge`.


Challenges

| # | Challenge | Difficulty | Stars earned | Description |
| :-------: | ----------------------------------------------------------------------------------------------------- | :--------: | :----------: | :------------------------: |
| 01 | Return an array of unique gifts sorted in ascending order | ๐ŸŸข | **5** | [Show](./src/01-challenge) |
| 02 | Return a string with the names of good child | ๐ŸŸข | **5** | [Show](./src/02-challenge) |
| 03 | Return an object with the organized toys | ๐ŸŸข | **5** | [Show](./src/03-challenge) |
| 04 | Construct a christmas tree with the desired height | ๐ŸŸ  | **5** | [Show](./src/04-challenge) |
| 05 | Return a list with the available pair of all boots with the same size (having a left and a right one) | ๐ŸŸข | **5** | [Show](./src/05-challenge) |
| 06 | Check if the present is inside the box | ๐ŸŸ  | **5** | [Show](./src/06-challenge) |
| 07 | Reorder the packages changed in order to fix the Grinch evil | ๐ŸŸ  | **5** | [Show](./src/07-challenge) |
| 08 | Get the progress of each reindeer in the snow track | ๐ŸŸข | **5** | [Show](./src/08-challenge) |
| 09 | Return the train action in the next step inside or out the board | ๐ŸŸ  | **5** | [Show](./src/09-challenge) |
| 10 | Create a compiler of instructions | ๐ŸŸ  | **5** | [Show](./src/10-challenge) |
| 11 | Decode file names coded by the Grinch | ๐ŸŸข | **5** | [Show](./src/11-challenge) |
| 12 | Calculate the total price of the tree by ornaments | ๐ŸŸข | **5** | [Show](./src/12-challenge) |
| 13 | Check if the robot (after executing a series of movements) return to his original position | ๐Ÿ”ด | **5** | [Show](./src/13-challenge) |
| 14 | Get the minimum number of moves needed for all the reindeer to end up in a stable | ๐ŸŸข | **5** | [Show](./src/14-challenge) |
| 15 | Create a table based on an array with objects | ๐ŸŸข | **5** | [Show](./src/15-challenge) |
| 16 | Remove all adjacent snow piles from the path | ๐ŸŸข | **5** | [Show](./src/16-challenge) |
| 17 | Get how many explosive coal bombs are in the adjacent positions | ๐ŸŸ  | **5** | [Show](./src/17-challenge) |
| 18 | Get the name and address of the child inside the misformatted diary | ๐Ÿ”ด | **5** | [Show](./src/18-challenge) |
| 19 | Draw a tower with the minimum number of boxes for a specific weight | ๐Ÿ”ด | **5** | [Show](./src/19-challenge) |
| 20 | Return an object with the missing and extra gifts | ๐ŸŸข | **5** | [Show](./src/20-challenge) |
| 21 | Return the height of the binary tree | ๐ŸŸข | **5** | [Show](./src/21-challenge) |
| 22 | Get all possible combinations of toys | ๐ŸŸ  | **5** | [Show](./src/22-challenge) |
| 23 | Find missing numbers | ๐ŸŸข | **5** | [Show](./src/23-challenge) |
| 24 | Check if the trees are synchronized | ๐ŸŸ  | **5** | [Show](./src/24-challenge) |
| 25 | Return the value of the program after executing instructions sequence | ๐ŸŸ  | **5** | [Show](./src/25-challenge) |
| 26 | Measure the elves productivity | ๐ŸŸข | **5** | [Show](./src/26-challenge) |
| **Total** | | **/** | **130** | **/** |


Related






License



This repository is under MIT License, if you want to see what you are allowed to do with the content of this repository, please visit choosealicense for more information.


Acknowledgments



Thanks to Miguel รngel Durรกn to develop AdventJS.


Contact


If you want to contact me, please see my socials medias in my GitHub profile.