id
int64 1
10k
| question
stringclasses 10
values | solution
stringclasses 10
values | difficulty
stringclasses 3
values | topic
stringclasses 5
values |
|---|---|---|---|---|
2,601 | 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,602 | 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 |
2,603 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | easy | recursion |
2,604 | Write a function that checks if a number is prime. | function isPrime(n) {
if (n <= 1) return false;
for (let i = 2; i * i <= n; i++) {
if (n % i === 0) return false;
}
return true;
} | easy | math |
2,605 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | hard | strings |
2,606 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | hard | loops |
2,607 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | medium | strings |
2,608 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,609 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
2,610 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
2,611 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | medium | math |
2,612 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,613 | Write a function that checks if a number is prime. | function isPrime(n) {
if (n <= 1) return false;
for (let i = 2; i * i <= n; i++) {
if (n % i === 0) return false;
}
return true;
} | easy | math |
2,614 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,615 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | medium | strings |
2,616 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,617 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,618 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | easy | recursion |
2,619 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
2,620 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | hard | strings |
2,621 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | medium | arrays |
2,622 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | medium | strings |
2,623 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
2,624 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,625 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,626 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
2,627 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
2,628 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,629 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | medium | strings |
2,630 | 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,631 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
2,632 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
2,633 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | medium | recursion |
2,634 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,635 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | medium | loops |
2,636 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
2,637 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,638 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | medium | loops |
2,639 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,640 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,641 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,642 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,643 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | easy | math |
2,644 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
2,645 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,646 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | medium | recursion |
2,647 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | hard | loops |
2,648 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | medium | loops |
2,649 | Write a function that checks if a number is prime. | function isPrime(n) {
if (n <= 1) return false;
for (let i = 2; i * i <= n; i++) {
if (n % i === 0) return false;
}
return true;
} | easy | math |
2,650 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
2,651 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | hard | loops |
2,652 | Write a 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 |
2,653 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,654 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | medium | loops |
2,655 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | easy | recursion |
2,656 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | medium | strings |
2,657 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
2,658 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | medium | recursion |
2,659 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | easy | math |
2,660 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | medium | loops |
2,661 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,662 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,663 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,664 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | easy | recursion |
2,665 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,666 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | easy | math |
2,667 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | medium | arrays |
2,668 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,669 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | medium | loops |
2,670 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,671 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
2,672 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | hard | strings |
2,673 | Write a function that checks if a number is prime. | function isPrime(n) {
if (n <= 1) return false;
for (let i = 2; i * i <= n; i++) {
if (n % i === 0) return false;
}
return true;
} | easy | math |
2,674 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,675 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | hard | strings |
2,676 | Write a function that checks if a number is prime. | function isPrime(n) {
if (n <= 1) return false;
for (let i = 2; i * i <= n; i++) {
if (n % i === 0) return false;
}
return true;
} | medium | math |
2,677 | Write a recursive function to sum an array. | function sumArrayRec(arr, index = 0) {
if (index >= arr.length) return 0;
return arr[index] + sumArrayRec(arr, index + 1);
} | medium | recursion |
2,678 | Write a function that checks if a number is prime. | function isPrime(n) {
if (n <= 1) return false;
for (let i = 2; i * i <= n; i++) {
if (n % i === 0) return false;
}
return true;
} | medium | math |
2,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 |
2,680 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
2,681 | 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 |
2,682 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | hard | loops |
2,683 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,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;
} | hard | math |
2,685 | Write a function that checks if a number is prime. | function isPrime(n) {
if (n <= 1) return false;
for (let i = 2; i * i <= n; i++) {
if (n % i === 0) return false;
}
return true;
} | medium | math |
2,686 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,687 | Write a 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 |
2,688 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,689 | Write a function that checks if a number is prime. | function isPrime(n) {
if (n <= 1) return false;
for (let i = 2; i * i <= n; i++) {
if (n % i === 0) return false;
}
return true;
} | medium | math |
2,690 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | medium | arrays |
2,691 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
2,692 | Write a function that returns the factorial of a number. | function factorial(n) {
if (n === 0) return 1;
return n * factorial(n - 1);
} | medium | math |
2,693 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | medium | strings |
2,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 |
2,695 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | easy | recursion |
2,696 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | easy | recursion |
2,697 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | medium | loops |
2,698 | 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,699 | Write a recursive function to compute Fibonacci numbers. | function fibonacci(n) {
if (n <= 1) return n;
return fibonacci(n - 1) + fibonacci(n - 2);
} | easy | recursion |
2,700 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.