Merge js branch into main in a single commit

Author: IbatoLionDev

1-EASY/JavaScript/1-inversing-a-string/article.md

@@ -0,0 +1,58 @@
+# Challenge Description and Solution
+
+## English Version
+
+### Challenge Description
+Given a string, create a function that reverses it without using built-in reverse methods. This will help you practice loops and index handling.
+
+### Code Explanation
+The `reverseString` function iterates over the input string from the end to the beginning, concatenating characters to build the reversed string.
+
+### Relevant Code Snippet
+
+```javascript
+function reverseString(s) {
+    let reversedStr = "";
+    for (let i = s.length - 1; i >= 0; i--) {
+        reversedStr += s[i];
+    }
+    return reversedStr;
+}
+```
+
+### Example Usage
+
+```javascript
+const testString = "hello";
+console.log("Original string:", testString);
+console.log("Reversed string:", reverseString(testString));
+```
+
+---
+
+## Versión en Español
+
+### Descripción del Reto
+Dada una cadena, crea una función que la invierta sin usar métodos integrados de inversión. Esto te ayudará a practicar bucles y manejo de índices.
+
+### Explicación del Código
+La función `reverseString` itera sobre la cadena de entrada desde el final hasta el principio, concatenando caracteres para construir la cadena invertida.
+
+### Fragmento de Código Relevante
+
+```javascript
+function reverseString(s) {
+    let reversedStr = "";
+    for (let i = s.length - 1; i >= 0; i--) {
+        reversedStr += s[i];
+    }
+    return reversedStr;
+}
+```
+
+### Ejemplo de Uso
+
+```javascript
+const testString = "hello";
+console.log("Original string:", testString);
+console.log("Reversed string:", reverseString(testString));

1-EASY/JavaScript/1-inversing-a-string/proposed-solution/main.js

@@ -0,0 +1,15 @@
+// Challenge: Given a string, create a function that reverses it without using built-in reverse methods.
+// This will help you practice loops and index handling.
+
+function reverseString(s) {
+    let reversedStr = "";
+    for (let i = s.length - 1; i >= 0; i--) {
+        reversedStr += s[i];
+    }
+    return reversedStr;
+}
+
+// Example usage
+const testString = "hello";
+console.log("Original string:", testString);
+console.log("Reversed string:", reverseString(testString));

1-EASY/JavaScript/10-even-or-odd-detector/article.md

@@ -0,0 +1,54 @@
+# Challenge Description and Solution
+
+## English Version
+
+### Challenge Description
+Write a function that determines if a number is even or odd. Test with different types of inputs (positive numbers, negative numbers, and zero) to ensure robustness.
+
+### Code Explanation
+The `isEven` function uses the modulo operator `%` to determine if a number is even. If the remainder of the division of the number by 2 is zero, the number is even; otherwise, it is odd.
+
+### Relevant Code Snippet
+
+```javascript
+function isEven(n) {
+    return n % 2 === 0;
+}
+```
+
+### Example Usage
+
+```javascript
+const testValues = [0, 1, -1, 2, -2, 15, -15];
+testValues.forEach(val => {
+    const result = isEven(val) ? "even" : "odd";
+    console.log(`${val} is ${result}`);
+});
+```
+
+---
+
+## Versión en Español
+
+### Descripción del Reto
+Escribe una función que determine si un número es par o impar. Prueba con diferentes tipos de entradas (números positivos, negativos y cero) para asegurar la robustez.
+
+### Explicación del Código
+La función `isEven` utiliza el operador módulo `%` para determinar si un número es par. Si el residuo de la división entre el número y 2 es cero, el número es par; de lo contrario, es impar.
+
+### Fragmento de Código Relevante
+
+```javascript
+function isEven(n) {
+    return n % 2 === 0;
+}
+```
+
+### Ejemplo de Uso
+
+```javascript
+const testValues = [0, 1, -1, 2, -2, 15, -15];
+testValues.forEach(val => {
+    const result = isEven(val) ? "even" : "odd";
+    console.log(`${val} is ${result}`);
+});

1-EASY/JavaScript/10-even-or-odd-detector/proposed-solution/main.js

