Summary • Installation • Challenges • Related • License • Acknowledgments • Contact
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.
- Clone the repository.
- Install the latest version of Node.js.
- Navigate to the directory where you cloned the repository with your favorite CLI.
- Run
npm installin your CLI to install all necessary packages. - Finally, run
npm testin 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<number>.
| # | Challenge | Difficulty | Stars earned | Description |
|---|---|---|---|---|
| 01 | Return an array of unique gifts sorted in ascending order | 🟢 | 5 | Show |
| 02 | Return a string with the names of good child | 🟢 | 5 | Show |
| 03 | Return an object with the organized toys | 🟢 | 5 | Show |
| 04 | Construct a christmas tree with the desired height | 🟠 | 5 | Show |
| 05 | Return a list with the available pair of all boots with the same size (having a left and a right one) | 🟢 | 5 | Show |
| 06 | Check if the present is inside the box | 🟠 | 5 | Show |
| 07 | Reorder the packages changed in order to fix the Grinch evil | 🟠 | 5 | Show |
| 08 | Get the progress of each reindeer in the snow track | 🟢 | 5 | Show |
| 09 | Return the train action in the next step inside or out the board | 🟠 | 5 | Show |
| 10 | Create a compiler of instructions | 🟠 | 5 | Show |
| 11 | Decode file names coded by the Grinch | 🟢 | 5 | Show |
| 12 | Calculate the total price of the tree by ornaments | 🟢 | 5 | Show |
| 13 | Check if the robot (after executing a series of movements) return to his original position | 🔴 | 5 | Show |
| 14 | Get the minimum number of moves needed for all the reindeer to end up in a stable | 🟢 | 5 | Show |
| 15 | Create a table based on an array with objects | 🟢 | 5 | Show |
| 16 | Remove all adjacent snow piles from the path | 🟢 | 5 | Show |
| 17 | Get how many explosive coal bombs are in the adjacent positions | 🟠 | 5 | Show |
| 18 | Get the name and address of the child inside the misformatted diary | 🔴 | 5 | Show |
| 19 | Draw a tower with the minimum number of boxes for a specific weight | 🔴 | 5 | Show |
| 20 | Return an object with the missing and extra gifts | 🟢 | 5 | Show |
| 21 | Return the height of the binary tree | 🟢 | 5 | Show |
| 22 | Get all possible combinations of toys | 🟠 | 5 | Show |
| 23 | Find missing numbers | 🟢 | 5 | Show |
| 24 | Check if the trees are synchronized | 🟠 | 5 | Show |
| 25 | Return the value of the program after executing instructions sequence | 🟠 | 5 | Show |
| 26 | Measure the elves productivity | 🟢 | 5 | Show |
| Total | / | 130 | / |
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.
Thanks to Miguel Ángel Durán to develop AdventJS.
If you want to contact me, please see my socials medias in my GitHub profile.