id
int64 1
10k
| question
stringclasses 10
values | solution
stringclasses 10
values | difficulty
stringclasses 3
values | topic
stringclasses 5
values |
|---|---|---|---|---|
5,501 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
5,502 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
5,503 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
5,504 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | medium | math |
5,505 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | medium | recursion |
5,506 | Write a function that checks if a number is prime. | function isPrime(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,507 | 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 |
5,508 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
5,509 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | medium | recursion |
5,510 | Write a function that checks if a number is prime. | function isPrime(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,511 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | easy | loops |
5,512 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | easy | math |
5,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 |
5,514 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | medium | recursion |
5,515 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | easy | math |
5,516 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | easy | recursion |
5,517 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
5,518 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
5,519 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
5,520 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | medium | recursion |
5,521 | Write a function that checks if a number is prime. | function isPrime(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,522 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | medium | arrays |
5,523 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
5,524 | Write a function that checks if a number is prime. | function isPrime(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,525 | 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 |
5,526 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | easy | recursion |
5,527 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | medium | recursion |
5,528 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | easy | recursion |
5,529 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
5,530 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
5,531 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
5,532 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | medium | loops |
5,533 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
5,534 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | easy | loops |
5,535 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | easy | recursion |
5,536 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | medium | strings |
5,537 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | medium | recursion |
5,538 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
5,539 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
5,540 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
5,541 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
5,542 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
5,543 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
5,544 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
5,545 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | medium | loops |
5,546 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | hard | loops |
5,547 | Write a function that checks if a number is prime. | function isPrime(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,548 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | easy | loops |
5,549 | Write a function that checks if a number is prime. | function isPrime(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,550 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
5,551 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | easy | math |
5,552 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | medium | strings |
5,553 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
5,554 | Write a function that checks if a number is prime. | function isPrime(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,555 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
5,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 |
5,557 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
5,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 |
5,559 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | hard | strings |
5,560 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | medium | math |
5,561 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | easy | recursion |
5,562 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
5,563 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
5,564 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
5,565 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
5,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);
} | easy | recursion |
5,567 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | easy | recursion |
5,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;
} | hard | math |
5,569 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | medium | loops |
5,570 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
5,571 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
5,572 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | medium | arrays |
5,573 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | easy | recursion |
5,574 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
5,575 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | medium | math |
5,576 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
5,577 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | medium | recursion |
5,578 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | medium | arrays |
5,579 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
5,580 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | easy | recursion |
5,581 | Write a function that checks if a number is prime. | function isPrime(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,582 | Write a function that checks if a number is prime. | function isPrime(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,583 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
5,584 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
5,585 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | easy | loops |
5,586 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
5,587 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | easy | math |
5,588 | Write a function that checks if a number is prime. | function isPrime(n) {
if (n <= 1) return false;
for (let i = 2; i * i <= n; i++) {
if (n % i === 0) return false;
}
return true;
} | medium | math |
5,589 | 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 |
5,590 | 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 |
5,591 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
5,592 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
5,593 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | medium | arrays |
5,594 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
5,595 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | easy | recursion |
5,596 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | easy | recursion |
5,597 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
5,598 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | hard | loops |
5,599 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
5,600 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | medium | math |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.