ProblemWe are required to write a JavaScript function that takes in a range of two integers as the first argument and a number as the second argument.Our function should find all the numbers divisible by the input number in the specified range and return their count.ExampleFollowing is the code − Live Democonst range = [6, 57]; const num = 3; const findDivisibleCount = (num = 1, [l, h]) => {    let count = 0;    for(let i = l; i

ProblemWe are required to write a JavaScript function that takes in two numbers, let say m and n.Our function should construct and return an array of first n natural multiples of m.ExampleFollowing is the code − Live Democonst m = 6; const n = 14; const firstNMultiple = (m = 1, n = 1) => {    const res = [];    for(let i = 1; i

ProblemWe are required to write a JavaScript function that takes in a string. Our function should return an array of exactly two elements the first element will be characters that makes the most number of consecutive appearances in the string and second will be its number of appearances.ExampleFollowing is the code − Live Democonst str = 'tdfdffddffsdsfffffsdsdsddddd'; const findConsecutiveCount = (str = '') => {    let res='';    let count=1;    let arr = []    for (let i=0;iv

ProblemWe are required to write a JavaScript function that takes in an array of numbers as the first argument and a number as the second argument.Our function should pick and return an array of last n even numbers present in the input array.ExampleFollowing is the code − Live Democonst arr = [1, 2, 3, 4, 5, 6, 7, 8, 9]; const num = 3; const pickEvens = (arr = [], num = 1) => {    const res = [];    for(let index = arr.length - 1; index >= 0; index -= 1){       if (res.length === num){          break;       };       const number = arr[index];       if (number % 2 === 0){          res.unshift(number);       };    };    return res; }; console.log(pickEvens(arr, num));Output[4, 6, 8]

ProblemWe are required to write a JavaScript function that takes in two numbers. The first number represents the sum of two numbers and second represents their HCF (GCD or Greatest Common Divisor).Our function should find and return those two numbers.ExampleFollowing is the code − Live Democonst sum = 12; const gcd = 4; const findNumbers = (sum, gcd) => {    const res = [];    if (sum % gcd !== 0){       return -1;    }else{       res.push(gcd);       res.push(sum - gcd);       return res;    }; }; console.log(findNumbers(sum, gcd));Output[4, 8]

ProblemWe are required to write a JavaScript function that takes in an array of integers. For each number in the array there will also be its negative or positive compliment present in the array, but for exactly one number, there will be no compliment.Our function should find and return that number from the array.ExampleFollowing is the code − Live Democonst arr = [1, -1, 2, -2, 3]; const findOddNumber = (arr = []) => {    let count = 0;    let number = arr.reduce((total, num) => {       if (num >= 0)          count++       else          count--       return total + num;    }, 0)    return number / Math.abs(count); }; console.log(findOddNumber(arr));Output3

ProblemWe are required to write a JavaScript function that takes in a string of english lowercase alphabets.Our function should construct a new string in which each character is repeated the number of times their 1-based index in the string in capital case and different character sets should be separated by dash ‘-’.Therefore, the string ‘abcd’ should become −"A-Bb-Ccc-Dddd"ExampleFollowing is the code − Live Democonst str = 'abcd'; const repeatStrings = (str) => {    const res = [];    for(let i = 0; i < str.length; i++){       const el = str[i];       let temp = el.repeat(i ... Read More

ProblemWe are required to write a JavaScript function that takes in two arrays, a1 and a2 of strings. Each string is composed with letters from a to z. Let x be any string in the first array and y be any string in the second array.Our function should find the value of −max(abs(length(x) − length(y)))ExampleFollowing is the code − Live Democonst arr1 = ["hoqq", "bbllkw", "oox", "ejjuyyy", "plmiis", "xxxzgpsssa", "xxwwkktt", "znnnnfqknaz", "qqquuhii", "dvvvwz"]; const arr2 = ["cccooommaaqqoxii", "gggqaffhhh", "tttoowwwmmww"]; const findMaxAbsDiff = (arr1 = [], arr2 = []) => {    if(arr1.length === 0 || arr2.length === 0){       ... Read More

ProblemWe are required to write a JavaScript function that takes in a positive integer. Our function should represent this number as the sum of some powers of prime numbers.Therefore, for the number n, our function should return a string like this −n = "(p1**n1)(p2**n2)...(pk**nk)"Where p1, p2, p3..pk are prime numbers and n1, n2, ..nk are their non-negative powers and a ** b stands for a raised to the power b.ExampleFollowing is the code −const isPrime = num => {     for(let i = 2; i < num; i++){         if(num % i === 0){     ... Read More

ProblemWe are required to write a JavaScript function that takes in two arrays of strings. Our function should return the number of times each string of the second array appears in the first array.ExampleFollowing is the code − Live Democonst arr1 = ['abc', 'abc', 'xyz', 'cde', 'uvw']; const arr2 = ['abc', 'cde', 'uap']; const findFrequency = (arr1 = [], arr2 = []) => {    const res = [];    let count = 0;    for (let i = 0; i < arr2.length; i++){       for (let j = 0; j < arr1.length; j++){          if (arr2[i] === arr1 [j]){             count++;          }       }       res.push(count);       count = 0;    }    return res; }; console.log(findFrequency(arr1, arr2));Output[2, 1, 0]