ProblemWe are required to write a JavaScript function that takes in a word target and an array of sorted(by length(increasing), number of uppercase letters(decreasing), natural order) unique words which always contains the target.The task of our function is to find the index(0 based) of the target in the array of words, which would always be in the list.ExampleFollowing is the code − Live Democonst arr = ['cP', 'rE', 'sZ', 'am', 'bt', 'ev', 'hq', 'rx', 'yi', 'akC', 'nrcVpx', 'iKMVqsj']; const target = 'akC'; const findTarget = (arr = [], target = '') => {    const index = arr.indexOf(target);    return index; ... Read More

ProblemWe are required to write a JavaScript function that takes in an array of exactly two numbers. Our function should return the absolute difference between the numbers after interchanging their first digits.For instance, for the array [105, 413], The difference will be: |405 - 113| = 292ExampleFollowing is the code − Live Democonst arr = [105, 413]; const interchangedDigitDiff = (arr = []) => {    arr = arr.map(String);    const [first, second] = arr;    const fChar = first[0];    const sChar = second[0];    const newFirst = sChar + first.substring(1, first.length);    const newSecond = fChar + second.substring(1, second.length); ... Read More

ProblemWe are required to write a JavaScript function that takes in a string that contains exactly two words.Our function should construct and return a new string in which the first letter of the words are interchanged with each other.ExampleFollowing is the code − Live Democonst str = 'hello world'; const interchangeChars = (str = '') => {    const [first, second] = str.split(' ');    const fChar = first[0];    const sChar = second[0];    const newFirst = sChar + first.substring(1, first.length);    const newSecond = fChar + second.substring(1, second.length);    const newStr = newFirst + ' ' + newSecond;    return newStr; }; console.log(interchangeChars(str));OutputFollowing is the console output −wello horld

ProblemWe are required to write a JavaScript function that takes in a number n. Our function should rearrange the digits of the numbers such that we form the smallest number using the same digits but just bigger than the input number.For instance, if the input number is 112. Then the output should be 121.ExampleFollowing is the code − Live Democonst num = 112; const findNextBigger = (num = 1) => {    const sortedDigits = (num = 1) => {       return String(num)       .split('')       .sort((a, b) => b - a);    };    let max = sortedDigits(num).join('');    max = Number(max);    for(let i = num + 1; i

ProblemWe are required to write a JavaScript function that takes in an array of numbers and a target sum.Our function should remove the second number of all such consecutive number pairs from the array that add up to the target number.ExampleFollowing is the code − Live Democonst arr = [1, 2, 3, 4, 5]; const target = 3; const removeSecond = (arr = [], target = 1) => {    const res = [arr[0]];    for(i = 1; i < arr.length; i++){       if(arr[i] + res[res.length-1] !== target){          res.push(arr[i]);       };    };    return res; }; console.log(removeSecond(arr, target));OutputFollowing is the console output −[ 1, 3, 4, 5 ]

ProblemWe are required to write a JavaScript function that takes in two numbers.Our function should count the number of carries we are required to take while adding those numbers as if we were adding them on paper.Like in the following image while adding 179 and 284, we had used carries two times, so for these two numbers, our function should return 2.ExampleFollowing is the code − Live Democonst num1 = 179; const num2 = 284; const countCarries = (num1 = 1, num2 = 1) => {    let res = 0;    let carry = 0;    while(num1 + num2){   ... Read More

ProblemWe are required to write a JavaScript function that takes in an array of positive integers. We can transform its elements by running the following operation on them as many times as required −if arr[i] > arr[j] then arr[i] = arr[i] - arr[j]When no more transformations are possible, our function should return its sum.ExampleFollowing is the code − Live Democonst arr = [6, 9, 21]; const smallestSum = (arr = []) => {    const equalNums = arr => arr.reduce((a, b) => {       return (a === b) ? a : NaN;    });    if(equalNums(arr)){       ... Read More

ProblemWe are required to write a JavaScript function that takes in a string that contains only the letter ‘k’, ‘l’ and ‘m’.The task of our function is to switch the positions of k with that of l leaving all the instances of m at their positions.ExampleFollowing is the code − Live Democonst str = 'kklkmlkk'; const switchPositions = (str = '') => {    let res = "";    for(let i = 0; i < str.length; i++){       if (str[i] === 'k') {          res += 'l';       } else if (str[i] === 'l') {          res += 'k';       } else {          res += str[i];       };    };    return res; }; console.log(switchPositions(str));OutputFollowing is the console output −llklmkll

Understanding the range of values within an array is a crucial aspect of data analysis and manipulation in JavaScript. When faced with large datasets or complex algorithms, having a reliable function that can efficiently determine the minimum and maximum values of an array becomes indispensable. This article delves into the intricacies of creating a robust JavaScript function that can effortlessly extract the extreme values from an array, enabling developers to gain valuable insights and make informed decisions based on the data at hand. By exploring the step-by-step implementation and leveraging rarely used programming techniques, we empower developers to enhance their ... Read More

ProblemSuppose the following sequence:Seq: 1/1 , 1/1x2 , 1/1x2x3 , 1/1x2x3x4 , ....The nth term of this sequence will be −1 / 1*2*3 * ... nWe are required to write a JavaScript function that takes in a number n, and return the sum of first n terms of this sequence.ExampleFollowing is the code − Live Democonst num = 12; const seriesSum = (num = 1) => {    let m = 1;    let n = 1;    for(let i = 2; i < num + 1; i++){       m *= i;       n += (m * -1);    };    return n; }; console.log(seriesSum(num));Output-522956311