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

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

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

2023 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 (2023) programming challenges by @midudev.

Awesome Lists containing this project

README

          


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


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 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 only in 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.

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


Challenges

| # | Challenge | Difficulty | Points earned | Description |
| :-------: | ---------------------------------------------------------------------------------------------------------------------------------------- | :--------: | :-----------: | :------------------------: |
| 01 | Find the first ID number that has been repeated | ๐ŸŸข | **220** | [Show](./src/01-challenge) |
| 02 | Return a list of craftable gifts | ๐ŸŸข | **280** | [Show](./src/02-challenge) |
| 03 | Return the first extra step that has been added or removed in the manufacturing chain | ๐ŸŸข | **360** | [Show](./src/03-challenge) |
| 04 | Take a string and reverse the characters inside each pair of parentheses and remove them | ๐ŸŸ  | **270** | [Show](./src/04-challenge) |
| 05 | Return an array simulating a sled movement | ๐ŸŸ  | **160** | [Show](./src/05-challenge) |
| 06 | Return the maximum distance that the reindeer can travel in any direction | ๐ŸŸข | **290** | [Show](./src/06-challenge) |
| 07 | Generate a drawing of a 3D gift | ๐ŸŸข | **210** | [Show](./src/07-challenge) |
| 08 | Take a string of gifts as an argument and return a string representing the warehouse | ๐ŸŸ  | **250** | [Show](./src/08-challenge) |
| 09 | Return the minimum number of lights that need to be changed for the colors to alternate | ๐ŸŸข | **360** | [Show](./src/09-challenge) |
| 10 | Create a customized Christmas tree | ๐ŸŸข | **250** | [Show](./src/10-challenge) |
| 11 | Return indexes of a palindrome word | ๐ŸŸ  | **25** | [Show](./src/11-challenge) |
| 12 | Detect if one letter is a copy of another | ๐ŸŸ  | **210** | [Show](./src/12-challenge) |
| 13 | Return the time lack or left in order to finish the deliveries | ๐ŸŸข | **230** | [Show](./src/13-challenge) |
| 14 | Determine the maximum number of gifts Santa can deliver in one night | ๐ŸŸ  | **290** | [Show](./src/14-challenge) |
| 15 | Given a warehouse and the movements, return an array with the robot's final position | ๐ŸŸ  | **40** | [Show](./src/15-challenge) |
| 16 | Transform an array into an object | ๐ŸŸข | **160** | [Show](./src/16-challenge) |
| 17 | Merge overlapping intervals and returns an array of sorted intervals | ๐ŸŸข | **140** | [Show](./src/17-challenge) |
| 18 | Given a time, write it as a digital clock of an array of strings arrays | ๐Ÿ”ด | **70** | [Show](./src/18-challenge) |
| 19 | Return a matrix with the sabotaged toys in the adjacent cells | ๐ŸŸ  | **25** | [Show](./src/19-challenge) |
| 20 | Given a matrix of numbers, return another matrix where each element is the average of its original value and the values of its neighbors | ๐Ÿ”ด | **25** | [Show](./src/20-challenge) |
| 21 | Find the longest segment of the string where the number of 0s and 1s is equal | ๐ŸŸ  | **200** | [Show](./src/21-challenge) |
| 22 | Translate the Elves language instructions | ๐ŸŸข | **150** | [Show](./src/22-challenge) |
| 23 | Group dishes by ingredients | ๐ŸŸข | **130** | [Show](./src/23-challenge) |
| 24 | Return all the possible sequences of jumps, sorted from least to most | ๐ŸŸ  | **30** | [Show](./src/24-challenge) |
| 25 | Return the number of moves that Santa must do to deliver all the gifts | ๐ŸŸ  | **110** | [Show](./src/25-challenge) |
| **Total** | | **/** | **4485** | **/** |


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.com 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.