Centrally Peaked ArrayWe call an array arr a centrally peaked array if the following properties hold −arr.length >= 3There exists some i with 0 < i < arr.length - 1 such thatarr[0] < arr[1] < ... arr[i-1] < arr[i]arr[i] > arr[i+1] > ... > arr[arr.length - 1]ProblemWe are required to write a JavaScript function that takes in an array of numbers, arr, as the first and the only argument.The input array is a centrally peaked array. Our function is supposed to return the peak index of this centrally peaked array.For example, if the input to the function isInputconst arr = ... Read More

ProblemWe are required to write a JavaScript function that takes in a balanced square bracket string, str, as the first and the only argument.Our function should compute and return the score of the string based on the following rule −[] has score 1AB has a score A + B, where A and B are balanced bracket strings.[A] has score 2 * A, where A is a balanced bracket string.For example, if the input to the function isInputconst str = '[][]';Outputconst output = 2;ExampleFollowing is the code −const findScore = (str = '') => {    const arr = []   ... Read More

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

ProblemWe are required to write a JavaScript function that takes in two arrays of numbers, arr1 and arr2, of the same length.Our function should shuffle the elements of the first array, arr1, such that its maximum number of elements are greater than corresponding elements of the array arr2. The function should then return the shuffled array.For example, if the input to the function isInputconst arr1 = [3, 5, 12, 19]; const arr2 = [2, 9, 3, 12];Outputconst output = [3, 12, 5, 19];Output ExplanationBefore shuffling arr1, it had 3 corresponding elements greater than that of arr2, but in the shuffled ... Read More

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

ProblemWe are required to write a JavaScript function that takes in the head of a linked list as the first and the only argument.Our function should return the value stored in the middlemost node of the list. And if there are two middlemost nodes, we should return the second one of them.For example, if the list is like this:Input[4, 6, 8, 9, 1]Outputconst output = 8;Following is the code:Exampleclass Node {    constructor(data) {       this.data = data;       this.next = null;    }; }; class LinkedList {    constructor() {       this.head = ... Read More

ProblemWe are required to write a JavaScript function that takes in two arrays of numbers, arr1 and arr2, as the first and the second argument.The sum of elements in arr1 and arr2 are different. Our function should pick one element from the first array and push it in the second array and pick one element from the second array and push it in the first array such that the sum of the elements of both the arrays become equal. We should return an array of these two elements.For example, if the input to the function isInputconst arr1 = [1, 2, ... Read More

In the realm of JavaScript programming, the ability to reverse the alphabets within a string holds significant importance for developers seeking to manipulate textual data in innovative ways. JavaScript, a versatile and widely used scripting language, provides a multitude of techniques and functions to accomplish this task efficiently. Reversing alphabets within a string entails rearranging the characters in a reverse order, transforming the original sequence into its mirror image. In this article, we will embark upon a journey to explore the intricacies of reversing alphabets in a string using JavaScript, delving into the lesser-known methods and algorithms that empower developers ... Read More

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]Example Live Democonst arr = [2, -2, 3, -1]; const maxSubarraySumCircular = (arr = ... Read More

ProblemWe are required to write a JavaScript function that takes in a string, str, which consists of only ‘[‘ or ‘]’. Our function is supposed to add the minimum number of square brackets ( '[' or ']', and in any positions ) so that the resulting bracket combination string is valid. And lastly, we should return the smallest number of brackets added.For example, if the input to the function isInputconst str = '[]]';Outputconst output = 1;Output ExplanationBecause, if we add ‘[‘ to the starting, the string will be balanced.Exampleconst findAdditions = (str = '') => {    let left = 0 ... Read More