id
int64
1
10k
question
stringclasses
10 values
solution
stringclasses
10 values
difficulty
stringclasses
3 values
topic
stringclasses
5 values
9,401
Write a recursive function to sum an array.
function sumArrayRec(arr, index = 0) { if (index >= arr.length) return 0; return arr[index] + sumArrayRec(arr, index + 1); }
medium
recursion
9,402
Write a function that finds even numbers in an array.
function findEven(arr) { return arr.filter(num => num % 2 === 0); }
easy
loops
9,403
Write a function that finds even numbers in an array.
function findEven(arr) { return arr.filter(num => num % 2 === 0); }
easy
loops
9,404
Write a function that returns the factorial of a number.
function factorial(n) { if (n === 0) return 1; return n * factorial(n - 1); }
medium
math
9,405
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
9,406
Write a function that checks if a number is prime.
function isPrime(n) { if (n <= 1) return false; for (let i = 2; i * i <= n; i++) { if (n % i === 0) return false; } return true; }
medium
math
9,407
Write a function that finds even numbers in an array.
function findEven(arr) { return arr.filter(num => num % 2 === 0); }
medium
loops
9,408
Write a function that returns the factorial of a number.
function factorial(n) { if (n === 0) return 1; return n * factorial(n - 1); }
easy
math
9,409
Write a function that checks if a string is a palindrome.
function isPalindrome(s) { return s === s.split('').reverse().join(''); }
easy
strings
9,410
Write a function that prints numbers from 1 to 100.
function printNumbers() { for (let i = 1; i <= 100; i++) { console.log(i); } }
medium
loops
9,411
Write a function that returns the sum of an array.
function sumArray(arr) { return arr.reduce((a, b) => a + b, 0); }
easy
arrays
9,412
Write a function that reverses a string.
function reverseString(s) { return s.split('').reverse().join(''); }
easy
strings
9,413
Write a recursive function to compute Fibonacci numbers.
function fibonacci(n) { if (n <= 1) return n; return fibonacci(n - 1) + fibonacci(n - 2); }
medium
recursion
9,414
Write a function that removes duplicates from an array.
function removeDuplicates(arr) { return [...new Set(arr)]; }
hard
arrays
9,415
Write a recursive function to compute Fibonacci numbers.
function fibonacci(n) { if (n <= 1) return n; return fibonacci(n - 1) + fibonacci(n - 2); }
easy
recursion
9,416
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,417
Write a function that checks if a string is a palindrome.
function isPalindrome(s) { return s === s.split('').reverse().join(''); }
medium
strings
9,418
Write a function that returns the factorial of a number.
function factorial(n) { if (n === 0) return 1; return n * factorial(n - 1); }
easy
math
9,419
Write a function that removes duplicates from an array.
function removeDuplicates(arr) { return [...new Set(arr)]; }
easy
arrays
9,420
Write a function that checks if a string is a palindrome.
function isPalindrome(s) { return s === s.split('').reverse().join(''); }
medium
strings
9,421
Write a function that returns the factorial of a number.
function factorial(n) { if (n === 0) return 1; return n * factorial(n - 1); }
easy
math
9,422
Write a function that reverses a string.
function reverseString(s) { return s.split('').reverse().join(''); }
medium
strings
9,423
Write a recursive function to sum an array.
function sumArrayRec(arr, index = 0) { if (index >= arr.length) return 0; return arr[index] + sumArrayRec(arr, index + 1); }
easy
recursion
9,424
Write a function that reverses a string.
function reverseString(s) { return s.split('').reverse().join(''); }
easy
strings
9,425
Write a function that reverses a string.
function reverseString(s) { return s.split('').reverse().join(''); }
medium
strings
9,426
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,427
Write a recursive function to sum an array.
function sumArrayRec(arr, index = 0) { if (index >= arr.length) return 0; return arr[index] + sumArrayRec(arr, index + 1); }
easy
recursion
9,428
Write a function that returns the factorial of a number.
function factorial(n) { if (n === 0) return 1; return n * factorial(n - 1); }
medium
math
9,429
Write a function that returns the factorial of a number.
function factorial(n) { if (n === 0) return 1; return n * factorial(n - 1); }
easy
math
9,430
Write a function that reverses a string.
function reverseString(s) { return s.split('').reverse().join(''); }
easy
strings
9,431
Write a function that checks if a string is a palindrome.
function isPalindrome(s) { return s === s.split('').reverse().join(''); }
easy
strings
9,432
Write a recursive function to sum an array.
function sumArrayRec(arr, index = 0) { if (index >= arr.length) return 0; return arr[index] + sumArrayRec(arr, index + 1); }
easy
recursion
9,433
Write a function that returns the factorial of a number.
function factorial(n) { if (n === 0) return 1; return n * factorial(n - 1); }
easy
math
9,434
Write a function that removes duplicates from an array.
function removeDuplicates(arr) { return [...new Set(arr)]; }
easy
arrays
9,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
9,436
Write a function that checks if a number is prime.
function isPrime(n) { if (n <= 1) return false; for (let i = 2; i * i <= n; i++) { if (n % i === 0) return false; } return true; }
easy
math
9,437
Write a function that returns the sum of an array.
function sumArray(arr) { return arr.reduce((a, b) => a + b, 0); }
easy
arrays
9,438
Write a function that returns the sum of an array.
function sumArray(arr) { return arr.reduce((a, b) => a + b, 0); }
easy
arrays
9,439
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,440
Write a recursive function to compute Fibonacci numbers.
function fibonacci(n) { if (n <= 1) return n; return fibonacci(n - 1) + fibonacci(n - 2); }
easy
recursion
9,441
Write a recursive function to sum an array.
function sumArrayRec(arr, index = 0) { if (index >= arr.length) return 0; return arr[index] + sumArrayRec(arr, index + 1); }
medium
recursion
9,442
Write a function that prints numbers from 1 to 100.
function printNumbers() { for (let i = 1; i <= 100; i++) { console.log(i); } }
medium
loops
9,443
Write a recursive function to compute Fibonacci numbers.
function fibonacci(n) { if (n <= 1) return n; return fibonacci(n - 1) + fibonacci(n - 2); }
medium
recursion
9,444
Write a recursive function to sum an array.
function sumArrayRec(arr, index = 0) { if (index >= arr.length) return 0; return arr[index] + sumArrayRec(arr, index + 1); }
easy
recursion
9,445
Write a recursive function to sum an array.
function sumArrayRec(arr, index = 0) { if (index >= arr.length) return 0; return arr[index] + sumArrayRec(arr, index + 1); }
medium
recursion
9,446
Write a function that finds even numbers in an array.
function findEven(arr) { return arr.filter(num => num % 2 === 0); }
easy
loops
9,447
Write a function that checks if a number is prime.
function isPrime(n) { if (n <= 1) return false; for (let i = 2; i * i <= n; i++) { if (n % i === 0) return false; } return true; }
easy
math
9,448
Write a function that returns the sum of an array.
function sumArray(arr) { return arr.reduce((a, b) => a + b, 0); }
easy
arrays
9,449
Write a recursive function to sum an array.
function sumArrayRec(arr, index = 0) { if (index >= arr.length) return 0; return arr[index] + sumArrayRec(arr, index + 1); }
easy
recursion
9,450
Write a function that removes duplicates from an array.
function removeDuplicates(arr) { return [...new Set(arr)]; }
medium
arrays
9,451
Write a function that checks if a number is prime.
function isPrime(n) { if (n <= 1) return false; for (let i = 2; i * i <= n; i++) { if (n % i === 0) return false; } return true; }
medium
math
9,452
Write a function that reverses a string.
function reverseString(s) { return s.split('').reverse().join(''); }
medium
strings
9,453
Write a function that checks if a number is prime.
function isPrime(n) { if (n <= 1) return false; for (let i = 2; i * i <= n; i++) { if (n % i === 0) return false; } return true; }
easy
math
9,454
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,455
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
9,456
Write a function that finds even numbers in an array.
function findEven(arr) { return arr.filter(num => num % 2 === 0); }
easy
loops
9,457
Write a function that finds even numbers in an array.
function findEven(arr) { return arr.filter(num => num % 2 === 0); }
medium
loops
9,458
Write a function that reverses a string.
function reverseString(s) { return s.split('').reverse().join(''); }
easy
strings
9,459
Write a function that reverses a string.
function reverseString(s) { return s.split('').reverse().join(''); }
medium
strings
9,460
Write a function that returns the sum of an array.
function sumArray(arr) { return arr.reduce((a, b) => a + b, 0); }
easy
arrays
9,461
Write a function that checks if a number is prime.
function isPrime(n) { if (n <= 1) return false; for (let i = 2; i * i <= n; i++) { if (n % i === 0) return false; } return true; }
easy
math
9,462
Write a function that finds even numbers in an array.
function findEven(arr) { return arr.filter(num => num % 2 === 0); }
easy
loops
9,463
Write a function that checks if a string is a palindrome.
function isPalindrome(s) { return s === s.split('').reverse().join(''); }
medium
strings
9,464
Write a function that returns the factorial of a number.
function factorial(n) { if (n === 0) return 1; return n * factorial(n - 1); }
medium
math
9,465
Write a function that returns the factorial of a number.
function factorial(n) { if (n === 0) return 1; return n * factorial(n - 1); }
easy
math
9,466
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,467
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,468
Write a recursive function to compute Fibonacci numbers.
function fibonacci(n) { if (n <= 1) return n; return fibonacci(n - 1) + fibonacci(n - 2); }
easy
recursion
9,469
Write a function that checks if a string is a palindrome.
function isPalindrome(s) { return s === s.split('').reverse().join(''); }
easy
strings
9,470
Write a function that reverses a string.
function reverseString(s) { return s.split('').reverse().join(''); }
easy
strings
9,471
Write a function that finds even numbers in an array.
function findEven(arr) { return arr.filter(num => num % 2 === 0); }
medium
loops
9,472
Write a function that returns the factorial of a number.
function factorial(n) { if (n === 0) return 1; return n * factorial(n - 1); }
easy
math
9,473
Write a recursive function to compute Fibonacci numbers.
function fibonacci(n) { if (n <= 1) return n; return fibonacci(n - 1) + fibonacci(n - 2); }
easy
recursion
9,474
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
9,475
Write a recursive function to compute Fibonacci numbers.
function fibonacci(n) { if (n <= 1) return n; return fibonacci(n - 1) + fibonacci(n - 2); }
medium
recursion
9,476
Write a function that finds even numbers in an array.
function findEven(arr) { return arr.filter(num => num % 2 === 0); }
easy
loops
9,477
Write a function that checks if a string is a palindrome.
function isPalindrome(s) { return s === s.split('').reverse().join(''); }
medium
strings
9,478
Write a function that finds even numbers in an array.
function findEven(arr) { return arr.filter(num => num % 2 === 0); }
easy
loops
9,479
Write a recursive function to compute Fibonacci numbers.
function fibonacci(n) { if (n <= 1) return n; return fibonacci(n - 1) + fibonacci(n - 2); }
medium
recursion
9,480
Write a function that checks if a string is a palindrome.
function isPalindrome(s) { return s === s.split('').reverse().join(''); }
easy
strings
9,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
9,482
Write a function that returns the sum of an array.
function sumArray(arr) { return arr.reduce((a, b) => a + b, 0); }
easy
arrays
9,483
Write a recursive function to compute Fibonacci numbers.
function fibonacci(n) { if (n <= 1) return n; return fibonacci(n - 1) + fibonacci(n - 2); }
easy
recursion
9,484
Write a function that checks if a number is prime.
function isPrime(n) { if (n <= 1) return false; for (let i = 2; i * i <= n; i++) { if (n % i === 0) return false; } return true; }
easy
math
9,485
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,486
Write a function that prints numbers from 1 to 100.
function printNumbers() { for (let i = 1; i <= 100; i++) { console.log(i); } }
medium
loops
9,487
Write a recursive function to sum an array.
function sumArrayRec(arr, index = 0) { if (index >= arr.length) return 0; return arr[index] + sumArrayRec(arr, index + 1); }
easy
recursion
9,488
Write a function that finds even numbers in an array.
function findEven(arr) { return arr.filter(num => num % 2 === 0); }
hard
loops
9,489
Write a recursive function to compute Fibonacci numbers.
function fibonacci(n) { if (n <= 1) return n; return fibonacci(n - 1) + fibonacci(n - 2); }
easy
recursion
9,490
Write a function that returns the sum of an array.
function sumArray(arr) { return arr.reduce((a, b) => a + b, 0); }
easy
arrays
9,491
Write a function that checks if a string is a palindrome.
function isPalindrome(s) { return s === s.split('').reverse().join(''); }
easy
strings
9,492
Write a function that reverses a string.
function reverseString(s) { return s.split('').reverse().join(''); }
easy
strings
9,493
Write a function that returns the factorial of a number.
function factorial(n) { if (n === 0) return 1; return n * factorial(n - 1); }
medium
math
9,494
Write a function that removes duplicates from an array.
function removeDuplicates(arr) { return [...new Set(arr)]; }
medium
arrays
9,495
Write a function that reverses a string.
function reverseString(s) { return s.split('').reverse().join(''); }
easy
strings
9,496
Write a function that returns the sum of an array.
function sumArray(arr) { return arr.reduce((a, b) => a + b, 0); }
easy
arrays
9,497
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
9,498
Write a function that checks if a string is a palindrome.
function isPalindrome(s) { return s === s.split('').reverse().join(''); }
easy
strings
9,499
Write a recursive function to sum an array.
function sumArrayRec(arr, index = 0) { if (index >= arr.length) return 0; return arr[index] + sumArrayRec(arr, index + 1); }
easy
recursion
9,500
Write a function that prints numbers from 1 to 100.
function printNumbers() { for (let i = 1; i <= 100; i++) { console.log(i); } }
hard
loops