JavaScript Compiler (Editor)
Programs in JS
1. Sum of Two Numbers
function sumOfTwoNumbers(a, b) {
return a + b;
}
console.log(sumOfTwoNumbers(5, 3)); // Output: 8
2. Reverse a String
function reverseString(str) {
return str.split('').reverse().join('');
}
console.log(reverseString("hello")); // Output: "olleh"
3. Factorial of a Number
function factorial(n) {
if (n === 0 || n === 1) {
return 1;
} else {
return n * factorial(n - 1);
}
}
console.log(factorial(5)); // Output: 120
4. Check Palindrome
function isPalindrome(str) {
return str === str.split('').reverse().join('');
}
console.log(isPalindrome("racecar")); // Output: true
5. Find Maximum Number in an Array
function findMax(arr) {
let max = arr[0];
for (let i = 1; i < arr.length; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return max;
}
console.log(findMax([3, 7, 2, 10, 5])); // Output: 10
6. Check Prime Number
function isPrime(num) {
if (num <= 1) return false;
for (let i = 2; i <= Math.sqrt(num); i++) {
if (num % i === 0) return false;
}
return true;
}
console.log(isPrime(11)); // Output: true
7. Calculate Fibonacci Sequence
function fibonacci(n) {
let fib = [0, 1];
for (let i = 2; i <= n; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
return fib.slice(0, n + 1);
}
console.log(fibonacci(5)); // Output: [0, 1, 1, 2, 3, 5]
8. Remove Duplicates from Array
function removeDuplicates(arr) {
return arr.filter((value, index, self) => self.indexOf(value) === index);
}
console.log(removeDuplicates([1, 2, 2, 3, 4, 4, 5])); // Output: [1, 2, 3, 4, 5]
9. Check Armstrong Number
function isArmstrong(num) {
let sum = 0;
let temp = num;
const digits = String(num).length;
while (temp > 0) {
const digit = temp % 10;
sum += digit ** digits;
temp = Math.floor(temp / 10);
}
return num === sum;
}
console.log(isArmstrong(153)); // Output: true
10. Calculate Factorial Using Recursion
function factorial(n) {
if (n === 0 || n === 1) {
return 1;
} else {
return n * factorial(n - 1);
}
}
console.log(factorial(5)); // Output: 120