ProblemWe are required to write a JavaScript function that takes in two arrays of numbers, arr1 and arr2, as the first and second argument respectively.Our function should return true if and only if every element in arr2 is the square of any element of arr1 irrespective of their order of appearance.For example, if the input to the function is −Inputconst arr1 = [4, 1, 8, 5, 9]; const arr2 = [81, 1, 25, 16, 64];Outputconst output = true;ExampleFollowing is the code − Live Democonst arr1 = [4, 1, 8, 5, 9]; const arr2 = [81, 1, 25, 16, 64]; const isSquared ... Read More

In this article, we create a function that can take a string in any format. Such as normal case, snake case, pascal case or any other into camelCase in JavaScript. camelCase is a writing style where each word within a phrase is capitalized, except for the first word, and there are no spaces or punctuation. Let us understand through some sample example of I/O Scenario − Sample Input - const str = 'New STRING'; Sample Output - const output = 'newString'; Converting any case to camelCase in JavaScript Converting any case to camelCase in JavaScript is quite easy. Let's ... Read More

ProblemWe are required to write a JavaScript function that takes in any number of arrays of literals as input.Our function should prepare a new array that contains elements picked alternatingly from all the input arrays.For example, if the input to the function is −Inputconst arr1 = [1, 2, 3, 4]; const arr2 = [11, 12, 13, 14]; const arr3 = ['a', 'b', 'c'];Outputconst output = [1, 11, 'a', 2, 12, 'b', 3, 13, 'c', 4, 14];ExampleFollowing is the code − Live Democonst arr1 = [1, 2, 3, 4]; const arr2 = [11, 12, 13, 14]; const arr3 = ['a', 'b', 'c']; ... Read More

ProblemWe are required to write a JavaScript function that takes in a string, str, that contains alphabets and whitespacesOur function should iterate over the input string and perform actions so that the characters are concatenated into a new string in "case-insensitively-alphabetical-order-of-appearance" order. Whitespace and punctuation shall simply be removed!For example, if the input to the function is −Inputconst str = 'some simple letter combination!';Outputconst output = 'abceeeeiiillmmmnnoooprssttt';ExampleFollowing is the code − Live Democonst str = 'some simple letter combination!'; const orderString = (str = '') => {    let res = '';       for(let i = 97; i < ... Read More

ProblemConsider a situation where armies of two bunch of alphabets are fighting each other. The soldiers of both and their weight are as follows −TeamASoldierWeightA1B2C3D4TeamBSoldierWeightW1X2Y3Z4Other than the soldiers, there are bombs as well in the arena denoted by ‘!’, and a bomb kills soldiers placed at its adjacent sides.For instance: ‘A!BC’ will result in ‘C’ and ‘!!CC!!’ will result in ‘’.Our function should need to find out when all the bombs in the arena explode which team wins or if both the teams end up with the same weight.For example, if the input to the function is −Inputconst str = ... Read More

ProblemWe are required to write a JavaScript function that takes in a number, num, as the first argument and another number, parts, as the second argument.Our function should split the number num into exactly (parts) numbers and we should keep these two conditions in mind −The numbers should be as close as possibleThe numbers should even (if possible).And the ordering of numbers is not important.For example, if the input to the function is −Inputconst num = 20; const parts = 6;Outputconst output = [3, 3, 3, 3, 4, 4];ExampleFollowing is the code − Live Democonst num = 20; const parts = ... Read More

ProblemWe are required to write a JavaScript function that takes in a string str that represents a sentence as the only argument.Our function should count and return the adjacent pair of identical words present in the string str. Our function should check the words ignoring their case, which means ‘it’ and ‘It’ should be counted as identical.For example, if the input to the function is −Inputconst str = 'This this is a a sample string';Outputconst output = 2;Output ExplanationBecause the repeating words are ‘this’ and ‘a’.ExampleFollowing is the code − Live Democonst str = 'This this is a a sample string'; ... Read More

Appending suffixes to numbers in JavaScript is used to add ordinal indicators (like "st", "nd", "rd", and "th") to the end of a number to denote its position in a sequence. This is useful for displaying dates, rankings, or other numeric data. A custom function can be created to append the correct suffix to a given number. The function handles special cases for numbers ending in 11, 12, and 13, and applies the appropriate suffix based on the last digit for other numbers. The task of our function is to ... Read More

ProblemWe are required to write a JavaScript function that takes in two binary strings str1 and str2 as the first and the second argumentOur function should return the sum of the two binary numbers. We are not allowed to convert the binary numbers into decimal and then add and the resulting sum should contain no zeros at all.For example, if the input to the function is −Inputconst str1 = '1101'; const str2 = '10111';Outputconst output = '100100';ExampleFollowing is the code − Live Democonst str1 = '1101'; const str2 = '10111'; const addBinary = (str1 = '', str2 = '') => { ... Read More

Ackermann FunctionThe Ackermann Function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree.ProblemWe are required to write a JavaScript function that takes in two numbers, m and n as the first and the second argument. Our function should return the Ackermann number A(m, n) defined byA(m, n) = n+1 if m=0 A(m, n) = A(m-1, 1) if m>0 , n=0 A(m, n) = A(m-1, A(m, n-1)) if m, n > 0Exampleconst m = 12; const n = ... Read More