Javascript Articles

Page 36 of 534

Crack Alphabets fight problem in JavaScript

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 201 Views

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

Arranging lexicographically and removing whitespaces in JavaScript

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 170 Views

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 −const str = 'some simple letter combination!'; const orderString = (str = '') => {    let res = '';       for(let i = 97; i < 123; ...

Read More

Alternatingly combining array elements in JavaScript

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 153 Views

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 −const arr1 = [1, 2, 3, 4]; const arr2 = [11, 12, 13, 14]; const arr3 = ['a', 'b', 'c']; const ...

Read More

Checking for squared similarly of arrays in JavaScript

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 164 Views

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 −const arr1 = [4, 1, 8, 5, 9]; const arr2 = [81, 1, 25, 16, 64]; const isSquared = ...

Read More

Validating alternating vowels and consonants in JavaScript

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 260 Views

ProblemWe are required to write a JavaScript function that takes in a string of English alphabets, str, as the first and the only argument. Our function should return true if and only if the vowels and consonants appear alternatingly in the input string, false otherwise.For example, if the input to the function is −Inputconst str = 'amazon';Outputconst output = true;Output ExplanationBecause the vowels and consonants appear alternatingly in the string ‘amazon’.ExampleFollowing is the code −const str = 'amazon'; const appearAlternatingly = (str = '') => {    return str.split('').every((v, i)=>{     if (/[aeiou]/.test(str[0])){       ...

Read More

Finding minimum flips in a binary string using JavaScript

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 240 Views

Monotonically Increasing String:A string of '0's and '1's is monotonically increasing if it consists of some number of '0's (possibly 0), followed by some number of '1's (also possibly 0.)ProblemWe are required to write a JavaScript function that takes in a binary string, str, as the first and the only argument.We can flip any ‘0’ to ‘1’ or any ‘1’ to ‘0’ present in the string. Our function should return the minimum number of flips to make S monotonically increasing.For example, if the input to the function isInputconst str = '00110';Outputconst output = 1;Output ExplanationBecause if we flip the last ...

Read More

Binary subarrays with desired sum in JavaScript

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 142 Views

ProblemWe are required to write a JavaScript function that takes in a binary array, arr, as the first argument, and a number, target, as the second argument.Our function is supposed to count the number of subarrays that exists in the array arr, the sum of whose elements is equal to count. We should finally return this count.For example, if the input to the function isInputconst arr = [1, 0, 1, 0, 1]; const target = 2;Outputconst output = 4;Output ExplanationBecause the desired subarrays are:[1, 0, 1][1, 0, 1, 0] [0, 1, 0, 1] [1, 0, 1]Exampleconst arr = [1, 0, ...

Read More

Maximum subarray sum in circular array using JavaScript

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 247 Views

ProblemWe are required to write a JavaScript function that takes in an array of integers, arr, as the first and the only argument.We can consider this array arr to be a circular array, which means the last element of the array will be followed by the first. Our function should find and return the maximum possible sum of a non-empty subarray of arr.For example, if the input to the function isInputconst arr = [2, -2, 3, -1];Outputconst output = 4;Output ExplanationBecause the desired subarray is [3, -1, 2]Exampleconst arr = [2, -2, 3, -1]; const maxSubarraySumCircular = (arr = []) ...

Read More

Finding Fibonacci sequence in an array using JavaScript

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 647 Views

Fibonacci Sequence:A sequence X_1, X_2, ..., X_n is fibonacci if:n >= 3X_i + X_{i+1} = X_{i+2} for all i + 2 {    const map = arr.reduce((acc, num, index) => {       acc[num] = index       return acc    }, {})    const memo = arr.map(() => arr.map(() => 0))    let max = 0    for(let i = 0; i < arr.length; i++) {       for(let j = i + 1; j < arr.length; j++) {          const a = arr[i]          const b = arr[j]          const index = map[b - a]          if(index < i) {             memo[i][j] = memo[index][i] + 1          }          max = Math.max(max, memo[i][j])       }    }    return max > 0 ? max + 2 : 0 }; console.log(longestFibonacci(arr));Output5

Read More

Checking if change can be provided in JavaScript

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 152 Views

ProblemWe are required to write a JavaScript function that takes in an array of numbers, arr, as the first and the only argument.Let us consider the following situation:A shopkeeper sells a single commodity which costs exactly ₹5. Some customers are standing in a queue and will purchase exactly one unit of this commodity each. The customers can provide the shopkeeper with a note of ₹5, ₹10 or ₹20. Considering that the shopkeeper has no money in the beginning and the array represents the notes given by the customers standing in the queue.Our function should determine whether or not the shopkeeper ...

Read More
Showing 351–360 of 5,338 articles
« Prev 1 34 35 36 37 38 534 Next »
Advertisements