ProblemWe are required to write a JavaScript function that takes in a number and return true if the reverse of that number is a prime number, false otherwise.ExampleFollowing is the code − Live Democonst num = 13; const findReverse = (num) => {    return +num    .toString()    .split('')    .reverse()    .join(''); }; const isPrime = (num) => {    let sqrtnum = Math.floor(Math.sqrt(num));    let prime = num !== 1;    for(let i = 2; i < sqrtnum + 1; i++){       if(num % i === 0){          prime = false;          break;       };    };    return prime; } const isReversePrime = num => isPrime(findReverse(num)); console.log(isReversePrime(num));Outputtrue

In the realm of JavaScript programming, the ability to repeat a string for a specific number of times is a significant functionality that can greatly enhance the efficiency and versatility of code. JavaScript, being a flexible and powerful language, provides developers with the tools to accomplish this task effortlessly. Although the concept may seem elementary, mastering the art of repeating a string for a specific number of times requires an understanding of the underlying mechanisms and the appropriate utilization of rarely used functions. In this article, we will explore the intricacies of repeating strings using JavaScript, diving into the less ... Read More

ProblemWe are required to write a JavaScript function that takes in a number n. Our function should return the next higher multiple of five of that number, obtained by concatenating the shortest possible binary string to the end of this number's binary representation.ExampleFollowing is the code −const generateAll = (num = 1) => {    const res = [];    let max = parseInt("1".repeat(num), 2);    for(let i = 0; i {    const numBinary = num.toString(2);    let i = 1;    while(true){       const perm = generateAll(i);       const required = perm.find(binary => {          return parseInt(numBinary + binary, 2) % 5 === 0;       });       if(required){          return parseInt(numBinary + required, 2);       };       i++;    }; }; console.log(smallestMultiple(8));Output35

ProblemWe are required to write a JavaScript function that takes in a sting and returns true if all the characters in the string appear only once and false otherwise.ExampleFollowing is the code − Live Democonst str = 'thisconaluqe'; const allUnique = (str = '') => {    for(let i = 0; i < str.length; i++){       const el = str[i];       if(str.indexOf(el) !== str.lastIndexOf(el)){          return false;       };    };    return true; }; console.log(allUnique(str));Outputtrue

ProblemA Boggle board is a 2D array of individual characters, e.g. −const board = [    ["I", "L", "A", "W"],    ["B", "N", "G", "E"],    ["I", "U", "A", "O"],    ["A", "S", "R", "L"] ];We are required to write a JavaScript function that takes in boggle board and a string and checks whether that string is a valid guess in the boggle board or not. Valid guesses are strings which can be formed by connecting adjacent cells (horizontally, vertically, or diagonally) without reusing any previously used cells.For example, in the above board "LINGO", and "ILNBIA" would all be valid ... Read More

ProblemWe are required to write a JavaScript function that takes in a number n. Our function should find the absolute difference between the sum and the product of all the digits of that number.ExampleFollowing is the code − Live Democonst num = 434312; const sumProductDifference = (num = 1) => {     const sum = String(num)         .split('')         .reduce((acc, val) => acc + +val, 0);       const product = String(num)         .split('')         .reduce((acc, val) => acc * +val, 1);       const diff = product - sum;       return Math.abs(diff); }; console.log(sumProductDifference(num));Output271

In the vast realm of JavaScript programming, the ability to eliminate all spaces from a string assumes paramount importance. Efficiently removing spaces from a string is an essential skill that empowers developers to manipulate and process textual data with precision. By leveraging the inherent capabilities of JavaScript, programmers can employ various techniques to eradicate spaces and enhance the functionality and integrity of their applications. In this article, we will delve into the intricacies of eliminating spaces from a string using JavaScript, exploring lesser-known methods and algorithms that pave the way for streamlined text processing and manipulation. Problem Statement In the ... Read More

ProblemWe are required to write a JavaScript function that takes in an array of integers (positives and negatives) and our function should return an array, where the first element is the count of positives numbers and the second element is sum of negative numbers.ExampleFollowing is the code − Live Democonst arr = [1, 2, 1, -2, -4, 2, -6, 2, -4, 9]; const posNeg = (arr = []) => {    const creds = arr.reduce((acc, val) => {       let [count, sum] = acc;       if(val > 0){          count++;       }else if(val < 0){          sum += val;       };       return [count, sum];    }, [0, 0]);    return creds; }; console.log(posNeg(arr));Output[ 6, -16 ]

ProblemWe are required to write a JavaScript function that takes in number n. Our function should return the nth palindrome number if started counting from 0.For instance, the first palindrome will be 0, second will be 1, tenth will be 9, eleventh will be 11 as 10 is not a palindrome.ExampleFollowing is the code − Live Democonst num = 31; const findNthPalindrome = (num = 1) => {    const isPalindrome = (num = 1) => {       const reverse = +String(num)       .split('')       .reverse()       .join('');       return reverse === num;    };    let count = 0;    let i = 0;    while(count < num){       if(isPalindrome(i)){          count++;       };       i++;    };    return i - 1; }; console.log(findNthPalindrome(num));OutputFollowing is the console output −212

ProblemWe are required to write a JavaScript function that takes in a positive number n. We can do at most one operation −Choosing the index of a digit in the number, remove this digit at that index and insert it back to another or at the same place in the number in order to find the smallest number we can get.Our function should return this smallest number.ExampleFollowing is the code − Live Democonst num = 354166; const smallestShuffle = (num) => {    const arr = String(num).split('');    const { ind } = arr.reduce((acc, val, index) => {       ... Read More