Disarium Number − All those numbers which satisfy the following equation are dDisarium number −xy...z = x^1 + y^2 + ... + z^nWhere n is the number of digits in the number.For example −175 is a disarium number be: 175 = 1^1 + 7^2 + 5^3 = 1 + 49 + 125 = 175Let’s write the code for this function −ExampleFollowing is the code −const num = 175; const isDisarium = num => {    const res = String(num)    .split("")    .reduce((acc, val, ind) => {       acc += Math.pow(+val, ind+1);       return acc;    }, 0);    return res === num; }; console.log(isDisarium(num)); console.log(isDisarium(32)); console.log(isDisarium(4334));OutputThe output in the console: −true false false

We are required to write a JavaScript function that takes in a number (representing the number of days) and returns an object with three properties, namely −weeks, months, years, daysAnd the properties should have proper values of these four properties that can be made from the number of days. We should not consider leap years here and consider all years to have 365 days.For example −If the input is 738, then the output should be −const output = {    years: 2,    months: 0,    weeks: 1,    days: 1 }ExampleLet’s write the code for this function −const days ... Read More

A number is called Armstrong number if the following equation holds true for that number −xy..z = x^n + y^n+.....+ z^nWhere, n denotes the number of digits in the numberFor example − 370 is an Armstrong number because −3^3 + 7^3 + 0^3 = 27 + 343 + 0 = 370We are required to write a JavaScript function that takes in two numbers, a range, and returns all the numbers between them that are Armstrong numbers (including them, if they are Armstrong).ExampleLet’s write the code for this function −const isArmstrong = number => {    let num = number;   ... Read More

Circumference of a circle is given by −pi * (r * r)And area of a circle is given by −2 * pi * rWhere r is the radius of the circle.We are required to write a JavaScript function that takes in the radius of circle and calculates the difference between the area and the circumference of the circleExampleLet’s write the code for this function −const rad = 6; const circleDifference = radius => {    const area = Math.PI * (radius * radius);    const circumference = 2 * Math.PI * radius;    const diff = Math.abs(area - circumference);   ... Read More

We are required to write a JavaScript function that takes in three or more numbers and returns the largest of those numbers.For example: If the input numbers are −4, 6, 7, 2, 3Then the output should be −7ExampleLet’s write the code for this function −// using spread operator to cater any number of elements const findGreatest = (...nums) => {    let max = -Infinity;    for(let i = 0; i < nums.length; i++){       if(nums[i] > max){          max = nums[i];       };    };    return max; }; console.log(findGreatest(5, 6, 3, 5, 7, 5));OutputThe output in the console −7

We are required to write a JavaScript function that takes in an array of literals and sorts it using bubble sort. In Bubble Sort, each pair of adjacent elements is compared and the elements are swapped if they are not in order.ExampleLet’s write the code for this function −const arr = [4, 56, 4, 23, 8, 4, 23, 2, 7, 8, 8, 45]; const swap = (items, firstIndex, secondIndex) => {    var temp = items[firstIndex];    items[firstIndex] = items[secondIndex];    items[secondIndex] = temp; }; const bubbleSort = items => {    var len = items.length,    i, j;   ... Read More

Compound Interest FormulaCompound interest is calculated using the following formula −CI = P*(1 + R/n) (nt) – PHere, P is the principal amount.R is the annual interest rate.t is the time the money is invested or borrowed for.n is the number of times that interest is compounded per unit t, for example if interest is compounded monthly and t is in years then the value of n would be 12. If interest is compounded quarterly and t is in years then the value of n would be 4.We are required to write a JavaScript function that takes in principal, rate, ... Read More

We are required to write a JavaScript function that takes in two numbers say m and n, and returns an array of size n with all the elements of the resulting array adding up to m.Let’s write the code for this function −ExampleFollowing is the code −const len = 8; const sum = 5; const splitNumber = (len, sum) => {    const res = [];    for(let i = 0; i < len; i++){       res.push(sum / len);    };    return res; }; console.log(splitNumber(len, sum));OutputThe output in the console: −[    0.625, 0.625,    0.625, 0.625,    0.625, 0.625,    0.625, 0.625 ]

We are required to write a JavaScript function that takes in an array of literals and checks if elements are the same or not if read from front or back i.e. palindrome.ExampleLet’s write the code for this function −const arr = [1, 5, 7, 4, 15, 4, 7, 5, 1]; const isPalindrome = arr => {    const { length: l } = arr;    const mid = Math.floor(l / 2);    for(let i = 0; i

Suppose, we have two arrays of literals like these :const arr1 = [2, 4, 5, 3, 7, 8, 9]; const arr2 = [1, 4, 5, 2, 3, 7, 6];We are required to write a JavaScript function that takes in two such arrays and returns a new array with all the duplicates removed (should appear only once).ExampleLet’s write the code for this function −const arr1 = [2, 4, 5, 3, 7, 8, 9]; const arr2 = [1, 4, 5, 2, 3, 7, 6]; const mergeArrays = (first, second) => {    const { length: l1 } = first;    const { ... Read More