id
int64 1
10k
| question
stringclasses 10
values | solution
stringclasses 10
values | difficulty
stringclasses 3
values | topic
stringclasses 5
values |
|---|---|---|---|---|
2,701
|
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,702
|
Write a function that checks if a string is a palindrome.
|
function isPalindrome(s) {
return s === s.split('').reverse().join('');
}
|
medium
|
strings
|
2,703
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
easy
|
loops
|
2,704
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
hard
|
loops
|
2,705
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
easy
|
loops
|
2,706
|
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,707
|
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,708
|
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,709
|
Write a function that reverses a string.
|
function reverseString(s) {
return s.split('').reverse().join('');
}
|
easy
|
strings
|
2,710
|
Write a function that checks if a string is a palindrome.
|
function isPalindrome(s) {
return s === s.split('').reverse().join('');
}
|
easy
|
strings
|
2,711
|
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,712
|
Write a function that returns the sum of an array.
|
function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
}
|
easy
|
arrays
|
2,713
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
easy
|
loops
|
2,714
|
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,715
|
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,716
|
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,717
|
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,718
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
medium
|
loops
|
2,719
|
Write a function that returns the sum of an array.
|
function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
}
|
easy
|
arrays
|
2,720
|
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,721
|
Write a function that reverses a string.
|
function reverseString(s) {
return s.split('').reverse().join('');
}
|
medium
|
strings
|
2,722
|
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,723
|
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,724
|
Write a function that reverses a string.
|
function reverseString(s) {
return s.split('').reverse().join('');
}
|
easy
|
strings
|
2,725
|
Write a function that checks if a string is a palindrome.
|
function isPalindrome(s) {
return s === s.split('').reverse().join('');
}
|
easy
|
strings
|
2,726
|
Write a function that reverses a string.
|
function reverseString(s) {
return s.split('').reverse().join('');
}
|
easy
|
strings
|
2,727
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
easy
|
arrays
|
2,728
|
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,729
|
Write a function that checks if a string is a palindrome.
|
function isPalindrome(s) {
return s === s.split('').reverse().join('');
}
|
medium
|
strings
|
2,730
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
easy
|
loops
|
2,731
|
Write a function that reverses a string.
|
function reverseString(s) {
return s.split('').reverse().join('');
}
|
easy
|
strings
|
2,732
|
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,733
|
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,734
|
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,735
|
Write a function that reverses a string.
|
function reverseString(s) {
return s.split('').reverse().join('');
}
|
hard
|
strings
|
2,736
|
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,737
|
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,738
|
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,739
|
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,740
|
Write a function that returns the sum of an array.
|
function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
}
|
easy
|
arrays
|
2,741
|
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,742
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
easy
|
loops
|
2,743
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
medium
|
loops
|
2,744
|
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,745
|
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,746
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
easy
|
loops
|
2,747
|
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,748
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
medium
|
arrays
|
2,749
|
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,750
|
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,751
|
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,752
|
Write a function that reverses a string.
|
function reverseString(s) {
return s.split('').reverse().join('');
}
|
hard
|
strings
|
2,753
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
hard
|
arrays
|
2,754
|
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,755
|
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,756
|
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,757
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
easy
|
arrays
|
2,758
|
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,759
|
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,760
|
Write a function that reverses a string.
|
function reverseString(s) {
return s.split('').reverse().join('');
}
|
easy
|
strings
|
2,761
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
easy
|
arrays
|
2,762
|
Write a function that checks if a string is a palindrome.
|
function isPalindrome(s) {
return s === s.split('').reverse().join('');
}
|
hard
|
strings
|
2,763
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
hard
|
loops
|
2,764
|
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,765
|
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,766
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
medium
|
arrays
|
2,767
|
Write a function that returns the sum of an array.
|
function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
}
|
medium
|
arrays
|
2,768
|
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,769
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
easy
|
arrays
|
2,770
|
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,771
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
medium
|
arrays
|
2,772
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
medium
|
arrays
|
2,773
|
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,774
|
Write a function that checks if a string is a palindrome.
|
function isPalindrome(s) {
return s === s.split('').reverse().join('');
}
|
easy
|
strings
|
2,775
|
Write a function that returns the sum of an array.
|
function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
}
|
easy
|
arrays
|
2,776
|
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,777
|
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,778
|
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,779
|
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,780
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
easy
|
loops
|
2,781
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
easy
|
loops
|
2,782
|
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,783
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
easy
|
arrays
|
2,784
|
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,785
|
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,786
|
Write a function that returns the sum of an array.
|
function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
}
|
medium
|
arrays
|
2,787
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
easy
|
arrays
|
2,788
|
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,789
|
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,790
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
easy
|
arrays
|
2,791
|
Write a function that removes duplicates from an array.
|
function removeDuplicates(arr) {
return [...new Set(arr)];
}
|
easy
|
arrays
|
2,792
|
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,793
|
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,794
|
Write a function that reverses a string.
|
function reverseString(s) {
return s.split('').reverse().join('');
}
|
easy
|
strings
|
2,795
|
Write a function that checks if a string is a palindrome.
|
function isPalindrome(s) {
return s === s.split('').reverse().join('');
}
|
easy
|
strings
|
2,796
|
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,797
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
hard
|
loops
|
2,798
|
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,799
|
Write a function that returns the sum of an array.
|
function sumArray(arr) {
return arr.reduce((a, b) => a + b, 0);
}
|
easy
|
arrays
|
2,800
|
Write a function that finds even numbers in an array.
|
function findEven(arr) {
return arr.filter(num => num % 2 === 0);
}
|
medium
|
loops
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.