Javascript Articles - Page 279 of 534

We are required to write a JavaScript function that takes in a string and returns the count of redundant characters in the string.For example − If the string is −const str = 'abcde'Then the output should be 0If the string is −const str = 'aaacbfsc';Then the output should be 3ExampleFollowing is the code −const str = 'aaacbfsc'; const countRedundant = str => {    let count = 0;    for(let i = 0; i < str.length; i++){       if(i === str.lastIndexOf(str[i])){          continue;       };       count++;    };    return count; }; console.log(countRedundant(str));OutputFollowing is the output in the console −3

We are required to write a JavaScript function that takes in an array of strings, ordered by ascending length.The function should return true if, for each pair of consecutive strings, the second string can be formed from the first by adding a single letter either at the beginning or end.For example: If the array is given by −const arr = ["c", "ca", "can", "acan", "acane", "dacane"];Then our function should return true.ExampleFollowing is the code −const arr = ["c", "ca", "can", "acan", "acane", "dacane"]; const isProgressive = arr => {    for(let i = 0; i < arr.length-1; i++){     ... Read More

We are required to write a function that takes in an array of exactly five elements representing the five cards of a poker player drawn randomly.If the five cards contain at least one pair, our function should return the card number of the highest pair (trivial if there only exists a single pair). Else our function should return false.For example: If the array is −const arr = ['A', 'Q', '3', 'A', 'Q'];Then our function should return −'A'  (as 'A' > 'Q' in card games)ExampleFollowing is the code −const arr = ['A', 'Q', '3', 'A', 'Q']; const greatestPair = arr => ... Read More

We are required to write a JavaScript function that takes in an array of literals containing all similar elements but one. Our function should return the unlike number.ExampleFollowing is the code −const arr = [2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4]; // considering that the length of array is atleast 3 const findUnlike = arr => {    for(let i = 1; i < arr.length-1; i++){       if(arr[i] - arr[i-1] !== 0 && arr[i]-arr[i+1] === 0){          return arr[i-1];       }else if(arr[i] - arr[i-1] !== 0 && arr[i]-arr[i+1] === ... Read More

We are required to write a JavaScript function that takes in a number and returns the first prime number that appears after n.For example: If the number is 24,Then the output should be 29ExampleFollowing is the code −const num = 24; const isPrime = n => {    if (n===1){       return false;    }else if(n === 2){       return true;    }else{       for(let x = 2; x < n; x++){          if(n % x === 0){             return false;          }       }       return true;    }; }; const nearestPrime = num => {    while(!isPrime(++num)){};    return num; }; console.log(nearestPrime(24));OutputFollowing is the output in the console −29

An array of numbers is 100% shuffled if no two consecutive numbers appear together in the array (we only consider the ascending order case here). And it is 0% shuffled if pairs are of consecutive numbers.For an array of length n there will be n-1 pairs of elements (without distorting its order).We are required to write a JavaScript function that takes in an array of numbers and returns a number between [0, 100] representing the intensity of shuffle in the arrayExampleFollowing is the code −const arr = [4, 23, 1, 23, 35, 78, 4, 45, 7, 34, 7]; // this function calculates deviation from ascending sort const shuffleIntensity = arr => {    let inCorrectPairs = 0;    if(arr.length

We are required to write a JavaScript function that takes in a number n and returns a random string of length n containing no other than the 26 English lowercase alphabetsExampleLet us write the code for this function −const num = 8; const randomNameGenerator = num => {    let res = '';    for(let i = 0; i < num; i++){       const random = Math.floor(Math.random() * 27);       res += String.fromCharCode(97 + random);    };    return res; }; console.log(randomNameGenerator(num));OutputFollowing is the output in the console −kdcwpingNote − This is one of many possible outputs. Console output is expected to differ every time/

We are required to write a JavaScript function that takes in a number n as the only input.The function should first find the current day (using Date Object in JavaScript) and then the function should return the day n days from today.For example −If today is Monday and n = 2, Then the output should be −WednesdayExampleFollowing is the code −const num = 15; const findNthDay = num => {    const weekday=new Array(7);    weekday[1]="Monday";    weekday[2]="Tuesday";    weekday[3]="Wednesday";    weekday[4]="Thursday";    weekday[5]="Friday";    weekday[6]="Saturday";    weekday[7]="Sunday"    const day = new Date().getDay();    const daysFromNow = num % ... Read More

We are required to write a JavaScript function that takes in an array of Number / String literals and returns another array of arrays. With each subarray containing exactly two elements, the nth element from start nth from last.For example −If the array is −const arr = [1, 2, 3, 4, 5, 6];Then the output should be −const output = [[1, 6], [2, 5], [3, 4]];ExampleFollowing is the code −const arr = [1, 2, 3, 4, 5, 6]; const edgePairs = arr => {    const res = [];    const upto = arr.length % 2 === 0 ? arr.length ... Read More

The primorial of a number n is equal to the product of first n prime numbers.For example, if n = 4Then, the output primorial(n) is, 2*3*5*7 = 210We are required to write a JavaScript function that takes in a number and returns its primordial.ExampleFollowing is the code −const num = 4; const isPrime = n => {    if (n===1){       return false;    }else if(n === 2){       return true;    }else{       for(let x = 2; x < n; x++){          if(n % x === 0){       ... Read More