We are given an array of distinct integers, let’s say arr, and another array of integer arrays, let say sourceArr.In the sourceArr array, the integers are distinct. We should write a function that forms arr by concatenating the arrays in sourceArr in any order.However, we cannot reorder the integers inside of any subarray in the soureArr. We should return true if it is possible to form the array arr from sourceArr, false otherwise.For example −const arr = [23, 67, 789]; const sourceArr = [[23], [789, 67]];The function should return false because we cannot reorder the elements inside a subarray and ... Read More

We are required to write a JavaScript function that can compare two strings and return the percentage likeliness of how much they are alike. The percentage will be nothing but a measure of many characters the two strings have in common.If they are completely similar the output should be 100, and if they contain no common character at all, the output should be 0.Exampleconst calculateSimilarity = (str1 = '', str2 = '') => {    let longer = str1;    let shorter = str2;    if (str1.length < str2.length) {       longer = str2; shorter = str1;   ... Read More

We are required to write a JavaScript function that takes in multiple arrays of numbers. The function should return an array of the cartesian product of the elements from all the arrays.For example −If the input arrays are −[1, 2], [10, 20], [100, 200, 300]Then the output should be −const output = [    [ 1, 10, 100 ],    [ 1, 10, 200 ],    [ 1, 10, 300 ],    [ 1, 20, 100 ],    [ 1, 20, 200 ],    [ 1, 20, 300 ],    [ 2, 10, 100 ],    [ 2, 10, 200 ],    [ 2, 10, 300 ],    [ 2, 20, 100 ],    [ 2, 20, 200 ],    [ 2, 20, 300 ] ];Exampleconst arr1 = [1, 2]; const arr2 = [10, 20]; const arr3 = [100, 200, 300]; const cartesianProduct = (...arr) => {    return arr.reduce((acc,val) => {       return acc.map(el => {          return val.map(element => {             return el.concat([element]);          });       }).reduce((acc,val) => acc.concat(val) ,[]);    }, [[]]); }; console.log(cartesianProduct(arr1, arr2, arr3));OutputThis will produce the following output −[    [ 1, 10, 100 ], [ 1, 10, 200 ],    [ 1, 10, 300 ], [ 1, 20, 100 ],    [ 1, 20, 200 ], [ 1, 20, 300 ],    [ 2, 10, 100 ], [ 2, 10, 200 ],    [ 2, 10, 300 ], [ 2, 20, 100 ],    [ 2, 20, 200 ], [ 2, 20, 300 ] ]

We are required to write a JavaScript function that takes in a string. It should return true or false based on whether the input consists of a repeated character sequence.The length of the given string is always greater than 1 and the character sequence must have at least one repetition.For example −"aa" should return true because it entirely contains two strings "a""aaa" should return true because it entirely contains three string "a""abcabcabc" should return true because it entirely containas three strings "abc""aba" should return false because it at least there should be two same substrings and nothing more"ababa" should return ... Read More

We are required to write a JavaScript function that takes in a sorted array of numbers as the first argument and a single number as the second argument.The function should push the number specified as the second argument into the array without distorting the sorting of the elements.We are required to do this without creating another array.Exampleconst arr = [6, 7, 8, 9, 12, 14, 16, 17, 19, 20, 22]; const num = 15; const findIndex = (arr, val) => {    let low = 0, high = arr.length;    while (low < high) {       let mid ... Read More

We are required to write a JavaScript function that takes in an array of numbers. The function should sort the array of numbers on the following criteria −---If the array contains any zeros, they should all appear in the beginning.---All the remaining numbers should be placed in a decreasing order.For example −If the input array is −const arr = [4, 7, 0 ,3, 5, 1, 0];Then after applying the sort, the array should become −const output = [0, 0, 7, 5, 4, 3, 1];We will use the Array.prototype.sort() method here.For the decreasing order sort, we will take the difference of ... Read More

We are required to write a JavaScript function that takes in a number. The function should first calculate the factorial of that number and then it should return the sum of the digits of the calculated factorial.For example −For the number 6, the factorial will be 720, so the output should be 9Exampleconst factorial = (num) => {    if (num == 1) return 1;    return num * factorial(num-1); }; const sumOfDigits = (num = 1) => {    const str = num.toString();    let sum = 0;    for (var x = -1; ++x < str.length;) {       sum += +str[x];    };    return sum; }; const sumFactorialDigits = num => sumOfDigits(factorial(num)); console.log(sumFactorialDigits(6));OutputThis will produce the following output −9

We are required to write a JavaScript function that takes in a number, say n. The function should count the letters in the number names from 1 to n.For example − If n = 5;Then the numbers are one, two, three, four, five.And the total number of letters are 19, so the output should be 19.Exampleconst sumUpto = (num = 1) => {    let sum = 0;    const lenHundred = 7;    const lenThousand = 8;    const lenPlaceOnes = [0,3,3,5,4,4,3,5,5,4];    const lenPlaceTens = [0,3,6,6,5,5,5,7,6,6];    for (let i = 1; i 100 && i % 100 != 0) {          sum += 3;       }    }    return sum; } console.log(sumUpto(12)); console.log(sumUpto(5)); console.log(sumUpto(122));OutputThis will produce the following output −51 19 1280

Suppose, we have a reference array of phrases like this −const reference = ["your", "majesty", "they", "are", "ready"];And we are required to join some of the elements of above array based on another array so if another array is this −const another = ["your", "they are"];The result would be like −result = ["your", "majesty", "they are", "ready"];Here, we compared the elements in both the arrays, we joined the elements of the first array if they existed together in the second array.We are required to write a JavaScript function that takes in two such arrays and returns a new joined array.Exampleconst ... Read More

We are required to write a JavaScript String function that takes in a search string can loosely checks for the search string in the string it is used with.The function should take this criterion into consideration: It should loop through the search query letters and check if they occur in the same order in the string.For example −('a haystack with a needle').fuzzySearch('hay sucks'); // false ('a haystack with a needle').fuzzySearch('sack hand'); // trueExampleconst fuzzySearch = function (query) {    const str = this.toLowerCase();    let i = 0, n = -1, l;    query = query.toLowerCase();    for (; l ... Read More