@@ -0,0 +1,12 @@
+// Challenge: Write a function that determines if a number is even or odd. Test with different types of inputs (positive numbers, negative numbers, and zero) to ensure robustness.
+
+function isEven(n) {
+    return n % 2 === 0;
+}
+
+// Example usage
+const testValues = [0, 1, -1, 2, -2, 15, -15];
+testValues.forEach(val => {
+    const result = isEven(val) ? "even" : "odd";
+    console.log(`${val} is ${result}`);
+});

1-EASY/JavaScript/2-check-prime-number/article.md

@@ -0,0 +1,84 @@
+# Challenge Description and Solution
+
+## English Version
+
+### Challenge Description
+Implement a function that determines if a number is prime. Pay attention to edge cases such as negative values and the number 1.
+
+### Code Explanation
+The `isPrime` function checks if a number `n` is prime. It first excludes numbers less than or equal to 1, which are not prime. Then, it considers 2 and 3 as prime numbers. Next, it eliminates multiples of 2 and 3. Finally, it uses a loop that checks divisors starting from 5, skipping multiples of 6, to optimize the search. If a divisor is found, it returns `false`; otherwise, it returns `true`.
+
+### Relevant Code Snippet
+
+```javascript
+function isPrime(n) {
+    if (n <= 1) {
+        return false;
+    }
+    if (n <= 3) {
+        return true;
+    }
+    if (n % 2 === 0 || n % 3 === 0) {
+        return false;
+    }
+    let i = 5;
+    while (i * i <= n) {
+        if (n % i === 0 || n % (i + 2) === 0) {
+            return false;
+        }
+        i += 6;
+    }
+    return true;
+}
+```
+
+### Example Usage
+
+```javascript
+const testNumbers = [-1, 0, 1, 2, 3, 4, 5, 29, 35];
+testNumbers.forEach(num => {
+    console.log(`${num} is prime: ${isPrime(num)}`);
+});
+```
+
+---
+
+## Versión en Español
+
+### Descripción del Reto
+Implementa una función que determine si un número es primo. Presta atención a casos especiales como valores negativos y el número 1.
+
+### Explicación del Código
+La función `isPrime` verifica si un número `n` es primo. Primero descarta números menores o iguales a 1, que no son primos. Luego, considera los números 2 y 3 como primos. Después, elimina múltiplos de 2 y 3. Finalmente, utiliza un bucle que verifica divisores desde 5 en adelante, saltando múltiplos de 6, para optimizar la búsqueda. Si encuentra un divisor, retorna `false`; si no, retorna `true`.
+
+### Fragmento de Código Relevante
+
+```javascript
+function isPrime(n) {
+    if (n <= 1) {
+        return false;
+    }
+    if (n <= 3) {
+        return true;
+    }
+    if (n % 2 === 0 || n % 3 === 0) {
+        return false;
+    }
+    let i = 5;
+    while (i * i <= n) {
+        if (n % i === 0 || n % (i + 2) === 0) {
+            return false;
+        }
+        i += 6;
+    }
+    return true;
+}
+```
+
+### Ejemplo de Uso
+
+```javascript
+const testNumbers = [-1, 0, 1, 2, 3, 4, 5, 29, 35];
+testNumbers.forEach(num => {
+    console.log(`${num} es primo: ${isPrime(num)}`);
+});

1-EASY/JavaScript/2-check-prime-number/proposed-solution/main.js

@@ -0,0 +1,28 @@
+// Challenge: Implement a function that determines if a number is prime.
+// Pay attention to edge cases such as negative values and the number 1.
+
+function isPrime(n) {
+    if (n <= 1) {
+        return false;
+    }
+    if (n <= 3) {
+        return true;
+    }
+    if (n % 2 === 0 || n % 3 === 0) {
+        return false;
+    }
+    let i = 5;
+    while (i * i <= n) {
+        if (n % i === 0 || n % (i + 2) === 0) {
+            return false;
+        }
+        i += 6;
+    }
+    return true;
+}
+
+// Example usage
+const testNumbers = [-1, 0, 1, 2, 3, 4, 5, 29, 35];
+testNumbers.forEach(num => {
+    console.log(`${num} is prime: ${isPrime(num)}`);
+});

1-EASY/JavaScript/3-fibonacci-sequence-generator/article.md

@@ -0,0 +1,92 @@
+# Challenge Description and Solution
+
+## English Version
+
+### Challenge Description
+Create a generator that returns the Fibonacci sequence up to n terms. You can explore iterative and recursive approaches to solve the problem.
+
+### Code Explanation
+The code presents two generator functions for the Fibonacci sequence:
+
+- `fibonacciIterative(n)`: Uses a `for` loop to generate the first n terms of the Fibonacci sequence iteratively. It initializes two variables `a` and `b` with 0 and 1 respectively, and in each iteration yields the current value of `a` and updates `a` and `b`.
+
+- `fibonacciRecursive(n, a=0, b=1)`: Generates the Fibonacci sequence recursively. If `n` is 0, it ends the recursion. Otherwise, it yields the current value `a` and recursively calls itself with `n-1`, `b`, and `a+b`.
+
+### Relevant Code Snippet
+
+```javascript
+function* fibonacciIterative(n) {
+    let a = 0, b = 1;
+    for (let i = 0; i < n; i++) {
+        yield a;
+        [a, b] = [b, a + b];
+    }
+}
+
+function* fibonacciRecursive(n, a = 0, b = 1) {
+    if (n === 0) return;
+    yield a;
+    yield* fibonacciRecursive(n - 1, b, a + b);
+}
+```
+
+### Example Usage
+
+```javascript
+const n = 10;
+console.log("Iterative Fibonacci sequence:");
+for (const num of fibonacciIterative(n)) {
+    process.stdout.write(num + " ");
+}
+console.log("\nRecursive Fibonacci sequence:");
+for (const num of fibonacciRecursive(n)) {
+    process.stdout.write(num + " ");
+}
+console.log();
+```
+
+---
+
+## Versión en Español
+
+### Descripción del Reto
+Crea un generador que devuelva la secuencia de Fibonacci hasta n términos. Puedes explorar enfoques iterativos y recursivos para resolver el problema.
+
+### Explicación del Código
+El código presenta dos funciones generadoras para la secuencia de Fibonacci:
+
+- `fibonacciIterative(n)`: Utiliza un bucle `for` para generar los primeros n términos de la secuencia de Fibonacci de manera iterativa. Inicializa dos variables `a` y `b` con 0 y 1 respectivamente, y en cada iteración produce el valor actual de `a` y actualiza `a` y `b`.
+
+- `fibonacciRecursive(n, a=0, b=1)`: Genera la secuencia de Fibonacci de forma recursiva. Si `n` es 0, termina la recursión. De lo contrario, produce el valor actual `a` y llama recursivamente a sí misma con `n-1`, `b` y `a+b`.
+
+### Fragmento de Código Relevante
+
+```javascript
+function* fibonacciIterative(n) {
+    let a = 0, b = 1;
+    for (let i = 0; i < n; i++) {
+        yield a;
+        [a, b] = [b, a + b];
+    }
+}
+
+function* fibonacciRecursive(n, a = 0, b = 1) {
+    if (n === 0) return;
+    yield a;
+    yield* fibonacciRecursive(n - 1, b, a + b);
+}
+```
+
+### Ejemplo de Uso
+
+```javascript
+const n = 10;
+console.log("Secuencia de Fibonacci iterativa:");
+for (const num of fibonacciIterative(n)) {
+    process.stdout.write(num + " ");
+}
+console.log("\nSecuencia de Fibonacci recursiva:");
+for (const num of fibonacciRecursive(n)) {
+    process.stdout.write(num + " ");
+}
+console.log();

1-EASY/JavaScript/3-fibonacci-sequence-generator/proposed-solution/main.js

@@ -0,0 +1,30 @@
+// Challenge: Create a generator that returns the Fibonacci sequence up to n terms.
+// You can explore iterative and recursive approaches to solve the problem.
+
+// Iterative generator function
+function* fibonacciIterative(n) {
+    let a = 0, b = 1;
+    for (let i = 0; i < n; i++) {
+        yield a;
+        [a, b] = [b, a + b];
+    }
+}
+
+// Recursive generator function
+function* fibonacciRecursive(n, a = 0, b = 1) {
+    if (n === 0) return;
+    yield a;
+    yield* fibonacciRecursive(n - 1, b, a + b);
+}
+
+// Example usage
+const n = 10;
+console.log("Iterative Fibonacci sequence:");
+for (const num of fibonacciIterative(n)) {
+    process.stdout.write(num + " ");
+}
+console.log("\nRecursive Fibonacci sequence:");
+for (const num of fibonacciRecursive(n)) {
+    process.stdout.write(num + " ");
+}
+console.log();