diff --git "a/train.csv" "b/train.csv" new file mode 100644--- /dev/null +++ "b/train.csv" @@ -0,0 +1,38997 @@ +id,question,solution,difficulty,topic +1,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +10,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +11,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +12,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +13,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +14,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +15,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +16,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +17,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +18,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +19,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +20,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +21,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +22,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +23,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +24,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +25,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +26,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +27,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +28,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +29,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +30,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +31,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +32,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +33,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +34,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +35,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +36,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +37,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +38,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +39,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +40,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +41,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +42,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +43,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +44,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +45,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +46,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +47,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +48,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +49,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +50,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +51,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +52,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +53,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +54,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +55,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +56,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +57,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +58,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +59,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +60,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +61,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +62,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +63,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +64,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +65,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +66,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +67,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +68,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +69,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +70,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +71,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +72,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +73,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +74,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +75,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +76,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +77,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +78,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +79,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +80,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +81,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +82,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +83,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +84,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +85,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +86,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +87,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +88,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +89,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +90,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +91,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +92,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +93,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +94,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +95,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +96,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +97,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +98,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +99,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +100,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +101,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +102,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +103,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +104,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +105,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +106,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +107,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +108,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +109,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +110,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +111,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +112,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +113,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +114,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +115,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +116,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +117,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +118,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +119,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +120,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +121,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +122,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +123,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +124,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +125,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +126,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +127,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +128,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +129,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +130,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +131,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +132,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +133,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +134,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +135,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +136,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +137,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +138,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +139,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +140,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +141,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +142,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +143,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +144,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +145,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +146,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +147,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +148,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +149,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +150,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +151,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +152,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +153,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +154,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +155,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +156,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +157,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +158,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +159,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +160,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +161,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +162,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +163,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +164,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +165,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +166,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +167,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +168,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +169,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +170,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +171,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +172,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +173,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +174,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +175,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +176,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +177,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +178,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +179,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +180,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +181,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +182,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +183,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +184,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +185,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +186,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +187,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +188,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +189,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +190,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +191,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +192,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +193,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +194,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +195,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +196,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +197,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +198,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +199,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +200,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +201,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +202,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +203,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +204,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +205,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +206,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +207,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +208,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +209,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +210,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +211,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +212,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +213,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +214,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +215,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +216,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +217,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +218,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +219,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +220,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +221,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +222,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +223,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +224,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +225,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +226,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +227,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +228,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +229,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +230,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +231,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +232,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +233,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +234,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +235,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +236,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +237,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +238,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +239,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +240,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +241,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +242,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +243,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +244,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +245,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +246,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +247,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +248,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +249,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +250,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +251,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +252,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +253,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +254,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +255,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +256,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +257,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +258,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +259,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +260,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +261,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +262,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +263,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +264,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +265,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +266,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +267,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +268,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +269,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +270,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +271,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +272,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +273,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +274,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +275,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +276,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +277,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +278,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +279,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +280,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +281,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +282,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +283,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +284,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +285,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +286,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +287,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +288,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +289,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +290,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +291,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +292,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +293,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +294,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +295,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +296,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +297,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +298,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +299,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +300,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +301,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +302,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +303,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +304,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +305,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +306,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +307,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +308,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +309,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +310,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +311,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +312,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +313,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +314,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +315,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +316,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +317,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +318,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +319,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +320,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +321,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +322,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +323,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +324,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +325,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +326,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +327,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +328,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +329,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +330,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +331,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +332,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +333,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +334,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +335,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +336,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +337,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +338,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +339,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +340,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +341,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +342,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +343,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +344,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +345,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +346,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +347,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +348,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +349,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +350,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +351,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +352,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +353,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +354,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +355,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +356,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +357,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +358,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +359,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +360,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +361,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +362,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +363,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +364,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +365,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +366,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +367,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +368,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +369,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +370,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +371,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +372,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +373,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +374,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +375,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +376,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +377,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +378,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +379,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +380,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +381,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +382,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +383,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +384,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +385,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +386,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +387,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +388,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +389,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +390,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +391,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +392,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +393,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +394,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +395,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +396,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +397,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +398,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +399,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +400,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +401,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +402,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +403,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +404,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +405,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +406,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +407,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +408,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +409,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +410,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +411,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +412,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +413,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +414,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +415,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +416,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +417,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +418,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +419,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +420,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +421,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +422,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +423,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +424,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +425,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +426,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +427,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +428,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +429,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +430,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +431,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +432,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +433,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +434,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +435,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +436,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +437,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +438,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +439,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +440,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +441,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +442,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +443,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +444,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +445,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +446,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +447,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +448,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +449,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +450,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +451,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +452,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +453,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +454,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +455,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +456,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +457,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +458,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +459,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +460,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +461,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +462,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +463,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +464,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +465,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +466,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +467,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +468,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +469,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +470,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +471,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +472,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +473,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +474,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +475,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +476,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +477,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +478,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +479,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +480,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +481,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +482,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +483,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +484,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +485,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +486,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +487,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +488,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +489,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +490,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +491,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +492,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +493,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +494,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +495,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +496,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +497,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +498,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +499,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +500,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +501,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +502,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +503,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +504,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +505,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +506,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +507,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +508,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +509,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +510,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +511,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +512,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +513,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +514,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +515,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +516,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +517,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +518,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +519,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +520,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +521,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +522,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +523,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +524,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +525,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +526,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +527,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +528,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +529,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +530,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +531,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +532,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +533,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +534,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +535,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +536,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +537,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +538,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +539,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +540,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +541,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +542,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +543,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +544,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +545,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +546,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +547,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +548,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +549,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +550,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +551,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +552,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +553,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +554,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +555,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +556,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +557,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +558,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +559,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +560,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +561,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +562,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +563,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +564,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +565,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +566,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +567,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +568,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +569,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +570,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +571,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +572,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +573,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +574,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +575,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +576,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +577,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +578,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +579,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +580,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +581,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +582,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +583,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +584,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +585,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +586,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +587,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +588,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +589,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +590,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +591,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +592,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +593,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +594,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +595,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +596,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +597,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +598,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +599,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +600,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +601,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +602,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +603,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +604,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +605,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +606,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +607,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +608,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +609,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +610,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +611,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +612,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +613,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +614,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +615,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +616,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +617,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +618,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +619,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +620,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +621,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +622,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +623,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +624,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +625,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +626,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +627,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +628,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +629,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +630,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +631,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +632,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +633,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +634,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +635,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +636,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +637,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +638,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +639,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +640,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +641,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +642,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +643,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +644,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +645,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +646,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +647,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +648,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +649,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +650,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +651,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +652,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +653,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +654,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +655,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +656,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +657,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +658,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +659,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +660,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +661,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +662,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +663,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +664,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +665,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +666,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +667,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +668,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +669,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +670,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +671,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +672,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +673,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +674,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +675,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +676,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +677,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +678,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +679,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +680,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +681,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +682,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +683,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +684,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +685,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +686,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +687,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +688,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +689,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +690,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +691,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +692,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +693,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +694,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +695,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +696,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +697,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +698,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +699,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +700,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +701,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +702,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +703,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +704,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +705,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +706,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +707,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +708,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +709,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +710,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +711,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +712,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +713,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +714,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +715,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +716,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +717,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +718,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +719,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +720,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +721,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +722,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +723,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +724,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +725,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +726,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +727,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +728,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +729,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +730,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +731,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +732,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +733,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +734,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +735,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +736,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +737,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +738,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +739,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +740,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +741,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +742,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +743,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +744,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +745,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +746,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +747,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +748,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +749,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +750,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +751,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +752,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +753,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +754,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +755,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +756,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +757,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +758,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +759,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +760,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +761,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +762,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +763,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +764,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +765,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +766,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +767,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +768,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +769,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +770,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +771,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +772,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +773,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +774,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +775,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +776,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +777,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +778,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +779,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +780,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +781,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +782,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +783,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +784,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +785,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +786,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +787,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +788,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +789,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +790,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +791,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +792,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +793,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +794,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +795,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +796,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +797,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +798,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +799,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +800,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +801,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +802,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +803,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +804,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +805,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +806,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +807,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +808,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +809,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +810,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +811,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +812,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +813,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +814,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +815,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +816,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +817,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +818,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +819,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +820,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +821,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +822,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +823,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +824,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +825,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +826,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +827,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +828,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +829,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +830,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +831,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +832,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +833,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +834,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +835,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +836,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +837,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +838,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +839,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +840,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +841,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +842,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +843,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +844,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +845,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +846,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +847,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +848,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +849,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +850,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +851,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +852,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +853,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +854,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +855,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +856,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +857,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +858,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +859,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +860,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +861,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +862,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +863,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +864,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +865,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +866,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +867,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +868,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +869,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +870,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +871,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +872,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +873,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +874,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +875,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +876,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +877,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +878,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +879,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +880,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +881,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +882,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +883,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +884,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +885,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +886,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +887,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +888,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +889,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +890,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +891,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +892,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +893,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +894,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +895,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +896,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +897,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +898,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +899,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +900,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +901,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +902,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +903,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +904,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +905,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +906,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +907,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +908,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +909,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +910,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +911,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +912,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +913,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +914,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +915,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +916,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +917,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +918,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +919,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +920,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +921,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +922,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +923,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +924,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +925,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +926,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +927,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +928,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +929,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +930,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +931,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +932,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +933,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +934,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +935,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +936,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +937,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +938,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +939,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +940,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +941,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +942,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +943,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +944,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +945,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +946,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +947,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +948,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +949,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +950,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +951,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +952,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +953,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +954,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +955,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +956,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +957,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +958,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +959,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +960,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +961,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +962,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +963,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +964,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +965,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +966,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +967,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +968,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +969,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +970,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +971,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +972,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +973,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +974,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +975,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +976,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +977,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +978,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +979,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +980,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +981,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +982,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +983,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +984,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +985,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +986,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +987,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +988,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +989,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +990,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +991,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +992,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +993,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +994,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +995,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +996,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +997,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +998,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +999,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1000,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1001,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1002,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1003,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1004,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1005,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1006,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1007,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1008,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1009,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1010,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1011,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1012,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1013,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1014,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1015,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1016,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1017,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1018,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +1019,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1020,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1021,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1022,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1023,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1024,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1025,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1026,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1027,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1028,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1029,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1030,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1031,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1032,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1033,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1034,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +1035,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1036,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1037,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1038,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1039,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1040,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1041,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1042,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1043,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1044,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1045,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1046,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1047,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1048,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1049,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1050,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1051,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1052,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1053,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1054,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1055,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1056,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1057,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1058,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +1059,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1060,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1061,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1062,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1063,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1064,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1065,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1066,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1067,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1068,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1069,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1070,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1071,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1072,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1073,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1074,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1075,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1076,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1077,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1078,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1079,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1080,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1081,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1082,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1083,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1084,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1085,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1086,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1087,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +1088,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1089,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +1090,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1091,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1092,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1093,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1094,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1095,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1096,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1097,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1098,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1099,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1100,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1101,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1102,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1103,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1104,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1105,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1106,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1107,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1108,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1109,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1110,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1111,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +1112,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1113,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1114,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1115,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1116,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1117,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +1118,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +1119,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1120,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1121,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +1122,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1123,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1124,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1125,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1126,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +1127,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1128,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1129,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1130,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1131,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +1132,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1133,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1134,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1135,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1136,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1137,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1138,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1139,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1140,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1141,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1142,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1143,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1144,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1145,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1146,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1147,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1148,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1149,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1150,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +1151,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1152,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1153,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +1154,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1155,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1156,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1157,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1158,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1159,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1160,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1161,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1162,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1163,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1164,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +1165,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1166,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1167,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1168,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1169,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1170,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1171,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1172,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1173,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1174,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1175,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1176,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1177,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1178,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1179,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1180,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1181,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1182,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1183,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1184,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1185,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1186,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1187,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1188,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1189,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1190,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1191,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1192,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1193,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1194,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1195,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1196,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1197,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1198,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1199,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1200,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1201,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1202,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1203,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1204,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1205,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1206,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1207,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1208,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1209,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1210,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1211,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1212,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1213,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1214,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1215,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1216,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1217,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1218,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +1219,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1220,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1221,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1222,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1223,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1224,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1225,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1226,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1227,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1228,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1229,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1230,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1231,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1232,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1233,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1234,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1235,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1236,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1237,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1238,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1239,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1240,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1241,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1242,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1243,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1244,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1245,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1246,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +1247,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1248,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1249,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1250,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +1251,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1252,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1253,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1254,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +1255,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1256,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1257,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1258,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1259,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1260,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1261,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1262,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1263,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1264,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1265,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1266,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1267,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1268,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1269,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1270,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1271,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1272,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1273,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1274,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1275,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1276,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1277,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +1278,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1279,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1280,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1281,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1282,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1283,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1284,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1285,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +1286,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1287,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1288,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1289,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +1290,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1291,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1292,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1293,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1294,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1295,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1296,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1297,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1298,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1299,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1300,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1301,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1302,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1303,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1304,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1305,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1306,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1307,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1308,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1309,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1310,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1311,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1312,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1313,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1314,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1315,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1316,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1317,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1318,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1319,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +1320,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1321,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1322,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1323,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +1324,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1325,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1326,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1327,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1328,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1329,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1330,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1331,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1332,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1333,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1334,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1335,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +1336,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1337,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1338,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1339,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1340,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1341,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1342,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1343,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1344,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1345,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1346,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1347,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1348,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1349,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +1350,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1351,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1352,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1353,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1354,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1355,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1356,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1357,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1358,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1359,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1360,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +1361,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1362,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1363,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1364,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1365,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1366,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1367,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1368,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1369,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1370,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1371,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1372,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1373,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1374,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1375,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1376,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1377,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1378,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1379,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1380,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1381,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1382,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1383,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1384,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1385,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1386,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1387,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1388,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1389,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1390,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1391,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1392,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +1393,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1394,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1395,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1396,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1397,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +1398,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1399,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1400,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1401,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1402,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1403,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1404,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1405,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1406,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1407,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1408,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1409,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1410,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1411,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1412,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1413,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1414,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1415,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1416,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1417,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1418,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1419,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1420,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1421,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1422,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1423,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1424,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1425,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1426,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1427,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1428,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1429,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1430,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1431,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1432,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1433,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1434,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1435,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1436,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1437,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1438,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1439,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1440,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1441,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1442,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1443,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1444,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1445,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1446,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1447,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1448,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1449,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1450,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +1451,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1452,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1453,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1454,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1455,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +1456,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1457,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1458,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1459,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1460,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1461,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1462,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1463,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1464,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1465,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1466,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1467,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1468,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1469,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1470,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1471,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1472,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1473,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1474,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1475,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1476,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1477,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1478,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1479,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1480,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1481,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1482,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1483,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1484,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1485,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1486,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1487,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1488,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1489,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1490,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1491,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +1492,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1493,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1494,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1495,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1496,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1497,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +1498,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1499,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1500,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1501,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1502,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1503,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1504,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1505,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +1506,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1507,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1508,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1509,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1510,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1511,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1512,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1513,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1514,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +1515,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1516,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1517,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1518,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1519,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +1520,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1521,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1522,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1523,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1524,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1525,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1526,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1527,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1528,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1529,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1530,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1531,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +1532,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1533,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1534,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +1535,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1536,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1537,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1538,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1539,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1540,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1541,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1542,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1543,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1544,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1545,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1546,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1547,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1548,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1549,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1550,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1551,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1552,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1553,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1554,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1555,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1556,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1557,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1558,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +1559,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +1560,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1561,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +1562,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1563,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1564,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1565,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +1566,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1567,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1568,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1569,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1570,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1571,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +1572,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1573,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1574,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1575,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1576,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1577,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1578,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1579,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1580,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1581,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1582,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1583,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1584,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1585,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +1586,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1587,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1588,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1589,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1590,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1591,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1592,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +1593,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1594,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1595,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1596,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1597,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1598,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1599,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1600,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1601,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1602,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1603,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1604,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1605,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1606,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1607,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1608,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1609,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1610,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1611,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1612,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1613,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1614,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1615,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1616,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1617,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1618,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1619,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1620,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1621,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1622,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1623,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1624,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1625,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1626,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1627,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1628,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1629,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1630,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1631,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1632,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1633,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1634,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +1635,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1636,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1637,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1638,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1639,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1640,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1641,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1642,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1643,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1644,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1645,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1646,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1647,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1648,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1649,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1650,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1651,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1652,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1653,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1654,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1655,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1656,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1657,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1658,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1659,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1660,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1661,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1662,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1663,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1664,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1665,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1666,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1667,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1668,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1669,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1670,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1671,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1672,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1673,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1674,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1675,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1676,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +1677,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1678,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1679,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1680,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1681,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1682,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1683,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1684,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1685,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1686,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1687,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1688,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1689,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1690,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1691,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1692,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1693,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1694,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1695,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +1696,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +1697,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1698,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1699,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1700,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1701,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1702,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1703,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1704,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1705,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1706,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1707,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1708,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1709,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1710,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1711,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1712,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1713,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1714,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1715,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +1716,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +1717,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1718,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1719,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1720,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1721,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1722,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1723,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1724,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1725,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1726,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1727,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1728,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +1729,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1730,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1731,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1732,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1733,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1734,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1735,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1736,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1737,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1738,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1739,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1740,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1741,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1742,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1743,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1744,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1745,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1746,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1747,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1748,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1749,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1750,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1751,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1752,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1753,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1754,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1755,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1756,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1757,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1758,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1759,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1760,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1761,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1762,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1763,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +1764,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1765,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +1766,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1767,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1768,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1769,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1770,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +1771,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1772,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +1773,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1774,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1775,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1776,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1777,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1778,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1779,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1780,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1781,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1782,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1783,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1784,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1785,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1786,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1787,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1788,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1789,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1790,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +1791,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1792,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1793,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1794,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1795,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +1796,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1797,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +1798,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1799,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1800,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1801,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1802,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1803,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +1804,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1805,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1806,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1807,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1808,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1809,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1810,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1811,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1812,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1813,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1814,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1815,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1816,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1817,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1818,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +1819,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1820,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1821,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1822,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1823,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1824,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1825,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1826,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1827,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1828,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1829,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1830,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1831,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1832,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1833,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1834,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1835,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1836,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1837,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1838,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1839,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1840,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1841,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1842,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1843,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1844,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1845,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1846,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1847,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1848,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1849,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1850,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1851,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1852,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +1853,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1854,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1855,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1856,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1857,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1858,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1859,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1860,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1861,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1862,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1863,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1864,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1865,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +1866,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1867,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1868,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1869,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1870,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1871,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1872,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1873,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1874,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1875,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1876,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1877,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1878,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1879,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1880,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1881,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1882,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1883,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1884,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1885,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1886,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1887,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1888,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +1889,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1890,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1891,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1892,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1893,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1894,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1895,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1896,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1897,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1898,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1899,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1900,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1901,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1902,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1903,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1904,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1905,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1906,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1907,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +1908,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1909,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1910,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1911,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1912,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1913,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1914,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1915,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1916,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1917,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1918,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1919,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +1920,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1921,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1922,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1923,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1924,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1925,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1926,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +1927,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +1928,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1929,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1930,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1931,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +1932,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1933,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1934,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1935,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1936,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1937,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1938,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1939,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1940,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +1941,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1942,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1943,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1944,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1945,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +1946,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1947,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +1948,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1949,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1950,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1951,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +1952,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1953,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1954,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +1955,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1956,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1957,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1958,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1959,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1960,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1961,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +1962,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +1963,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1964,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1965,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +1966,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +1967,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1968,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1969,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1970,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +1971,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1972,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1973,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1974,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +1975,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +1976,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +1977,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1978,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +1979,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +1980,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +1981,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1982,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1983,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +1984,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +1985,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1986,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +1987,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +1988,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1989,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1990,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1991,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +1992,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +1993,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1994,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +1995,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +1996,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +1997,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +1998,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +1999,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2000,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2001,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2002,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2003,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2004,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2005,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2006,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2007,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2008,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2009,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2010,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2011,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2012,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2013,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +2014,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2015,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2016,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2017,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2018,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2019,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2020,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2021,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2022,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2023,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +2024,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +2025,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2026,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2027,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2028,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2029,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2030,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2031,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2032,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2033,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2034,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2035,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2036,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2037,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2038,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +2039,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2040,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2041,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2042,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2043,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2044,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2045,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2046,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2047,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2048,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2049,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2050,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2051,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2052,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2053,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2054,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2055,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2056,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2057,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +2058,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2059,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2060,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2061,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2062,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +2063,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2064,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2065,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2066,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2067,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2068,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2069,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2070,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2071,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2072,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +2073,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2074,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2075,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2076,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2077,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2078,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2079,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2080,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2081,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2082,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2083,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2084,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2085,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +2086,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2087,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2088,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2089,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2090,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2091,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2092,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2093,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +2094,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2095,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2096,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2097,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2098,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2099,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2100,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2101,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +2102,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2103,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2104,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2105,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2106,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2107,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2108,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2109,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2110,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2111,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2112,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2113,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2114,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2115,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2116,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2117,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2118,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2119,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2120,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +2121,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2122,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +2123,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2124,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2125,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2126,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2127,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2128,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2129,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2130,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2131,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2132,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2133,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2134,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2135,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2136,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2137,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2138,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +2139,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2140,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2141,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2142,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2143,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2144,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2145,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2146,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +2147,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2148,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2149,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2150,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2151,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2152,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2153,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2154,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2155,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2156,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2157,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2158,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2159,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2160,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2161,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2162,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2163,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2164,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2165,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2166,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2167,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2168,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2169,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2170,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2171,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2172,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2173,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2174,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2175,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2176,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2177,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2178,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2179,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2180,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2181,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2182,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2183,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2184,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2185,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +2186,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2187,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2188,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2189,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2190,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +2191,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2192,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2193,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2194,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2195,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2196,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2197,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2198,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2199,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2200,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2201,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2202,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2203,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2204,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2205,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2206,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2207,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2208,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2209,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2210,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2211,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2212,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2213,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2214,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2215,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2216,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2217,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2218,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2219,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2220,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2221,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2222,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2223,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2224,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2225,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2226,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2227,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2228,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2229,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2230,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2231,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2232,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2233,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2234,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2235,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2236,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2237,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2238,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2239,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2240,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2241,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +2242,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2243,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2244,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2245,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2246,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2247,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2248,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +2249,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2250,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2251,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2252,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2253,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2254,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2255,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2256,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2257,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2258,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2259,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2260,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2261,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2262,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2263,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2264,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2265,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2266,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2267,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2268,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2269,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2270,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2271,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2272,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2273,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2274,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2275,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2276,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2277,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2278,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2279,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2280,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2281,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2282,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2283,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2284,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2285,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2286,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2287,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +2288,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2289,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2290,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +2291,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2292,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2293,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2294,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2295,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2296,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2297,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +2298,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +2299,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2300,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2301,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2302,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +2303,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2304,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2305,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2306,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2307,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2308,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2309,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2310,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2311,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2312,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2313,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2314,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2315,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2316,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2317,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2318,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2319,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2320,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2321,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2322,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2323,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2324,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2325,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2326,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2327,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +2328,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2329,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2330,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2331,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2332,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2333,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +2334,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2335,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2336,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2337,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2338,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2339,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2340,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2341,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2342,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2343,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2344,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2345,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2346,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2347,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2348,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2349,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2350,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2351,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2352,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2353,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2354,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2355,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2356,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2357,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2358,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2359,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2360,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2361,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2362,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2363,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2364,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2365,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2366,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2367,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2368,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2369,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2370,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2371,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2372,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2373,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2374,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2375,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2376,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2377,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2378,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2379,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2380,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2381,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2382,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2383,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2384,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2385,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2386,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2387,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2388,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2389,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2390,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2391,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2392,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2393,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2394,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2395,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2396,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2397,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2398,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2399,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2400,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2401,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2402,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2403,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2404,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2405,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +2406,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2407,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2408,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2409,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2410,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2411,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2412,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2413,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2414,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2415,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2416,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2417,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2418,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2419,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2420,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2421,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2422,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2423,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2424,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2425,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2426,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2427,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2428,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2429,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2430,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2431,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2432,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2433,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +2434,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2435,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2436,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +2437,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2438,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2439,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2440,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2441,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2442,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2443,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2444,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2445,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2446,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2447,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2448,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2449,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2450,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2451,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2452,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2453,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2454,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2455,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2456,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2457,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2458,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2459,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2460,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2461,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2462,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2463,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2464,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2465,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2466,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2467,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2468,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2469,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2470,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2471,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2472,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2473,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2474,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2475,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2476,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2477,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +2478,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2479,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2480,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2481,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2482,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2483,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2484,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2485,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2486,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2487,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2488,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2489,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2490,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2491,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2492,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2493,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2494,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +2495,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2496,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2497,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +2498,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2499,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2500,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2501,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2502,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2503,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2504,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2505,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2506,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2507,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2508,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2509,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2510,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2511,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2512,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2513,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2514,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2515,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2516,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2517,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +2518,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2519,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2520,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2521,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2522,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2523,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2524,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2525,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2526,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2527,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2528,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2529,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2530,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2531,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +2532,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2533,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2534,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2535,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2536,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2537,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2538,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2539,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2540,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2541,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2542,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2543,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2544,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2545,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2546,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2547,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2548,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2549,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2550,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2551,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2552,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2553,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2554,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2555,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2556,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2557,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2558,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2559,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2560,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +2561,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2562,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2563,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2564,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2565,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2566,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2567,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2568,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2569,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2570,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2571,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2572,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2573,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2574,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2575,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2576,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2577,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2578,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2579,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2580,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2581,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +2582,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +2583,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2584,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2585,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2586,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2587,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2588,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2589,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2590,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2591,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2592,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2593,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2594,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2595,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2596,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2597,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2598,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2599,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +2600,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2601,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2602,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +2603,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2604,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2605,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2606,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2607,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2608,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2609,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2610,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2611,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2612,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2613,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2614,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2615,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2616,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2617,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2618,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2619,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2620,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2621,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2622,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2623,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2624,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2625,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2626,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2627,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2628,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2629,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2630,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2631,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2632,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2633,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2634,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2635,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2636,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2637,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2638,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2639,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2640,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2641,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2642,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2643,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2644,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2645,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2646,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2647,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2648,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2649,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2650,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2651,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +2652,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2653,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2654,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2655,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2656,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2657,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2658,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2659,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2660,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2661,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2662,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2663,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2664,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2665,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2666,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2667,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2668,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2669,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2670,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2671,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2672,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +2673,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2674,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2675,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2676,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2677,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2678,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2679,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2680,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2681,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +2682,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +2683,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2684,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +2685,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2686,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2687,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2688,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2689,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2690,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2691,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2692,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2693,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2694,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2695,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2696,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2697,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2698,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2699,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2700,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2701,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2702,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2703,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2704,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2705,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2706,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +2707,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +2708,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2709,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2710,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2711,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2712,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2713,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2714,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2715,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2716,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2717,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2718,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2719,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2720,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2721,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2722,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2723,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2724,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2725,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2726,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2727,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2728,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2729,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2730,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2731,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2732,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2733,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2734,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2735,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2736,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2737,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2738,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2739,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2740,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2741,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2742,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2743,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2744,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2745,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2746,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2747,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2748,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2749,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2750,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2751,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +2752,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2753,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +2754,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2755,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2756,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2757,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2758,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +2759,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2760,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2761,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2762,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +2763,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2764,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2765,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2766,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2767,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2768,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2769,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2770,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2771,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2772,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2773,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2774,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2775,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2776,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2777,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2778,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2779,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2780,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2781,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2782,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2783,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2784,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2785,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2786,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2787,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2788,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2789,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2790,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2791,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2792,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2793,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2794,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2795,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2796,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2797,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2798,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2799,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2800,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2801,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2802,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2803,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2804,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2805,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +2806,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2807,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2808,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2809,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2810,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2811,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2812,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2813,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2814,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2815,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +2816,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2817,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2818,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2819,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2820,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2821,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2822,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2823,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2824,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2825,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2826,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2827,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2828,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2829,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2830,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2831,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2832,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2833,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2834,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2835,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2836,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2837,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2838,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2839,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2840,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2841,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +2842,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2843,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2844,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +2845,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2846,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2847,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2848,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +2849,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2850,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +2851,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2852,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2853,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2854,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +2855,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2856,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2857,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2858,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +2859,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2860,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2861,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2862,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2863,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2864,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2865,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2866,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2867,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2868,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2869,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2870,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2871,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2872,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2873,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2874,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2875,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2876,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2877,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2878,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2879,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2880,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2881,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2882,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2883,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2884,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2885,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2886,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2887,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2888,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2889,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2890,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2891,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2892,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2893,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +2894,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2895,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2896,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2897,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2898,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2899,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2900,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2901,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2902,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2903,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2904,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2905,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2906,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +2907,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2908,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2909,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2910,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +2911,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2912,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2913,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2914,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2915,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2916,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2917,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2918,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2919,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2920,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2921,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2922,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2923,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2924,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2925,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2926,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2927,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2928,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2929,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2930,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2931,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2932,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +2933,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2934,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2935,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +2936,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +2937,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2938,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +2939,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2940,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2941,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2942,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2943,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +2944,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2945,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2946,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2947,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2948,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +2949,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2950,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2951,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2952,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2953,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2954,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2955,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +2956,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2957,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2958,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +2959,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2960,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +2961,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2962,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +2963,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2964,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2965,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2966,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2967,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2968,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2969,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2970,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2971,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +2972,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +2973,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2974,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +2975,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2976,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2977,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +2978,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +2979,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2980,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +2981,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2982,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +2983,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2984,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +2985,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2986,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +2987,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2988,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2989,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +2990,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2991,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +2992,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +2993,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2994,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +2995,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +2996,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +2997,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +2998,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +2999,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3000,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3001,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3002,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3003,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3004,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3005,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3006,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3007,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3008,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3009,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3010,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +3011,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3012,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3013,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3014,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3015,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +3016,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3017,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3018,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3019,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3020,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3021,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3022,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3023,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +3024,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3025,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3026,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3027,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3028,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3029,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3030,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3031,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3032,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3033,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3034,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3035,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3036,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3037,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3038,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +3039,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3040,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3041,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3042,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3043,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +3044,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3045,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3046,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3047,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3048,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3049,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3050,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3051,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3052,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3053,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3054,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3055,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3056,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3057,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3058,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3059,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3060,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3061,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +3062,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3063,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3064,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3065,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3066,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3067,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3068,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3069,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3070,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3071,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3072,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3073,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3074,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3075,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3076,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3077,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3078,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3079,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3080,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3081,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3082,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3083,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3084,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3085,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3086,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3087,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3088,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3089,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3090,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3091,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3092,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3093,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3094,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3095,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3096,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3097,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3098,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3099,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3100,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3101,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3102,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3103,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3104,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3105,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3106,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +3107,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3108,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3109,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3110,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3111,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3112,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3113,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +3114,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +3115,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3116,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3117,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3118,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3119,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +3120,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3121,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3122,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3123,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3124,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3125,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3126,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3127,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3128,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3129,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3130,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3131,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3132,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3133,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3134,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3135,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3136,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3137,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3138,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3139,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3140,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3141,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3142,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3143,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3144,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3145,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3146,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3147,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3148,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3149,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3150,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3151,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3152,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +3153,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3154,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3155,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3156,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3157,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3158,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3159,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3160,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3161,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3162,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3163,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3164,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3165,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3166,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3167,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3168,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3169,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +3170,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3171,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3172,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3173,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3174,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3175,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3176,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3177,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3178,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3179,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3180,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3181,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3182,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3183,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3184,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3185,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +3186,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3187,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3188,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3189,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3190,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3191,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3192,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3193,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3194,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3195,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3196,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3197,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3198,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3199,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +3200,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3201,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +3202,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3203,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3204,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3205,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3206,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3207,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3208,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3209,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3210,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3211,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3212,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3213,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3214,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3215,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3216,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3217,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3218,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3219,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3220,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3221,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3222,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3223,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3224,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3225,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3226,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3227,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3228,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3229,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3230,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3231,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3232,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3233,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3234,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3235,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3236,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3237,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3238,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3239,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3240,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3241,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +3242,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3243,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3244,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3245,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3246,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3247,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +3248,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3249,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3250,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3251,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3252,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3253,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3254,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3255,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3256,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3257,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3258,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3259,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3260,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3261,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3262,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3263,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3264,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3265,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3266,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3267,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3268,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3269,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3270,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3271,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3272,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3273,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3274,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3275,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3276,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3277,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3278,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3279,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3280,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3281,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3282,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3283,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3284,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3285,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3286,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3287,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3288,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3289,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3290,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3291,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3292,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3293,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3294,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3295,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3296,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3297,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3298,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3299,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3300,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3301,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3302,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3303,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3304,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3305,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3306,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3307,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3308,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3309,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3310,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3311,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3312,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3313,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3314,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3315,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3316,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +3317,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3318,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3319,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3320,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3321,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3322,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3323,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3324,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3325,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3326,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3327,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3328,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3329,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3330,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3331,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3332,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3333,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +3334,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3335,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3336,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3337,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3338,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3339,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +3340,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3341,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3342,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3343,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3344,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3345,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3346,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3347,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3348,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3349,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3350,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3351,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3352,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3353,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3354,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3355,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3356,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3357,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3358,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3359,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3360,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3361,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3362,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3363,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3364,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3365,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +3366,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3367,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3368,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3369,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3370,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3371,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3372,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3373,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3374,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3375,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +3376,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3377,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3378,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3379,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3380,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3381,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3382,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3383,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3384,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3385,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3386,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3387,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3388,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3389,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3390,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3391,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3392,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3393,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3394,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3395,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3396,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3397,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3398,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +3399,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3400,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3401,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3402,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3403,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3404,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3405,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3406,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3407,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3408,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3409,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3410,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3411,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3412,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3413,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3414,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3415,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3416,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3417,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3418,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3419,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +3420,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3421,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3422,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3423,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3424,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3425,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3426,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3427,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3428,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3429,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3430,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3431,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3432,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3433,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3434,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3435,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3436,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +3437,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +3438,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3439,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3440,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3441,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3442,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3443,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3444,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3445,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3446,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3447,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3448,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3449,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3450,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3451,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3452,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3453,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3454,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3455,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3456,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3457,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3458,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3459,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3460,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3461,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3462,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3463,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3464,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3465,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3466,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +3467,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3468,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3469,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3470,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3471,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +3472,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3473,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3474,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3475,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3476,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +3477,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3478,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3479,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3480,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3481,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3482,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3483,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3484,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3485,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +3486,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3487,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3488,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3489,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3490,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3491,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3492,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3493,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3494,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3495,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3496,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3497,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3498,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3499,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3500,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3501,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3502,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3503,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3504,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3505,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3506,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3507,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3508,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3509,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3510,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3511,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3512,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3513,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3514,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3515,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3516,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3517,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3518,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3519,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3520,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3521,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3522,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3523,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +3524,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3525,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3526,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3527,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3528,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3529,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3530,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3531,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +3532,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3533,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3534,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3535,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3536,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3537,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3538,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +3539,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3540,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3541,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3542,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3543,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3544,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3545,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3546,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3547,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3548,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3549,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3550,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3551,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3552,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3553,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +3554,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +3555,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3556,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3557,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3558,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3559,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3560,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3561,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3562,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3563,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3564,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3565,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3566,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +3567,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3568,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3569,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3570,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3571,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +3572,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3573,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3574,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3575,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3576,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3577,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3578,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3579,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3580,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3581,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3582,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3583,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3584,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3585,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3586,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3587,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +3588,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3589,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3590,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3591,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3592,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3593,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3594,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3595,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +3596,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3597,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3598,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3599,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3600,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3601,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3602,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3603,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3604,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3605,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3606,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3607,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +3608,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +3609,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3610,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3611,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3612,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3613,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3614,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3615,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3616,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3617,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3618,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3619,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3620,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3621,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3622,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3623,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3624,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3625,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3626,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3627,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +3628,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3629,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +3630,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3631,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3632,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3633,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3634,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3635,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3636,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3637,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3638,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3639,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3640,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3641,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3642,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3643,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3644,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3645,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3646,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3647,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3648,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3649,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3650,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3651,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3652,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3653,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3654,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3655,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3656,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3657,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3658,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3659,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3660,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3661,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3662,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3663,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3664,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3665,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3666,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3667,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3668,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3669,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3670,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3671,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3672,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3673,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3674,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3675,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3676,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +3677,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3678,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3679,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3680,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3681,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3682,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3683,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3684,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3685,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3686,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3687,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3688,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +3689,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3690,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3691,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3692,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +3693,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3694,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3695,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3696,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3697,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3698,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3699,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +3700,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3701,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3702,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3703,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3704,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3705,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3706,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3707,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3708,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3709,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3710,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3711,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3712,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3713,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3714,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3715,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3716,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3717,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3718,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3719,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3720,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +3721,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3722,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3723,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3724,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3725,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3726,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3727,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3728,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3729,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3730,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3731,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3732,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3733,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3734,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3735,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3736,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3737,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3738,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3739,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3740,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3741,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3742,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3743,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3744,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3745,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3746,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +3747,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3748,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3749,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3750,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3751,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3752,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3753,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3754,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3755,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3756,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3757,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3758,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3759,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3760,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3761,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3762,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3763,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3764,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3765,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3766,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3767,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3768,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3769,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3770,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3771,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3772,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3773,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3774,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3775,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3776,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3777,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3778,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3779,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3780,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +3781,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3782,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3783,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3784,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3785,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3786,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3787,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3788,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3789,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3790,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3791,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3792,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3793,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3794,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3795,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3796,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3797,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3798,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3799,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3800,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3801,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3802,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3803,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3804,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3805,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3806,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +3807,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3808,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3809,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +3810,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3811,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3812,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3813,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3814,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3815,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3816,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3817,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3818,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3819,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3820,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3821,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3822,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3823,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3824,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +3825,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3826,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3827,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3828,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3829,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3830,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3831,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +3832,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3833,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3834,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3835,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3836,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3837,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3838,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +3839,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3840,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3841,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3842,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3843,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3844,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3845,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3846,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3847,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3848,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3849,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3850,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3851,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3852,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3853,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3854,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3855,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3856,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3857,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3858,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3859,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +3860,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3861,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3862,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3863,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3864,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3865,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3866,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3867,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3868,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3869,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3870,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3871,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3872,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3873,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3874,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3875,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3876,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3877,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +3878,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3879,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3880,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3881,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3882,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3883,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3884,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3885,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3886,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3887,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3888,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3889,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3890,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3891,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +3892,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3893,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3894,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3895,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3896,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3897,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3898,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3899,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3900,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3901,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3902,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3903,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3904,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3905,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3906,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3907,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3908,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3909,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3910,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3911,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3912,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3913,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3914,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3915,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3916,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3917,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3918,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3919,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3920,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3921,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3922,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3923,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3924,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3925,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3926,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3927,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3928,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3929,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3930,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3931,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3932,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3933,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3934,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3935,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +3936,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3937,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3938,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3939,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3940,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3941,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3942,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3943,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3944,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +3945,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3946,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3947,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3948,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3949,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3950,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3951,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +3952,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3953,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3954,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3955,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3956,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3957,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +3958,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +3959,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +3960,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3961,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3962,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3963,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3964,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +3965,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3966,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3967,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3968,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3969,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3970,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3971,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +3972,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3973,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3974,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +3975,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +3976,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +3977,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3978,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3979,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +3980,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3981,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3982,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +3983,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3984,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +3985,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +3986,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +3987,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3988,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +3989,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +3990,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +3991,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +3992,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +3993,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +3994,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +3995,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3996,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +3997,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +3998,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +3999,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4000,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4001,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4002,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4003,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4004,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4005,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4006,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4007,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4008,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4009,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4010,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4011,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4012,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4013,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4014,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4015,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4016,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4017,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +4018,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4019,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4020,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +4021,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4022,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4023,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4024,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4025,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4026,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4027,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4028,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4029,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +4030,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4031,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4032,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4033,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4034,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4035,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4036,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4037,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4038,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4039,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4040,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4041,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4042,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4043,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +4044,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4045,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4046,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4047,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4048,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4049,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4050,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4051,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4052,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4053,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4054,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4055,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4056,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4057,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +4058,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4059,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4060,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4061,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4062,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +4063,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4064,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4065,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4066,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4067,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4068,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +4069,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4070,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4071,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4072,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4073,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +4074,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4075,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4076,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4077,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4078,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4079,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +4080,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4081,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4082,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4083,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4084,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4085,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4086,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4087,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +4088,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4089,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4090,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4091,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4092,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +4093,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4094,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4095,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4096,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +4097,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4098,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4099,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +4100,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4101,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4102,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4103,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4104,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4105,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4106,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4107,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4108,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4109,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4110,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4111,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +4112,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4113,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4114,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4115,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +4116,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4117,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4118,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4119,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4120,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4121,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4122,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +4123,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4124,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4125,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4126,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4127,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4128,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4129,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4130,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4131,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4132,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4133,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4134,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4135,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4136,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4137,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4138,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4139,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4140,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4141,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4142,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4143,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4144,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4145,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4146,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4147,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4148,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +4149,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4150,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4151,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4152,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4153,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4154,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4155,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4156,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +4157,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4158,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4159,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4160,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4161,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4162,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4163,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4164,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4165,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4166,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4167,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4168,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4169,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4170,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4171,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4172,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4173,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4174,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +4175,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4176,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4177,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4178,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4179,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4180,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4181,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +4182,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4183,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4184,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4185,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4186,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +4187,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4188,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4189,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4190,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4191,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4192,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4193,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4194,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4195,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4196,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4197,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4198,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4199,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4200,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4201,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4202,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4203,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +4204,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4205,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4206,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4207,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4208,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4209,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4210,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4211,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +4212,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4213,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4214,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4215,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4216,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +4217,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4218,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4219,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4220,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4221,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4222,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4223,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4224,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4225,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4226,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4227,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +4228,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4229,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4230,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4231,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4232,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4233,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4234,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +4235,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4236,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4237,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4238,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4239,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4240,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +4241,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4242,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4243,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4244,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4245,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4246,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4247,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +4248,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4249,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4250,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4251,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4252,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4253,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4254,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4255,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4256,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4257,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4258,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4259,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4260,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4261,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4262,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4263,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4264,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +4265,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4266,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4267,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4268,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4269,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4270,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4271,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4272,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +4273,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4274,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4275,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4276,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4277,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +4278,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4279,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4280,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4281,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4282,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4283,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4284,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4285,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4286,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4287,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4288,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4289,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4290,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4291,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4292,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4293,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4294,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4295,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4296,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4297,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4298,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4299,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4300,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4301,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4302,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +4303,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4304,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4305,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4306,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4307,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4308,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4309,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4310,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4311,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4312,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4313,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4314,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4315,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4316,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4317,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4318,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4319,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4320,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4321,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4322,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4323,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4324,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4325,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4326,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4327,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4328,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4329,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4330,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4331,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4332,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4333,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4334,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4335,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4336,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4337,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4338,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4339,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4340,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4341,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4342,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4343,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4344,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4345,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4346,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4347,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4348,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4349,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4350,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4351,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4352,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4353,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4354,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4355,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4356,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4357,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4358,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4359,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4360,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4361,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4362,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4363,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +4364,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4365,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4366,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4367,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4368,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4369,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +4370,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +4371,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4372,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4373,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4374,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4375,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4376,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4377,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4378,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4379,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4380,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4381,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4382,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +4383,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4384,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4385,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4386,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4387,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4388,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4389,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4390,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4391,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4392,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4393,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4394,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4395,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4396,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4397,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4398,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4399,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4400,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4401,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4402,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4403,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4404,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4405,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4406,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4407,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4408,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4409,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4410,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4411,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4412,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4413,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4414,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4415,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4416,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4417,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4418,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4419,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4420,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4421,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4422,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4423,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4424,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4425,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4426,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4427,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4428,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4429,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4430,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4431,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4432,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4433,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4434,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4435,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4436,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +4437,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4438,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4439,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4440,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4441,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4442,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +4443,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4444,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4445,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4446,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4447,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4448,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4449,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4450,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4451,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4452,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4453,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4454,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4455,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4456,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4457,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4458,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4459,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4460,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4461,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4462,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4463,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4464,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4465,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4466,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4467,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4468,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +4469,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4470,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4471,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4472,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4473,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4474,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4475,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4476,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4477,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4478,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4479,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4480,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4481,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4482,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4483,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4484,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4485,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4486,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4487,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4488,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4489,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4490,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4491,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4492,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4493,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4494,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4495,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4496,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4497,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4498,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4499,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4500,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4501,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4502,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4503,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +4504,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4505,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +4506,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4507,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4508,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4509,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4510,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4511,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4512,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4513,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4514,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4515,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4516,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4517,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4518,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4519,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4520,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4521,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4522,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4523,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4524,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4525,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4526,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4527,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4528,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4529,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4530,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4531,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4532,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4533,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4534,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4535,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4536,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4537,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4538,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4539,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4540,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4541,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4542,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4543,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4544,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4545,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +4546,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4547,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4548,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4549,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4550,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4551,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4552,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4553,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4554,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4555,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4556,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4557,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4558,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4559,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4560,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4561,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4562,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4563,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4564,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4565,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4566,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4567,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4568,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4569,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4570,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4571,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4572,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4573,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4574,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4575,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4576,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4577,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4578,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4579,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4580,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4581,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4582,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4583,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4584,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4585,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4586,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4587,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +4588,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4589,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4590,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4591,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4592,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4593,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4594,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4595,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +4596,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4597,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4598,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4599,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4600,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4601,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4602,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4603,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4604,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4605,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4606,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4607,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4608,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4609,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4610,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4611,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4612,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4613,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4614,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4615,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4616,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +4617,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4618,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4619,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4620,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4621,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4622,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +4623,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4624,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4625,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4626,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4627,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4628,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4629,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4630,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4631,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4632,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4633,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4634,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4635,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4636,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4637,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4638,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4639,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4640,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4641,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4642,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4643,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4644,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4645,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4646,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4647,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4648,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4649,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4650,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4651,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4652,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4653,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4654,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4655,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +4656,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4657,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4658,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4659,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4660,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4661,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4662,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4663,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4664,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4665,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4666,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +4667,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4668,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4669,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4670,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4671,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4672,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4673,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4674,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4675,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4676,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4677,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4678,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4679,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4680,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4681,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4682,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4683,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4684,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4685,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4686,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4687,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4688,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4689,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4690,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4691,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4692,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4693,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4694,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4695,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4696,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4697,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4698,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4699,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +4700,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4701,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4702,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4703,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4704,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4705,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4706,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +4707,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4708,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4709,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4710,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4711,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4712,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4713,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4714,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4715,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4716,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4717,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4718,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4719,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4720,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4721,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4722,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4723,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4724,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4725,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4726,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4727,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4728,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4729,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4730,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4731,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4732,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4733,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4734,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4735,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4736,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4737,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4738,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4739,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4740,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4741,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4742,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4743,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4744,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +4745,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4746,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4747,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4748,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4749,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4750,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4751,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4752,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4753,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4754,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4755,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4756,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4757,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4758,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4759,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4760,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4761,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4762,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4763,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4764,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4765,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4766,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4767,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4768,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4769,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4770,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4771,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4772,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4773,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4774,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4775,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4776,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4777,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4778,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4779,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4780,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4781,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4782,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +4783,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4784,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4785,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4786,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +4787,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4788,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4789,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4790,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4791,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +4792,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4793,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4794,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4795,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +4796,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4797,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4798,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4799,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4800,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4801,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +4802,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4803,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +4804,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4805,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4806,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4807,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4808,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4809,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4810,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4811,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4812,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4813,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +4814,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4815,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4816,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4817,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4818,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4819,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4820,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4821,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4822,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4823,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4824,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4825,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4826,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4827,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +4828,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4829,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4830,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +4831,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +4832,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4833,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4834,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4835,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4836,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4837,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4838,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4839,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4840,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4841,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4842,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4843,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4844,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4845,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4846,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4847,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4848,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4849,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4850,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4851,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4852,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4853,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4854,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4855,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4856,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4857,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4858,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4859,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4860,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4861,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4862,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4863,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4864,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4865,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4866,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4867,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +4868,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4869,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4870,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4871,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4872,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4873,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +4874,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4875,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4876,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4877,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4878,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4879,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4880,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4881,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4882,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4883,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4884,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4885,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4886,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4887,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +4888,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +4889,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4890,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +4891,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4892,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4893,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4894,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4895,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4896,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4897,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4898,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4899,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4900,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4901,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +4902,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4903,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4904,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4905,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4906,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4907,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4908,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4909,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4910,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4911,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +4912,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4913,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4914,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4915,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +4916,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4917,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4918,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4919,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4920,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4921,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4922,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4923,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4924,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4925,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4926,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +4927,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4928,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4929,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4930,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4931,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4932,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4933,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4934,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4935,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4936,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4937,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +4938,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4939,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4940,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4941,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4942,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4943,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4944,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4945,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4946,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4947,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4948,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4949,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4950,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4951,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4952,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4953,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +4954,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4955,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4956,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4957,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4958,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4959,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4960,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4961,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4962,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +4963,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4964,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4965,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4966,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4967,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4968,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4969,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4970,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4971,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +4972,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4973,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4974,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +4975,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +4976,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4977,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +4978,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4979,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4980,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4981,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4982,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4983,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +4984,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +4985,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4986,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4987,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +4988,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +4989,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +4990,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +4991,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +4992,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +4993,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +4994,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +4995,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +4996,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +4997,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +4998,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +4999,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5000,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5001,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5002,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5003,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5004,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5005,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5006,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5007,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5008,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5009,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5010,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5011,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5012,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5013,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5014,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5015,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5016,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5017,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5018,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5019,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5020,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5021,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5022,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5023,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5024,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5025,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5026,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5027,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5028,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5029,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5030,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5031,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5032,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5033,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5034,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5035,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5036,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5037,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5038,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5039,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5040,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5041,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5042,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5043,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +5044,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5045,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5046,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5047,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5048,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5049,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5050,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5051,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5052,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5053,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5054,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5055,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5056,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5057,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5058,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5059,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5060,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +5061,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5062,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5063,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5064,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +5065,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5066,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5067,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +5068,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5069,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5070,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5071,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5072,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5073,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5074,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5075,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5076,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5077,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +5078,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5079,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5080,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5081,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5082,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5083,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5084,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5085,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5086,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5087,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +5088,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5089,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5090,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5091,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5092,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5093,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5094,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5095,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5096,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5097,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5098,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5099,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5100,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5101,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5102,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +5103,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5104,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5105,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5106,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5107,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5108,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5109,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5110,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5111,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5112,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5113,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5114,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5115,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5116,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +5117,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5118,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5119,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5120,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5121,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +5122,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5123,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5124,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5125,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5126,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5127,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5128,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5129,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5130,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5131,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5132,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5133,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5134,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5135,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5136,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5137,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5138,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5139,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5140,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5141,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5142,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +5143,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +5144,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5145,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5146,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5147,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5148,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5149,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5150,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +5151,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +5152,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5153,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5154,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5155,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5156,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5157,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5158,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5159,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5160,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +5161,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5162,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5163,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5164,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5165,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5166,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5167,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5168,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5169,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5170,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5171,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5172,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5173,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5174,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5175,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5176,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5177,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5178,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5179,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5180,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5181,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5182,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5183,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5184,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5185,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5186,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5187,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +5188,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5189,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +5190,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5191,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5192,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +5193,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5194,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +5195,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5196,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5197,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5198,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5199,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5200,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5201,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5202,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5203,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5204,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5205,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5206,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +5207,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5208,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5209,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5210,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5211,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5212,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5213,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5214,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5215,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5216,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5217,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5218,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5219,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5220,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5221,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5222,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5223,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +5224,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5225,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5226,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5227,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5228,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5229,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5230,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5231,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5232,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5233,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5234,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5235,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +5236,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5237,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5238,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5239,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5240,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5241,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5242,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5243,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5244,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5245,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5246,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +5247,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5248,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5249,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +5250,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5251,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5252,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5253,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5254,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5255,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5256,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5257,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +5258,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5259,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5260,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5261,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5262,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5263,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5264,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5265,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5266,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5267,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5268,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5269,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5270,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5271,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5272,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5273,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5274,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5275,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5276,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5277,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5278,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5279,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5280,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5281,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5282,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5283,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5284,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5285,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5286,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5287,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5288,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5289,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5290,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5291,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5292,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5293,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5294,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5295,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5296,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5297,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5298,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5299,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5300,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5301,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5302,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5303,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5304,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5305,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5306,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5307,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +5308,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5309,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5310,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5311,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5312,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5313,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5314,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5315,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5316,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5317,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5318,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +5319,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +5320,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +5321,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5322,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5323,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +5324,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5325,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5326,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5327,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5328,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5329,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5330,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5331,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5332,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5333,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5334,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5335,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5336,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5337,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5338,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5339,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5340,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5341,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5342,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5343,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5344,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5345,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5346,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +5347,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5348,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5349,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5350,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5351,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5352,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5353,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +5354,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5355,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5356,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5357,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5358,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5359,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5360,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5361,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5362,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5363,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5364,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5365,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5366,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5367,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5368,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5369,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5370,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5371,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5372,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5373,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5374,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5375,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5376,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5377,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5378,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5379,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +5380,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5381,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5382,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5383,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5384,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5385,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5386,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5387,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5388,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5389,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5390,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5391,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +5392,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5393,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5394,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5395,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5396,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5397,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5398,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5399,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5400,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5401,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5402,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5403,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5404,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +5405,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5406,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5407,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5408,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5409,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5410,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5411,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5412,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5413,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5414,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5415,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5416,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5417,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +5418,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +5419,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5420,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5421,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5422,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +5423,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5424,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5425,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5426,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5427,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5428,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5429,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5430,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5431,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5432,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5433,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5434,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5435,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +5436,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5437,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +5438,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5439,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5440,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5441,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5442,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5443,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5444,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5445,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5446,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5447,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5448,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5449,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5450,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5451,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5452,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5453,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5454,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5455,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5456,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5457,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5458,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5459,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5460,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5461,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5462,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5463,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5464,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5465,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5466,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5467,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +5468,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5469,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5470,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5471,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5472,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5473,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5474,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5475,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5476,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +5477,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5478,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5479,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5480,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +5481,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5482,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5483,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5484,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5485,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5486,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5487,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5488,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5489,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5490,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5491,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5492,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5493,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5494,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +5495,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5496,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +5497,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5498,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5499,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5500,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5501,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5502,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5503,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5504,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5505,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5506,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5507,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5508,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5509,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5510,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5511,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5512,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5513,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5514,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5515,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5516,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5517,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5518,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5519,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5520,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5521,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5522,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5523,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5524,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5525,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5526,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5527,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5528,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5529,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5530,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5531,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5532,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5533,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5534,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5535,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5536,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5537,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5538,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5539,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5540,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5541,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5542,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5543,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5544,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5545,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5546,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +5547,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5548,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5549,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5550,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5551,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5552,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5553,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5554,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5555,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5556,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5557,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5558,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5559,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +5560,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5561,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5562,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5563,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5564,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5565,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5566,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5567,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5568,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5569,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5570,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5571,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5572,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5573,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5574,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5575,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5576,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5577,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5578,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5579,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5580,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5581,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5582,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5583,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5584,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5585,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5586,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5587,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5588,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5589,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5590,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5591,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5592,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5593,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5594,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5595,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5596,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5597,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5598,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +5599,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5600,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5601,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5602,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +5603,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +5604,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5605,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5606,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5607,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5608,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5609,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5610,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5611,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5612,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5613,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +5614,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5615,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5616,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5617,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5618,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5619,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +5620,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5621,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5622,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5623,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5624,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5625,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5626,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5627,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5628,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5629,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5630,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5631,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5632,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5633,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5634,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5635,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5636,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5637,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5638,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5639,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5640,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5641,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5642,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +5643,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5644,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5645,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5646,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5647,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5648,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +5649,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +5650,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5651,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5652,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5653,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5654,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5655,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5656,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5657,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5658,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5659,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +5660,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5661,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +5662,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5663,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5664,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5665,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5666,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5667,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5668,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5669,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5670,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5671,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5672,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5673,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +5674,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5675,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5676,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5677,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5678,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5679,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5680,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5681,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5682,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5683,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5684,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5685,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5686,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5687,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5688,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5689,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5690,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5691,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5692,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5693,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5694,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5695,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5696,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5697,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5698,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5699,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5700,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5701,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5702,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5703,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5704,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5705,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5706,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5707,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5708,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5709,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5710,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5711,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5712,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5713,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5714,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5715,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5716,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5717,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5718,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +5719,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5720,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5721,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +5722,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5723,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5724,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5725,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5726,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5727,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5728,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5729,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5730,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5731,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5732,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5733,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5734,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5735,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5736,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5737,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5738,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5739,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5740,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5741,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5742,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5743,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +5744,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5745,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5746,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5747,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5748,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5749,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5750,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5751,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5752,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5753,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5754,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5755,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5756,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5757,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5758,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5759,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5760,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5761,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5762,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5763,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5764,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +5765,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5766,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5767,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5768,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5769,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5770,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5771,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5772,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5773,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5774,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5775,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5776,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5777,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5778,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +5779,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5780,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5781,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5782,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5783,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5784,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5785,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5786,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5787,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5788,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5789,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5790,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5791,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5792,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5793,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5794,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5795,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5796,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5797,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +5798,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5799,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5800,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5801,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5802,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5803,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5804,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5805,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5806,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5807,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5808,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +5809,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5810,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5811,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5812,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5813,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5814,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5815,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5816,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5817,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5818,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5819,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5820,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5821,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5822,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5823,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5824,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +5825,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5826,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5827,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5828,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5829,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5830,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5831,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5832,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5833,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5834,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5835,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5836,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5837,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5838,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5839,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5840,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5841,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5842,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5843,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5844,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5845,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5846,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5847,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5848,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5849,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5850,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5851,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5852,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5853,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5854,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5855,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5856,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5857,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +5858,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5859,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5860,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +5861,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5862,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5863,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5864,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5865,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5866,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +5867,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5868,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5869,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5870,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5871,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5872,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5873,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5874,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +5875,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5876,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +5877,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5878,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5879,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +5880,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5881,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5882,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5883,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5884,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5885,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5886,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5887,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5888,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5889,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5890,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5891,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5892,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5893,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5894,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +5895,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5896,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5897,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5898,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5899,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5900,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5901,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5902,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5903,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5904,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5905,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5906,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +5907,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5908,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5909,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +5910,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5911,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5912,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5913,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5914,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5915,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5916,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5917,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5918,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5919,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5920,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5921,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5922,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5923,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5924,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +5925,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5926,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5927,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5928,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +5929,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5930,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5931,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5932,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +5933,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +5934,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5935,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5936,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5937,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5938,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5939,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5940,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5941,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5942,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5943,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5944,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +5945,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5946,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5947,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +5948,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5949,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5950,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5951,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5952,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5953,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5954,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5955,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5956,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5957,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5958,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5959,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +5960,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5961,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +5962,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5963,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5964,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5965,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +5966,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +5967,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5968,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5969,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5970,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +5971,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5972,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5973,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5974,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5975,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +5976,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5977,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +5978,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5979,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5980,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +5981,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5982,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +5983,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5984,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +5985,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5986,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5987,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5988,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5989,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +5990,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5991,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +5992,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +5993,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +5994,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +5995,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +5996,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +5997,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +5998,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +5999,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +6000,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6001,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6002,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6003,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6004,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +6005,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6006,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6007,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6008,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6009,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +6010,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +6011,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6012,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6013,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6014,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6015,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6016,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6017,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +6018,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +6019,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +6020,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6021,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6022,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +6023,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6024,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6025,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6026,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6027,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6028,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6029,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6030,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6031,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6032,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6033,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6034,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6035,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6036,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6037,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +6038,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6039,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6040,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6041,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6042,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6043,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6044,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6045,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6046,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6047,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6048,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6049,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6050,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6051,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6052,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6053,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6054,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6055,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6056,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +6057,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6058,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6059,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6060,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6061,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6062,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6063,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6064,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6065,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6066,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6067,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +6068,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6069,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6070,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6071,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6072,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6073,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6074,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6075,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6076,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6077,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6078,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6079,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6080,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6081,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6082,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6083,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6084,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6085,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6086,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +6087,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6088,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6089,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6090,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6091,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6092,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6093,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6094,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6095,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6096,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6097,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +6098,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6099,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6100,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6101,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6102,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6103,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6104,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6105,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6106,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6107,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6108,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6109,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6110,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6111,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6112,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6113,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6114,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6115,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6116,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6117,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6118,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6119,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6120,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6121,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6122,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6123,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6124,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6125,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6126,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6127,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6128,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6129,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6130,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6131,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6132,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6133,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6134,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6135,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +6136,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6137,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6138,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6139,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6140,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6141,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6142,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6143,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6144,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6145,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6146,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +6147,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6148,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6149,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6150,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +6151,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6152,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6153,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6154,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6155,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +6156,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6157,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6158,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6159,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6160,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6161,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6162,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +6163,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6164,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6165,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6166,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6167,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6168,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6169,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6170,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6171,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6172,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6173,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6174,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6175,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6176,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6177,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6178,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6179,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6180,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6181,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6182,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6183,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6184,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6185,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6186,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6187,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6188,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6189,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6190,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6191,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6192,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6193,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6194,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6195,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6196,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6197,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6198,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6199,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6200,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6201,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +6202,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6203,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6204,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6205,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6206,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6207,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6208,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6209,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6210,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6211,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6212,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6213,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6214,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6215,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6216,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6217,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6218,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6219,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6220,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6221,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +6222,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +6223,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6224,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6225,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6226,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6227,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6228,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6229,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6230,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6231,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6232,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6233,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6234,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6235,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6236,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6237,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6238,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +6239,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6240,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6241,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6242,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6243,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +6244,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6245,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6246,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +6247,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6248,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6249,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6250,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6251,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6252,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6253,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6254,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6255,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6256,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6257,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6258,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6259,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6260,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6261,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6262,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6263,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6264,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6265,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +6266,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6267,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6268,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6269,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6270,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6271,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6272,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6273,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6274,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6275,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6276,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6277,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6278,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6279,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6280,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6281,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6282,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6283,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6284,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6285,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6286,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6287,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6288,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6289,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6290,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6291,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6292,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +6293,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +6294,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6295,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6296,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6297,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6298,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6299,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6300,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6301,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6302,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6303,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6304,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6305,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6306,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6307,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6308,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6309,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +6310,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6311,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6312,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6313,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6314,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6315,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6316,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6317,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6318,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6319,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6320,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6321,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6322,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6323,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6324,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6325,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6326,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6327,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6328,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +6329,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6330,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6331,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6332,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6333,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6334,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6335,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6336,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6337,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6338,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +6339,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6340,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6341,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6342,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6343,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +6344,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6345,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6346,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6347,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6348,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6349,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6350,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6351,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6352,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6353,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6354,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6355,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6356,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6357,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6358,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6359,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6360,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6361,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6362,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6363,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6364,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6365,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6366,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6367,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6368,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6369,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6370,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6371,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6372,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6373,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6374,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6375,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +6376,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +6377,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6378,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6379,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6380,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6381,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6382,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6383,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6384,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6385,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6386,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6387,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6388,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6389,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6390,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6391,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6392,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6393,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6394,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6395,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6396,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6397,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6398,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +6399,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6400,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6401,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +6402,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +6403,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6404,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6405,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +6406,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6407,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +6408,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6409,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6410,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6411,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +6412,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6413,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6414,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6415,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6416,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6417,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6418,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6419,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6420,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6421,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6422,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +6423,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6424,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6425,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6426,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6427,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6428,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6429,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6430,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6431,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6432,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6433,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6434,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6435,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6436,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +6437,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6438,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6439,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6440,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6441,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +6442,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6443,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6444,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6445,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +6446,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6447,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6448,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6449,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6450,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6451,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6452,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +6453,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6454,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +6455,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +6456,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6457,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6458,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6459,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6460,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6461,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6462,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6463,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6464,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6465,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6466,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6467,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6468,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6469,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6470,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6471,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +6472,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +6473,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6474,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6475,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6476,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6477,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6478,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6479,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6480,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6481,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6482,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6483,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6484,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6485,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6486,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +6487,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +6488,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6489,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +6490,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6491,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6492,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6493,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6494,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6495,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6496,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6497,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6498,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6499,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +6500,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6501,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6502,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6503,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6504,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6505,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6506,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6507,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6508,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6509,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6510,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6511,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6512,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6513,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6514,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6515,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6516,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6517,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6518,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6519,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6520,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6521,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6522,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6523,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +6524,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6525,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +6526,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6527,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6528,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6529,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6530,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6531,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +6532,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +6533,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6534,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6535,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6536,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6537,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6538,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6539,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6540,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6541,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6542,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6543,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +6544,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +6545,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6546,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6547,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6548,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6549,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6550,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +6551,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6552,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6553,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6554,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6555,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6556,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6557,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6558,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6559,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6560,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6561,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6562,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6563,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6564,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6565,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6566,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +6567,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6568,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6569,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6570,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6571,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6572,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +6573,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6574,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6575,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6576,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +6577,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6578,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6579,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6580,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6581,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6582,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6583,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +6584,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6585,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6586,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6587,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6588,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6589,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6590,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6591,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6592,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6593,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6594,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6595,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6596,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6597,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6598,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6599,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6600,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6601,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6602,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6603,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6604,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6605,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6606,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6607,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6608,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6609,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6610,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6611,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6612,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6613,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6614,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6615,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6616,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6617,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +6618,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6619,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6620,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6621,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6622,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6623,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6624,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6625,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6626,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +6627,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6628,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +6629,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6630,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6631,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6632,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6633,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6634,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6635,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6636,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6637,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6638,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6639,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6640,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6641,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6642,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6643,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6644,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +6645,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6646,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6647,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6648,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +6649,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6650,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6651,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6652,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6653,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6654,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6655,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6656,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6657,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6658,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6659,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6660,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6661,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6662,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6663,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6664,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6665,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6666,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6667,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6668,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6669,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6670,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6671,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6672,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +6673,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +6674,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6675,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6676,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6677,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6678,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6679,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6680,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6681,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6682,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6683,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6684,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6685,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6686,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6687,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6688,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6689,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6690,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6691,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6692,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6693,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6694,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6695,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6696,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6697,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6698,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6699,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6700,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6701,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6702,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6703,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6704,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6705,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6706,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6707,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6708,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6709,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6710,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6711,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6712,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6713,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6714,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6715,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6716,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6717,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6718,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6719,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6720,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +6721,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6722,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6723,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +6724,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6725,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6726,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6727,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6728,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6729,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6730,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +6731,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6732,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +6733,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6734,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6735,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +6736,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6737,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6738,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6739,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6740,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6741,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6742,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6743,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +6744,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6745,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6746,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6747,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6748,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6749,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6750,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6751,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6752,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6753,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +6754,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6755,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6756,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +6757,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6758,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6759,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6760,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6761,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6762,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6763,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6764,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6765,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6766,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6767,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6768,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6769,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6770,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6771,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6772,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6773,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6774,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6775,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +6776,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6777,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6778,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6779,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +6780,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +6781,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6782,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6783,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6784,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6785,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6786,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6787,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +6788,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6789,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6790,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6791,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6792,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6793,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6794,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6795,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6796,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6797,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6798,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6799,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +6800,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6801,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6802,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +6803,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6804,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6805,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6806,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6807,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6808,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6809,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6810,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6811,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6812,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6813,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6814,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6815,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6816,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6817,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6818,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6819,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6820,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6821,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6822,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6823,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6824,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6825,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +6826,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6827,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6828,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6829,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6830,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6831,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6832,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6833,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6834,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6835,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6836,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6837,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6838,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6839,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6840,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6841,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +6842,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +6843,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6844,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6845,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6846,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6847,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6848,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6849,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +6850,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6851,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6852,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6853,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +6854,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6855,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6856,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6857,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6858,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6859,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6860,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6861,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6862,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6863,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6864,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6865,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6866,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6867,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +6868,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6869,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +6870,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +6871,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6872,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6873,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6874,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6875,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6876,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6877,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6878,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6879,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6880,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6881,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6882,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6883,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +6884,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6885,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6886,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +6887,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6888,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6889,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6890,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6891,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6892,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6893,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6894,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6895,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6896,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6897,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6898,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +6899,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6900,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6901,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +6902,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6903,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6904,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6905,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6906,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6907,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +6908,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6909,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6910,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +6911,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6912,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6913,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6914,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6915,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6916,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6917,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6918,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6919,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6920,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6921,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6922,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6923,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6924,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6925,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6926,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6927,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +6928,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6929,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6930,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6931,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6932,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6933,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6934,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6935,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6936,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6937,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6938,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6939,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6940,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6941,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6942,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6943,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6944,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6945,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6946,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6947,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +6948,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +6949,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6950,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6951,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6952,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6953,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6954,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6955,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6956,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6957,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +6958,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6959,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6960,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6961,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6962,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6963,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6964,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6965,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6966,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6967,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +6968,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6969,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6970,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6971,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +6972,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6973,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6974,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +6975,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +6976,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6977,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6978,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +6979,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6980,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +6981,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6982,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +6983,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6984,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +6985,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6986,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +6987,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +6988,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6989,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +6990,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6991,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +6992,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +6993,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6994,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +6995,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +6996,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +6997,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +6998,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +6999,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7000,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7001,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7002,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7003,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7004,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7005,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7006,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7007,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7008,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +7009,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7010,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7011,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7012,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7013,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7014,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7015,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7016,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7017,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7018,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7019,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7020,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7021,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7022,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7023,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7024,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7025,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7026,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7027,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7028,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7029,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +7030,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7031,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7032,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7033,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7034,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7035,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7036,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7037,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7038,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7039,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7040,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7041,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7042,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7043,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7044,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7045,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7046,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7047,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +7048,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7049,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7050,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7051,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7052,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +7053,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7054,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7055,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7056,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7057,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +7058,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7059,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7060,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7061,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7062,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7063,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7064,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7065,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7066,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7067,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7068,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +7069,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7070,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7071,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7072,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7073,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7074,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7075,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7076,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7077,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7078,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7079,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7080,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7081,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7082,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +7083,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7084,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7085,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7086,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7087,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7088,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7089,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7090,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7091,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7092,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7093,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7094,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7095,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7096,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7097,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7098,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7099,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7100,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7101,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7102,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7103,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7104,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7105,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7106,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7107,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7108,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7109,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7110,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7111,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7112,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7113,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7114,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7115,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7116,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7117,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7118,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7119,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7120,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7121,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7122,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7123,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7124,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7125,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7126,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7127,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +7128,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7129,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7130,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +7131,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7132,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7133,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7134,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7135,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7136,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7137,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7138,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7139,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7140,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7141,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +7142,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7143,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7144,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7145,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +7146,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7147,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +7148,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7149,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7150,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7151,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7152,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7153,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7154,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7155,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +7156,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7157,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7158,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7159,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7160,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7161,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7162,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7163,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +7164,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7165,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7166,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7167,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7168,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7169,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7170,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +7171,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7172,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7173,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7174,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7175,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7176,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7177,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7178,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7179,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7180,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7181,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7182,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7183,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7184,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +7185,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7186,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7187,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7188,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7189,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7190,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7191,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7192,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7193,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7194,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7195,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7196,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7197,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7198,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7199,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7200,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7201,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7202,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7203,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7204,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +7205,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +7206,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7207,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7208,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7209,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7210,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7211,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7212,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7213,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7214,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7215,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7216,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7217,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7218,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7219,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7220,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7221,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7222,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7223,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7224,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7225,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7226,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7227,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7228,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7229,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7230,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7231,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7232,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7233,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7234,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +7235,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7236,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7237,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +7238,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7239,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7240,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7241,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7242,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +7243,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7244,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7245,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7246,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7247,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7248,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7249,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7250,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7251,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7252,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7253,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7254,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +7255,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7256,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7257,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7258,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7259,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7260,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +7261,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +7262,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7263,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7264,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7265,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7266,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7267,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7268,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7269,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7270,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7271,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +7272,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7273,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7274,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7275,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7276,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7277,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7278,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7279,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7280,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7281,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7282,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7283,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7284,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7285,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7286,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7287,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7288,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7289,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7290,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7291,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7292,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7293,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7294,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7295,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7296,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7297,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7298,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7299,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +7300,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7301,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7302,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7303,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7304,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7305,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7306,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7307,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7308,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7309,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7310,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7311,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7312,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7313,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7314,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7315,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7316,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7317,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7318,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7319,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7320,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7321,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +7322,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7323,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7324,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7325,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7326,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7327,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7328,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7329,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7330,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7331,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7332,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7333,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7334,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7335,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7336,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7337,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7338,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7339,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7340,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +7341,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7342,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7343,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7344,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7345,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +7346,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7347,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7348,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7349,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7350,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7351,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7352,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7353,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7354,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7355,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7356,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7357,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7358,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7359,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7360,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7361,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7362,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7363,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7364,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7365,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7366,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7367,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7368,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7369,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7370,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7371,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7372,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7373,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7374,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7375,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7376,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7377,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7378,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7379,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7380,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7381,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +7382,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7383,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7384,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7385,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7386,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +7387,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +7388,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7389,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7390,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7391,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7392,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7393,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7394,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7395,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7396,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7397,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +7398,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7399,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7400,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7401,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7402,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7403,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7404,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +7405,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7406,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7407,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7408,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +7409,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7410,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7411,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +7412,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7413,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7414,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7415,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7416,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7417,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7418,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7419,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7420,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7421,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7422,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7423,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +7424,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7425,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7426,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7427,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7428,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7429,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7430,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7431,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7432,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7433,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7434,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7435,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7436,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7437,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +7438,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7439,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7440,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7441,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7442,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7443,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7444,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7445,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7446,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7447,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7448,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7449,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7450,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7451,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7452,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7453,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7454,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7455,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7456,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7457,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7458,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7459,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7460,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7461,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7462,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7463,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7464,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7465,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7466,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +7467,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7468,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7469,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7470,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7471,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7472,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7473,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +7474,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7475,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7476,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7477,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7478,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7479,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7480,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7481,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7482,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7483,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7484,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7485,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7486,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7487,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7488,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7489,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7490,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7491,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7492,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7493,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7494,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7495,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +7496,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7497,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7498,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7499,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7500,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7501,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7502,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7503,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7504,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7505,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7506,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7507,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +7508,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7509,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7510,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7511,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7512,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7513,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7514,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7515,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7516,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7517,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7518,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7519,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7520,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7521,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7522,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7523,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7524,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7525,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7526,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7527,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7528,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7529,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7530,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7531,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7532,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7533,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7534,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7535,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7536,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7537,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7538,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7539,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7540,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +7541,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7542,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7543,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7544,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7545,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7546,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7547,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7548,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7549,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7550,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7551,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7552,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7553,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7554,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7555,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7556,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7557,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7558,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7559,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7560,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7561,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7562,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7563,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7564,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7565,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7566,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7567,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7568,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7569,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7570,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7571,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7572,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7573,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7574,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7575,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7576,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7577,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7578,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7579,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7580,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7581,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7582,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7583,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7584,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7585,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7586,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7587,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7588,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7589,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7590,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +7591,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7592,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7593,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7594,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7595,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7596,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7597,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7598,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7599,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7600,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7601,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7602,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7603,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7604,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7605,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7606,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +7607,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7608,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7609,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7610,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7611,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7612,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7613,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7614,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7615,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7616,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7617,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7618,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +7619,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7620,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7621,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7622,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7623,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7624,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7625,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7626,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7627,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7628,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +7629,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7630,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7631,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7632,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +7633,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7634,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7635,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7636,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7637,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7638,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7639,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7640,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7641,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7642,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7643,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7644,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7645,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7646,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7647,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7648,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +7649,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7650,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7651,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7652,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +7653,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7654,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7655,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7656,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7657,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7658,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7659,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7660,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7661,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7662,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7663,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7664,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7665,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7666,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7667,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7668,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7669,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7670,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7671,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7672,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7673,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7674,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7675,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7676,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +7677,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7678,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7679,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7680,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7681,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7682,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7683,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7684,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7685,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7686,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7687,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7688,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7689,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7690,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7691,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7692,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7693,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7694,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7695,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7696,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7697,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7698,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7699,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7700,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7701,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7702,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7703,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7704,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7705,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7706,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7707,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7708,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7709,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7710,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7711,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7712,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7713,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7714,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7715,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7716,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7717,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7718,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7719,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7720,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7721,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7722,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7723,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7724,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7725,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7726,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7727,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7728,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7729,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7730,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7731,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7732,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7733,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7734,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7735,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +7736,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7737,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7738,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7739,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7740,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7741,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7742,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7743,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7744,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7745,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7746,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7747,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7748,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7749,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7750,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7751,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7752,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7753,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7754,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7755,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7756,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7757,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7758,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7759,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7760,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7761,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7762,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7763,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7764,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7765,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7766,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7767,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7768,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7769,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7770,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7771,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7772,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7773,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7774,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7775,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7776,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7777,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7778,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7779,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7780,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +7781,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7782,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7783,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7784,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7785,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7786,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7787,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7788,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7789,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7790,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7791,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7792,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7793,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7794,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7795,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7796,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7797,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7798,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7799,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7800,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7801,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7802,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7803,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7804,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7805,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7806,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7807,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7808,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7809,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7810,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7811,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7812,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7813,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7814,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7815,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7816,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7817,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7818,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7819,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7820,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7821,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7822,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7823,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7824,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7825,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7826,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7827,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7828,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7829,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7830,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +7831,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7832,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +7833,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7834,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7835,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +7836,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7837,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +7838,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7839,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7840,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +7841,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7842,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7843,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7844,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7845,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7846,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7847,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7848,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7849,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7850,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7851,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7852,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +7853,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7854,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7855,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7856,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7857,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7858,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7859,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7860,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +7861,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7862,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7863,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7864,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7865,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7866,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7867,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7868,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7869,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +7870,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7871,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7872,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7873,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7874,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +7875,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7876,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7877,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7878,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7879,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7880,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7881,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7882,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7883,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7884,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +7885,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7886,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7887,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7888,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7889,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7890,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7891,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7892,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7893,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7894,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7895,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7896,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7897,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7898,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +7899,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7900,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7901,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7902,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +7903,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7904,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7905,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7906,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7907,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7908,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7909,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7910,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7911,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7912,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7913,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7914,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7915,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7916,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7917,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7918,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7919,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7920,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +7921,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7922,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7923,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7924,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7925,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7926,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7927,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7928,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +7929,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7930,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +7931,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7932,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +7933,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7934,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +7935,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7936,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7937,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7938,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7939,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7940,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7941,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7942,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7943,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7944,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7945,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7946,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7947,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +7948,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7949,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7950,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7951,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7952,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +7953,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7954,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +7955,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7956,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7957,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +7958,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7959,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +7960,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +7961,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7962,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7963,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7964,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +7965,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7966,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7967,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7968,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7969,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +7970,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +7971,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7972,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7973,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7974,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +7975,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7976,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +7977,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7978,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +7979,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7980,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7981,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +7982,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +7983,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +7984,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +7985,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7986,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7987,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +7988,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7989,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +7990,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +7991,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +7992,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7993,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7994,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7995,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +7996,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +7997,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +7998,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +7999,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8000,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8001,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +8002,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8003,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8004,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8005,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8006,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8007,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8008,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8009,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8010,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8011,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8012,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +8013,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8014,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8015,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8016,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8017,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8018,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +8019,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8020,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8021,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8022,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8023,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8024,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8025,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8026,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8027,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +8028,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +8029,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8030,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8031,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8032,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8033,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8034,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8035,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8036,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8037,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8038,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8039,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8040,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8041,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8042,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8043,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8044,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8045,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8046,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +8047,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8048,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8049,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8050,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8051,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8052,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8053,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8054,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8055,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8056,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8057,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8058,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8059,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8060,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8061,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8062,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8063,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8064,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8065,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8066,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8067,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8068,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8069,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8070,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +8071,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8072,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8073,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8074,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8075,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8076,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8077,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8078,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8079,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8080,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8081,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8082,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8083,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8084,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8085,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8086,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8087,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8088,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8089,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8090,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8091,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8092,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8093,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8094,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8095,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8096,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +8097,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8098,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8099,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8100,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8101,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8102,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8103,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8104,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8105,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8106,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8107,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8108,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8109,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8110,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8111,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8112,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +8113,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8114,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +8115,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8116,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8117,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8118,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8119,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8120,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8121,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8122,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8123,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8124,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8125,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8126,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8127,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8128,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8129,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8130,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8131,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8132,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8133,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8134,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8135,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8136,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8137,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8138,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8139,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8140,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8141,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8142,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8143,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8144,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8145,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8146,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8147,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8148,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8149,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8150,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8151,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8152,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8153,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8154,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8155,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8156,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +8157,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8158,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8159,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8160,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8161,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8162,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8163,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8164,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +8165,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8166,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8167,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8168,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8169,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +8170,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8171,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8172,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8173,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8174,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8175,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +8176,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8177,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8178,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8179,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8180,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8181,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8182,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8183,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8184,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8185,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8186,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8187,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8188,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8189,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8190,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8191,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8192,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8193,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8194,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8195,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8196,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8197,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8198,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8199,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8200,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8201,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8202,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8203,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8204,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8205,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8206,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8207,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8208,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +8209,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +8210,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8211,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +8212,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8213,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8214,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8215,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8216,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +8217,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8218,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8219,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8220,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8221,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8222,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +8223,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8224,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8225,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8226,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +8227,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8228,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8229,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8230,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8231,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8232,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8233,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8234,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8235,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8236,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8237,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8238,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8239,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8240,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8241,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8242,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8243,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8244,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8245,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8246,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8247,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8248,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8249,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8250,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8251,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8252,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8253,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8254,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8255,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8256,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8257,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8258,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8259,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8260,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8261,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8262,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8263,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8264,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8265,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8266,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8267,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8268,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8269,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8270,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8271,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8272,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8273,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8274,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8275,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8276,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8277,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8278,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8279,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +8280,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8281,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8282,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8283,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +8284,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8285,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8286,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8287,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +8288,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8289,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8290,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8291,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8292,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8293,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8294,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8295,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +8296,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8297,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8298,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8299,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8300,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8301,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8302,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8303,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8304,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8305,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8306,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8307,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8308,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8309,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8310,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8311,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8312,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8313,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8314,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8315,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8316,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8317,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8318,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8319,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8320,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8321,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8322,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8323,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8324,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8325,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8326,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8327,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8328,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +8329,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8330,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +8331,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8332,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8333,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8334,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8335,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8336,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8337,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +8338,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8339,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8340,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8341,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8342,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8343,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8344,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +8345,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8346,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8347,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8348,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8349,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8350,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8351,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8352,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8353,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8354,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8355,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8356,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +8357,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8358,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8359,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8360,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8361,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8362,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8363,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8364,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8365,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8366,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8367,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8368,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8369,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8370,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8371,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8372,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8373,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8374,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8375,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8376,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8377,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8378,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8379,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8380,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8381,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8382,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8383,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8384,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8385,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8386,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8387,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8388,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8389,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8390,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8391,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8392,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8393,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8394,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8395,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8396,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8397,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8398,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8399,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8400,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8401,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8402,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8403,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8404,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8405,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +8406,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8407,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8408,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8409,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8410,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8411,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8412,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8413,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8414,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8415,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8416,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8417,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8418,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8419,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8420,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +8421,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8422,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8423,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8424,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8425,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8426,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8427,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8428,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8429,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8430,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8431,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8432,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8433,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8434,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8435,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8436,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +8437,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8438,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8439,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8440,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +8441,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8442,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8443,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8444,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8445,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8446,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8447,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8448,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8449,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8450,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8451,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8452,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8453,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8454,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8455,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8456,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8457,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8458,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8459,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8460,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8461,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8462,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8463,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8464,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8465,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8466,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8467,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8468,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8469,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8470,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8471,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +8472,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8473,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8474,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8475,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8476,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8477,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8478,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8479,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8480,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8481,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8482,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8483,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8484,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8485,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8486,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8487,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8488,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8489,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8490,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8491,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8492,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8493,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8494,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8495,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8496,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8497,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8498,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8499,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8500,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8501,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8502,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8503,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +8504,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +8505,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8506,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8507,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8508,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8509,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8510,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8511,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8512,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8513,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8514,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8515,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8516,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8517,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8518,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8519,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8520,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8521,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8522,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8523,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +8524,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +8525,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8526,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8527,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8528,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8529,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8530,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8531,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8532,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8533,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8534,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8535,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8536,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +8537,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8538,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8539,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8540,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8541,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8542,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8543,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8544,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8545,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8546,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8547,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8548,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8549,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8550,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8551,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8552,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +8553,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8554,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8555,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8556,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8557,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8558,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8559,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8560,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8561,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8562,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8563,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8564,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8565,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8566,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8567,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8568,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8569,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8570,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8571,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8572,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8573,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8574,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8575,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +8576,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8577,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8578,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8579,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8580,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8581,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8582,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8583,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8584,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8585,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8586,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8587,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8588,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8589,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8590,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8591,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8592,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8593,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8594,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8595,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8596,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8597,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8598,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8599,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8600,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8601,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8602,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +8603,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8604,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8605,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8606,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8607,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8608,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8609,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8610,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8611,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8612,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8613,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8614,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8615,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8616,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8617,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8618,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8619,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8620,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8621,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8622,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8623,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8624,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8625,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8626,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8627,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8628,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8629,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8630,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8631,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8632,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8633,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8634,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8635,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8636,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8637,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8638,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +8639,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8640,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8641,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8642,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8643,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8644,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8645,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8646,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8647,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8648,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8649,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8650,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8651,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8652,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8653,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8654,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8655,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8656,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8657,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8658,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8659,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8660,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8661,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8662,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8663,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8664,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8665,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8666,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8667,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8668,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +8669,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8670,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8671,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8672,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8673,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8674,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8675,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8676,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8677,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8678,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8679,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8680,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8681,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8682,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8683,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8684,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8685,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8686,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8687,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8688,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8689,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8690,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8691,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8692,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8693,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8694,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8695,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8696,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8697,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8698,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8699,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8700,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8701,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8702,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8703,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8704,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8705,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8706,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8707,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8708,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8709,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8710,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8711,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8712,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8713,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8714,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8715,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8716,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8717,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8718,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8719,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +8720,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8721,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8722,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8723,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8724,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8725,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8726,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8727,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8728,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8729,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8730,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8731,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +8732,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8733,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8734,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8735,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8736,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8737,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8738,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8739,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8740,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +8741,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8742,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8743,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8744,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8745,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +8746,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8747,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8748,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8749,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8750,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8751,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8752,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8753,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8754,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8755,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +8756,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8757,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +8758,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +8759,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8760,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +8761,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8762,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8763,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8764,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8765,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8766,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8767,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8768,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8769,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8770,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8771,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8772,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +8773,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8774,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +8775,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8776,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8777,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8778,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8779,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8780,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8781,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8782,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +8783,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8784,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8785,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8786,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8787,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8788,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8789,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +8790,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8791,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8792,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8793,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8794,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8795,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8796,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8797,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8798,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8799,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8800,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8801,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +8802,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8803,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8804,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8805,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8806,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8807,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8808,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8809,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8810,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8811,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8812,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8813,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8814,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8815,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8816,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8817,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8818,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +8819,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8820,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8821,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8822,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8823,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8824,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8825,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +8826,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8827,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8828,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8829,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +8830,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8831,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8832,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8833,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8834,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8835,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8836,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8837,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8838,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +8839,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8840,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8841,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8842,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8843,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8844,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +8845,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8846,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8847,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8848,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8849,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8850,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8851,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8852,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8853,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8854,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8855,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8856,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8857,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8858,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8859,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8860,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8861,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8862,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8863,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8864,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8865,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8866,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8867,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8868,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8869,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8870,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8871,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8872,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8873,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8874,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8875,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8876,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8877,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8878,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8879,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8880,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8881,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8882,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +8883,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8884,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8885,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8886,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +8887,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8888,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8889,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8890,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +8891,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8892,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8893,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8894,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8895,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +8896,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8897,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8898,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8899,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8900,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +8901,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8902,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8903,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8904,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8905,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8906,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8907,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8908,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8909,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8910,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8911,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8912,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8913,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8914,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8915,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8916,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8917,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8918,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8919,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8920,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8921,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +8922,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8923,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8924,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8925,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8926,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +8927,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8928,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8929,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8930,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8931,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8932,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8933,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8934,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8935,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8936,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +8937,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8938,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8939,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8940,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +8941,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8942,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8943,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8944,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8945,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8946,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8947,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8948,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +8949,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8950,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +8951,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8952,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8953,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +8954,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8955,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8956,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8957,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8958,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8959,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +8960,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +8961,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8962,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8963,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +8964,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8965,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8966,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +8967,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8968,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +8969,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +8970,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8971,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8972,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8973,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8974,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8975,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8976,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8977,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +8978,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8979,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8980,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8981,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +8982,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +8983,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8984,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8985,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +8986,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +8987,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8988,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +8989,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +8990,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +8991,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +8992,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +8993,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +8994,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +8995,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +8996,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +8997,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +8998,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +8999,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9000,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9001,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9002,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9003,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +9004,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9005,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9006,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9007,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9008,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9009,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9010,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9011,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9012,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9013,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9014,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9015,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9016,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9017,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9018,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9019,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9020,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9021,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9022,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9023,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9024,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9025,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9026,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9027,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +9028,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9029,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9030,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9031,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9032,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9033,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9034,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9035,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9036,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9037,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9038,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9039,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9040,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9041,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9042,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +9043,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9044,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9045,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9046,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9047,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9048,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9049,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9050,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9051,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +9052,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9053,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +9054,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9055,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9056,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +9057,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9058,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9059,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9060,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9061,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9062,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9063,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9064,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9065,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9066,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9067,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9068,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9069,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9070,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9071,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9072,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +9073,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9074,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9075,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9076,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9077,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9078,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9079,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +9080,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +9081,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9082,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9083,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9084,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9085,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9086,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9087,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9088,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9089,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9090,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9091,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9092,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +9093,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9094,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9095,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9096,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9097,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9098,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9099,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9100,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9101,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9102,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9103,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9104,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9105,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9106,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9107,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9108,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9109,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9110,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9111,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9112,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9113,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9114,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9115,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9116,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9117,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9118,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9119,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +9120,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9121,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9122,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9123,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9124,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9125,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9126,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9127,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9128,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9129,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9130,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9131,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9132,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9133,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9134,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9135,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9136,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9137,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9138,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9139,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9140,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9141,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9142,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9143,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9144,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9145,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9146,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9147,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9148,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9149,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9150,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9151,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +9152,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9153,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9154,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9155,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9156,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9157,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9158,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9159,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9160,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +9161,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9162,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9163,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9164,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9165,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9166,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9167,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9168,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9169,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9170,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9171,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +9172,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9173,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9174,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9175,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9176,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9177,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9178,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9179,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9180,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9181,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9182,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9183,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9184,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9185,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9186,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9187,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +9188,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9189,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9190,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9191,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9192,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9193,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9194,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9195,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9196,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9197,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9198,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9199,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9200,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9201,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9202,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9203,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9204,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9205,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9206,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9207,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9208,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9209,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9210,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9211,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9212,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9213,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9214,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9215,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9216,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9217,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9218,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9219,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9220,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9221,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9222,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9223,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9224,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9225,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9226,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +9227,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9228,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9229,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9230,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9231,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9232,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9233,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9234,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9235,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +9236,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9237,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9238,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9239,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9240,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9241,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9242,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +9243,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9244,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9245,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9246,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9247,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9248,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9249,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9250,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9251,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9252,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9253,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9254,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9255,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9256,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9257,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9258,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9259,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9260,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9261,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9262,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9263,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9264,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9265,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9266,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9267,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9268,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9269,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9270,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9271,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9272,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9273,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9274,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9275,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9276,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9277,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9278,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9279,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +9280,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9281,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +9282,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9283,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9284,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9285,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9286,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9287,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9288,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9289,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9290,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9291,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9292,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9293,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9294,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9295,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9296,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9297,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9298,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9299,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9300,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9301,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9302,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9303,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9304,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9305,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +9306,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9307,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9308,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9309,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9310,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9311,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9312,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9313,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9314,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9315,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9316,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9317,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9318,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9319,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9320,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9321,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +9322,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9323,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9324,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9325,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9326,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +9327,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9328,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9329,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9330,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9331,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +9332,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9333,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +9334,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9335,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9336,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9337,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9338,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9339,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9340,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9341,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9342,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9343,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9344,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9345,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9346,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +9347,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9348,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9349,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9350,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9351,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9352,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9353,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9354,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9355,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9356,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9357,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9358,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9359,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +9360,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9361,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9362,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9363,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9364,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9365,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9366,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9367,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9368,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9369,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9370,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9371,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9372,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9373,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9374,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9375,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9376,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9377,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9378,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9379,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9380,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9381,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9382,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9383,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9384,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9385,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9386,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9387,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9388,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9389,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9390,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9391,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9392,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9393,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9394,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9395,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9396,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +9397,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9398,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9399,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9400,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9401,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9402,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9403,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9404,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9405,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +9406,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9407,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9408,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9409,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9410,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9411,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9412,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9413,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9414,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9415,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9416,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9417,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9418,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9419,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9420,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9421,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9422,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9423,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9424,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9425,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9426,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9427,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9428,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9429,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9430,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9431,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9432,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9433,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9434,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9435,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9436,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9437,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9438,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9439,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9440,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9441,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9442,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9443,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9444,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9445,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9446,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9447,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9448,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9449,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9450,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9451,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9452,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9453,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9454,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9455,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9456,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9457,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9458,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9459,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9460,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9461,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9462,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9463,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9464,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9465,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9466,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9467,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9468,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9469,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9470,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9471,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9472,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9473,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9474,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9475,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9476,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9477,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9478,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9479,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9480,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9481,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9482,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9483,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9484,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9485,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9486,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9487,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9488,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +9489,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9490,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9491,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9492,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9493,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9494,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9495,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9496,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9497,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9498,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9499,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9500,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9501,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9502,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +9503,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9504,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9505,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9506,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9507,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9508,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9509,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9510,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9511,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9512,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9513,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +9514,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9515,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9516,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9517,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9518,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9519,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9520,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9521,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9522,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9523,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9524,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9525,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +9526,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9527,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9528,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9529,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9530,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9531,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9532,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9533,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9534,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9535,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9536,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9537,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9538,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9539,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9540,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9541,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9542,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9543,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9544,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9545,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9546,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9547,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +9548,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9549,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9550,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9551,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9552,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9553,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9554,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9555,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9556,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9557,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9558,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9559,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9560,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9561,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9562,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9563,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9564,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9565,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9566,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9567,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9568,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9569,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9570,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9571,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9572,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9573,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9574,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9575,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9576,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9577,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9578,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9579,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9580,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +9581,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9582,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9583,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9584,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9585,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9586,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9587,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9588,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9589,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9590,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9591,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9592,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +9593,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9594,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9595,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9596,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9597,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9598,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9599,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +9600,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9601,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9602,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9603,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9604,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9605,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9606,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9607,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9608,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9609,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9610,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9611,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9612,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +9613,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9614,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9615,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9616,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9617,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9618,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9619,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9620,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9621,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9622,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9623,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9624,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9625,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9626,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9627,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9628,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9629,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9630,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9631,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9632,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9633,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9634,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9635,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9636,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9637,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9638,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9639,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9640,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9641,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9642,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9643,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9644,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9645,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9646,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9647,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9648,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9649,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9650,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9651,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9652,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9653,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9654,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9655,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9656,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9657,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9658,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9659,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9660,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9661,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9662,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9663,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9664,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +9665,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9666,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9667,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9668,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9669,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9670,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9671,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9672,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9673,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9674,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9675,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9676,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9677,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9678,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9679,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9680,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9681,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9682,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9683,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9684,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9685,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9686,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9687,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9688,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9689,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9690,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9691,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9692,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9693,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9694,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9695,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9696,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9697,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9698,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9699,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9700,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9701,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9702,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9703,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9704,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9705,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9706,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9707,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9708,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +9709,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9710,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9711,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9712,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +9713,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9714,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9715,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9716,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9717,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9718,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9719,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9720,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9721,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9722,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9723,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +9724,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +9725,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9726,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9727,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9728,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9729,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9730,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9731,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9732,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9733,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9734,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9735,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9736,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9737,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9738,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9739,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9740,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9741,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9742,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9743,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9744,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9745,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9746,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9747,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9748,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9749,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9750,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9751,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9752,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9753,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9754,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9755,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9756,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9757,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9758,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",hard,arrays +9759,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +9760,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9761,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9762,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9763,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9764,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9765,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9766,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9767,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9768,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9769,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9770,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9771,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9772,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9773,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9774,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9775,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",hard,loops +9776,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9777,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +9778,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9779,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9780,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9781,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9782,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9783,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9784,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9785,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9786,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +9787,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9788,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9789,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9790,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9791,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +9792,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +9793,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",hard,strings +9794,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9795,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9796,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9797,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9798,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9799,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9800,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9801,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9802,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9803,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9804,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9805,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9806,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9807,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9808,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9809,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +9810,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9811,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9812,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9813,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9814,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9815,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9816,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +9817,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9818,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9819,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9820,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9821,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9822,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9823,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9824,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9825,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9826,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9827,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9828,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9829,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9830,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9831,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9832,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +9833,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9834,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9835,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9836,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9837,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9838,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9839,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",hard,math +9840,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9841,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9842,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9843,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9844,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9845,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9846,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9847,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9848,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9849,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9850,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9851,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9852,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9853,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9854,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9855,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9856,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9857,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9858,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9859,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",hard,recursion +9860,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9861,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9862,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9863,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9864,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9865,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9866,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9867,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9868,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9869,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9870,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9871,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9872,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9873,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9874,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9875,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9876,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9877,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9878,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9879,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9880,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9881,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9882,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +9883,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +9884,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9885,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9886,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9887,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9888,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9889,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9890,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9891,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9892,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9893,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9894,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9895,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9896,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9897,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9898,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9899,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9900,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",medium,recursion +9901,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9902,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9903,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9904,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9905,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9906,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9907,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9908,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",hard,recursion +9909,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",hard,loops +9910,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9911,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9912,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9913,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9914,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9915,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9916,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9917,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9918,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",easy,strings +9919,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9920,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9921,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9922,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9923,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9924,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9925,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9926,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9927,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9928,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9929,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9930,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9931,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9932,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +9933,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9934,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9935,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9936,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9937,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9938,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9939,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9940,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9941,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9942,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9943,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9944,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9945,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9946,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9947,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9948,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9949,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9950,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9951,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9952,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9953,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9954,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",hard,arrays +9955,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9956,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",medium,math +9957,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9958,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9959,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9960,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9961,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9962,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9963,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9964,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9965,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",medium,recursion +9966,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9967,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9968,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9969,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",hard,strings +9970,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",medium,strings +9971,Write a function that checks if a string is a palindrome.,"function isPalindrome(s) { + return s === s.split('').reverse().join(''); +}",medium,strings +9972,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9973,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9974,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9975,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9976,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",medium,math +9977,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9978,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9979,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9980,Write a function that reverses a string.,"function reverseString(s) { + return s.split('').reverse().join(''); +}",easy,strings +9981,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9982,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9983,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +9984,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9985,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",easy,arrays +9986,Write a recursive function to sum an array.,"function sumArrayRec(arr, index = 0) { + if (index >= arr.length) return 0; + return arr[index] + sumArrayRec(arr, index + 1); +}",easy,recursion +9987,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",medium,arrays +9988,Write a function that checks if a number is prime.,"function isPrime(n) { + if (n <= 1) return false; + for (let i = 2; i * i <= n; i++) { + if (n % i === 0) return false; + } + return true; +}",easy,math +9989,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",easy,math +9990,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",easy,loops +9991,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9992,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9993,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",easy,loops +9994,Write a function that finds even numbers in an array.,"function findEven(arr) { + return arr.filter(num => num % 2 === 0); +}",medium,loops +9995,Write a function that returns the factorial of a number.,"function factorial(n) { + if (n === 0) return 1; + return n * factorial(n - 1); +}",hard,math +9996,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays +9997,Write a function that prints numbers from 1 to 100.,"function printNumbers() { + for (let i = 1; i <= 100; i++) { + console.log(i); + } +}",medium,loops +9998,Write a function that removes duplicates from an array.,"function removeDuplicates(arr) { + return [...new Set(arr)]; +}",medium,arrays +9999,Write a recursive function to compute Fibonacci numbers.,"function fibonacci(n) { + if (n <= 1) return n; + return fibonacci(n - 1) + fibonacci(n - 2); +}",easy,recursion +10000,Write a function that returns the sum of an array.,"function sumArray(arr) { + return arr.reduce((a, b) => a + b, 0); +}",easy,arrays