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