id
int64 1
10k
| question
stringclasses 10
values | solution
stringclasses 10
values | difficulty
stringclasses 3
values | topic
stringclasses 5
values |
|---|---|---|---|---|
301 | 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 |
302 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
303 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
304 | 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 |
305 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
306 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | medium | loops |
307 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | medium | strings |
308 | 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 |
309 | 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 |
310 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | medium | loops |
311 | 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 |
312 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
313 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | medium | loops |
314 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | easy | loops |
315 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | hard | arrays |
316 | 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 |
317 | 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 |
318 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | medium | loops |
319 | 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 |
320 | 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 |
321 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | easy | strings |
322 | 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 |
323 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
324 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | easy | loops |
325 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | easy | loops |
326 | 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 |
327 | 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 |
328 | 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 |
329 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
330 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | medium | loops |
331 | 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 |
332 | 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 |
333 | 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 |
334 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
335 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
336 | 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 |
337 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | medium | arrays |
338 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | hard | loops |
339 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
340 | 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 |
341 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | hard | arrays |
342 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | medium | strings |
343 | 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 |
344 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
345 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | medium | arrays |
346 | 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 |
347 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | easy | loops |
348 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
349 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | medium | strings |
350 | 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 |
351 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | medium | strings |
352 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
353 | 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 |
354 | 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 |
355 | 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 |
356 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
357 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
358 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
359 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
360 | 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 |
361 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
362 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | easy | loops |
363 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | hard | loops |
364 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
365 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
366 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
367 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | medium | strings |
368 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | medium | loops |
369 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
370 | 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 |
371 | 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 |
372 | 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 |
373 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | easy | strings |
374 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
375 | Write a function that prints numbers from 1 to 100. | function printNumbers() {
for (let i = 1; i <= 100; i++) {
console.log(i);
}
} | medium | loops |
376 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | medium | loops |
377 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | medium | strings |
378 | 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 |
379 | 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 |
380 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | hard | loops |
381 | 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 |
382 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | easy | arrays |
383 | 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 |
384 | Write a function that reverses a string. | function reverseString(s) {
return s.split('').reverse().join('');
} | medium | strings |
385 | Write a function that checks if a string is a palindrome. | function isPalindrome(s) {
return s === s.split('').reverse().join('');
} | medium | strings |
386 | 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 |
387 | 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 |
388 | Write a function that returns the sum of an array. | function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
} | easy | arrays |
389 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
390 | 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 |
391 | 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 |
392 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
393 | 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 |
394 | 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 |
395 | 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 |
396 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | hard | arrays |
397 | Write a function that finds even numbers in an array. | function findEven(arr) {
return arr.filter(num => num % 2 === 0);
} | easy | loops |
398 | Write a function that removes duplicates from an array. | function removeDuplicates(arr) {
return [...new Set(arr)];
} | medium | arrays |
399 | 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 |
400 | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.