We are required to write a JavaScript function that takes in three unsorted numbers and returns the middlemost of them using minimum number of comparisons.For example: If the numbers are −34, 45, 12Then our function should return the following −34ExampleFollowing is the code −const num1 = 34; const num2 = 45; const num3 = 12; const middleOfThree = (a, b, c) => {    // x is positive if a is greater than b.    // x is negative if b is greater than a.    x = a - b;    y = b - c;    z = ... Read More

We are required to write a JavaScript function that takes in an array of numbers and returns a subarray of two elements from the original array whose sum is closest to 0.If the length of the array is less than 2, we should return the whole array.For example: If the input array is −const arr = [4, 4, 12, 3, 3, 1, 5, -4, 2, 2];Here, the sum of pair [5, -4] is 1 which is closest 0 for any two adjacent elements of the array, so we should return [5, -4]ExampleFollowing is the code −const arr = [4, 4, ... Read More

We are required to write a JavaScript function that takes in an array of numbers of length N (N should be even) and divides the array into two sub-array (left and right) containing N/2 elements each and do the sum of the subarrays and then multiply both the subarrays.For example: If the input array is −const arr = [1, 2, 3, 4]Then the output should be −(2+1) * (3+4) = 21ExampleFollowing is the code −const arr = [1, 2, 3, 4] const subArrayProduct = arr => {    const { length: l } = arr;    const creds = arr.reduce((acc, ... Read More

We are required to write a JavaScript function that takes in one such array and counts the sum of all distinct elements of the array.For example: Suppose, we have an array of numbers like this −const arr = [1, 5, 2, 1, 2, 3, 4, 5, 7, 8, 7, 1];The output for the array mentioned above will be 20.ExampleFollowing is the code −const arr = [1, 5, 2, 1, 2, 3, 4, 5, 7, 8, 7, 1]; const distinctSum = arr => {    let res = 0;    for(let i = 0; i < arr.length; i++){       if(i === arr.lastIndexOf(arr[i])){          res += arr[i];       };       continue;    };    return res; }; console.log(distinctSum(arr));OutputFollowing is the output in the console −30

We are required to write a JavaScript function that takes in a number and checks whether it falls in Fibonacci series or not. We should return a boolean.Following is the code to check for Fibonacci −Exampleconst num = 89; const isFib = query => {    if(query === 0 || query === 1){       return true;    }    let prev = 1;    let count = 2;    let temp = 0;    while(count

Suppose, we have a sorted array of literals like this −const arr = [2, 2, 3, 3, 3, 5, 5, 6, 7, 8, 9];We are required to write a JavaScript function that takes in one such array and returns the first number that appears only once in the array. If there is no such number in the array, we should return false.For this array, the output should be 6ExampleFollowing is the code −const arr = [2, 2, 3, 3, 3, 5, 5, 6, 7, 8, 9]; const firstNonDuplicate = arr => {    let appeared = false;    for(let i ... Read More

We are required to write a JavaScript function that takes in a Number, say n, and we are required to check whether there exist such three consecutive natural numbers (not decimal/floating point) whose sum equals to n.If there exist such numbers, our function should return them, otherwise it should return false. Following is the code −Exampleconst sum = 54; const threeConsecutiveSum = sum => {    if(sum < 6 || sum % 3 !== 0){       return false;    }    // three numbers will be of the form:    // x + x + 1 + x ... Read More

We are required to write a JavaScript function that takes in a lowercase string and sorts it in the reverse order i.e., b should come before a, c before b and so on.For example: If the input string is −const str = "hello";Then the output should be −const output = "ollhe";ExampleFollowing is the code −const string = 'hello'; const sorter = (a, b) => {    const legend = [-1, 0, 1];    return legend[+(a < b)]; } const reverseSort = str => {    const strArr = str.split("");    return strArr    .sort(sorter)    .join(""); }; console.log(reverseSort(string));OutputFollowing is the output in the console −ollhe

We are required to write a JavaScript function that takes in a number, constructs a new number from the first and last digit of that number and returns the difference between the original number and the number thus formed.For example: If the input is 34567Then the corner digits number will be −37And the output will be −34530ExampleFollowing is the code −const num = 34567; const cornerDifference = num => {    let temp = Math.abs(num);    let corner = temp % 10;    if(temp < 100){       corner = temp;    }else{       while(temp >= 10){ ... Read More

Suppose, we have a 2-D array representing a square matrix like this −const arr = [    [1, 3, 4, 2],    [4, 5, 3, 5],    [5, 2, 6, 4],    [8, 2, 9, 3] ];We are required to write a function that takes in this array and returns the product of the element present at the principal Diagonal of the matrix.For this array the elements present at the principal diagonal are −1, 5, 6, 3Hence the output should be −90ExampleFollowing is the code −const arr = [    [1, 3, 4, 2],    [4, 5, 3, 5],   ... Read More