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