id
int64 1
10k
| question
stringclasses 10
values | solution
stringclasses 10
values | difficulty
stringclasses 3
values | topic
stringclasses 5
values |
|---|---|---|---|---|
2,101 | Write a function that checks if a number is prime. | 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,102 | Write a recursive function 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,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 |
2,104 | Write a 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,105 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
2,106 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,107 | 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,108 | 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,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 |
2,110 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | medium | strings |
2,111 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
2,112 | Write a function that checks if a number is prime. | function isPrime(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,113 | 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,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;
} | easy | math |
2,115 | Write 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,116 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | hard | loops |
2,117 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,118 | Write a function that checks if a number is prime. | function isPrime(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,119 | Write a recursive function 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,120 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | hard | arrays |
2,121 | 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,122 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | hard | strings |
2,123 | Write 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,124 | Write a recursive function 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,125 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
2,126 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
2,127 | 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,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);
} | medium | recursion |
2,129 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | medium | strings |
2,130 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | medium | arrays |
2,131 | Write 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,132 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,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 |
2,134 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
2,135 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,136 | Write 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,137 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | medium | strings |
2,138 | 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 |
2,139 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | medium | strings |
2,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);
} | medium | recursion |
2,141 | Write 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,142 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
2,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 |
2,144 | Write a function that checks if a number is prime. | function isPrime(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,145 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,146 | 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 |
2,147 | Write a function that checks if a number is prime. | function isPrime(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,148 | Write 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,149 | Write a recursive function 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,150 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | medium | loops |
2,151 | 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,152 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,153 | 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,154 | Write 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,155 | Write 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,156 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,157 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | medium | strings |
2,158 | Write 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,159 | Write a function that checks if a number is prime. | function isPrime(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,160 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | hard | loops |
2,161 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | medium | arrays |
2,162 | Write 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,163 | Write a recursive function 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,164 | Write 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,165 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
2,166 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,167 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,168 | 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,169 | Write a function that checks if a number is prime. | function isPrime(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,170 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
2,171 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,172 | Write 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,173 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
2,174 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,175 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,176 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | medium | arrays |
2,177 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,178 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
2,179 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,180 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
2,181 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
2,182 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | medium | strings |
2,183 | Write 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,184 | Write 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,185 | 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,186 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
2,187 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
2,188 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
2,189 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,190 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | hard | arrays |
2,191 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,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 |
2,193 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,194 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,195 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
2,196 | Write 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,197 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
2,198 | Write a recursive function 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,199 | Write 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,200 | 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.