Merge pull request #5 from marcode24/2023-01

📄 add LICENSE

Author: marcode24

2023/01-primer-regalo-repetido/README.md

@@ -0,0 +1,42 @@
+# Reto 1: !Primer regalo repetido!
+
+## Problema
+
+En la fábrica de juguetes del Polo Norte, cada juguete tiene un número de identificación único.
+
+Sin embargo, debido a un error en la máquina de juguetes, algunos números se han asignado a más de un juguete.
+
+¡Encuentra el primer número de identificación que se ha repetido, **donde la segunda ocurrencia tenga el índice más pequeño!**
+
+En otras palabras, si hay más de un número repetido, debes devolver el número cuya segunda ocurrencia aparezca primero en la lista. Si no hay números repetidos, devuelve -1.
+
+```js
+const giftIds = [2, 1, 3, 5, 3, 2]
+const firstRepeatedId = findFirstRepeated(giftIds)
+console.log(firstRepeatedId) // 3
+// Aunque el 2 y el 3 se repiten
+// el 3 aparece primero por segunda vez
+
+const giftIds2 = [1, 2, 3, 4]
+const firstRepeatedId2 = findFirstRepeated(giftIds2)
+console.log(firstRepeatedId2) // -1
+// Es -1 ya que no se repite ningún número
+
+const giftIds3 = [5, 1, 5, 1]
+const firstRepeatedId3 = findFirstRepeated(giftIds3)
+console.log(firstRepeatedId3) // 5
+```
+
+**¡Ojo!** Los elfos dicen que esto es una prueba técnica de Google.
+
+## Mi solución
+
+```js
+const findFirstRepeated = (gifts) => gifts.find((gift, index) => gifts.indexOf(gift) !== index) ?? -1;
+```
+
+## Explicación de mi solución
+
+1. Utilizo el método `find` para encontrar el primer elemento que cumpla la condición de que el índice del elemento en el array sea diferente al índice del elemento en el array si se utiliza el método `indexOf` para encontrar el índice del elemento en el array. Si no se encuentra ningún elemento que cumpla la condición, se devuelve `undefined`.
+
+2. Si el resultado de la expresión anterior es `undefined`, se devuelve `-1` utilizando el operador de encadenamiento opcional `??`.

2023/01-primer-regalo-repetido/index.js

@@ -0,0 +1,21 @@
+// complejidad: 1
+const findFirstRepeated = (gifts) => gifts.find((gift, index) => gifts.indexOf(gift) !== index) ?? -1;
+
+// complejidad: 3
+const findFirstRepeated2 = (gifts) => {
+  const repeated = gifts.filter((id, index) => gifts.indexOf(id) !== index);
+  return repeated.length > 0 ? repeated[0] : -1;
+};
+
+// complejidad: 3
+const findFirstRepeated3 = (gifts) => (
+  [...new Set(gifts)].length === gifts.length
+    ? -1
+    : gifts.find((id, index) => gifts.indexOf(id) !== index)
+);
+
+module.exports = {
+  findFirstRepeated,
+  findFirstRepeated2,
+  findFirstRepeated3,
+};

2023/01-primer-regalo-repetido/index.test.js

@@ -0,0 +1,58 @@
+const { findFirstRepeated, findFirstRepeated2, findFirstRepeated3 } = require('./index');
+
+describe('01 => Primer regalo repetido', () => {
+  const testCases = [
+    {
+      input: [2, 1, 3, 5, 3, 2],
+      output: 3,
+    },
+    {
+      input: [2, 2],
+      output: 2,
+    },
+    {
+      input: [2, 4, 3, 5, 1],
+      output: -1,
+    },
+    {
+      input: [1],
+      output: -1,
+    },
+    {
+      input: [],
+      output: -1,
+    },
+    {
+      input: [10, 20, 30],
+      output: -1,
+    },
+    {
+      input: [1, 2, 3, 4],
+      output: -1,
+    },
+    {
+      input: [5, 1, 2, 3, 2, 5, 1],
+      output: 2,
+    },
+    {
+      input: [12, 20, 30, 11, 20, 12],
+      output: 20,
+    },
+    {
+      input: [5, 1, 5, 1],
+      output: 5,
+    },
+  ];
+
+  it('should return a number type', () => {
+    expect(typeof findFirstRepeated([])).toBe('number');
+    expect(typeof findFirstRepeated2([])).toBe('number');
+    expect(typeof findFirstRepeated3([])).toBe('number');
+  });
+
+  it.each(testCases)('should return $output', ({ input, output }) => {
+    expect(findFirstRepeated(input)).toBe(output);
+    expect(findFirstRepeated2(input)).toBe(output);
+    expect(findFirstRepeated3(input)).toBe(output);
+  });
+});

LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2023 Marco Antonio Cruz Gabino [email protected]
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

README.md

@@ -6,6 +6,20 @@ This is a repository with my solutions to the [AdventJS](https://adventjs.dev/)
 
 Built by [@midudev](https://twitter.com/midudev)
 
+## 🎯 2023 Challenges
+
+<details>
+<summary show>Show / Hide</summary>
+
+|  #  | Challenge                                                                                   | Difficulty |                                            My Solution                                             |
+| :-: | ------------------------------------------------------------------------------------------- | :--------: | :------------------------------------------------------------------------------------------------: |
+| 01  | [¡Primer regalo repetido!](https://adventjs.dev/es/challenges/2023/1)                       |     🟢     |  [here](https://github.com/marcode24/adventjs-solutions/tree/main/2023/01-primer-regalo-repetido)  |
+
+Difficulties legend:
+🟢 Easy 🟡 Medium 🔴 Hard
+
+</details>
+
 ## 🎯 2022 Challenges
 
 <details hide>
@@ -68,6 +82,8 @@ npm run test
 npm run test:2021
 # or
 npm run test:2022
+# or
+npm run test:2023
 
 # Run specific test
 npm run test 'year'/'challenge'/index.test.js

package.json

@@ -1,12 +1,13 @@
 {
   "name": "adventjs-solutions",
   "version": "1.0.0",
-  "description": "",
+  "description": "Solutions for AdventJS 2022",
   "main": "index.js",
   "scripts": {
     "test": "jest",
     "test:2021": "jest --testPathPattern=2021",
     "test:2022": "jest --testPathPattern=2022",
+    "test:2023": "jest --testPathPattern=2023",
     "lint": "eslint **/*.js",
     "lint:fix": "eslint **/*.js --fix",
     "prepare": "husky install"
@@ -17,10 +18,13 @@
     "adventjs",
     "adventjs-2022",
     "adventjs-2022-solutions",
-    "adventjs-2022-solutions-javascript"
+    "adventjs-2022-solutions-javascript",
+    "adventjs-2023",
+    "adventjs-2023-solutions",
+    "adventjs-2023-solutions-javascript"
   ],
   "author": "marcode24",
-  "license": "ISC",
+  "license": "MIT",
   "devDependencies": {
     "eslint": "^8.30.0",
     "eslint-config-airbnb-base": "^15.0.0",