We are required to write a JavaScript function that takes in an array of numbers with repetitive values and returns the number that appears for more than (n/2) number of times where n is the length of the array. If there is no such element in the array, our function should return falseLet's write the code for this function −Exampleconst arr = [12, 5, 67, 12, 4, 12, 4, 12, 6, 12, 12]; const arr1 = [3, 565, 7, 23, 87, 23, 3, 65, 1, 3, 6, 7]; const findMajority = arr => {    let maxChar = -Infinity, maxCount ... Read More

We are required to write a JavaScript function that takes in two arrays of Numbers, say first and second and checks for their equality.Equality in our case will be determined by one of these two conditions −The arrays are equal if they contain the same elements irrespective of their order.If the sum of all the elements of the first array and second array is equal.For example −[3, 5, 6, 7, 7] and [7, 5, 3, 7, 6] are equal arrays [1, 2, 3, 1, 2] and [7, 2] are also equal arrays but [3, 4, 2, 5] and [2, 3, ... Read More

We are required to write a JavaScript function that takes in two strings, say, string1 and string2 and determines whether the string1 ends with string2 or not.For example −"The game is on" Here, "on" should return trueWhile, "the game is off" Above, “of" should return falseLet's write the code for this function −Exampleconst first = 'The game is on'; const second = ' on'; const endsWith = (first, second) => {    const { length } = second;    const { length: l } = first;    const sub = first.substr(l - length, length);    return sub === second; }; ... Read More

In the decimal number system, ugly numbers are those positive integers whose only prime factors are 2, 3 or 5.For example − Integers from 1 to 10 are all ugly numbers, 12 is an ugly number as well.Our job is to write a JavaScript function that takes in a Number and determines whether it is an ugly number or not.Let's write the code for this function −Exampleconst num = 274; const isUgly = num => {    while(num !== 1){       if(num % 2 === 0){          num /= 2;       } else ... Read More

Non-duplicate characters in a string are those that appear only once and do not repeat within the string, and the strings are a data type that represents a sequence of characters or text. Sometimes in JavaScript, we need to work with strings and manipulate them based on certain conditions. One of the common tasks is to remove characters that only appear once in a string so that we keep only the characters that appear more than once. In this article, we will understand how to remove non-duplicate characters from a string in JavaScript. Understanding the Problem Suppose we have ... Read More

We are required to write a JavaScript function that takes in a string and returns a new string which has all the words reversed from the original string.For example −If the original string is −"Hello World how is it outside"Then the output should be −"olleH dlroW woH si ti edistuo"Now, let's write the code for this function −Exampleconst str = 'Hello World how is it outside'; const reverseSentence = str => {    const arr = str.split(" ");    const reversed = arr.map(el => {       return el.split('').reverse().join("");    });    return reversed.join(" "); }; console.log(reverseSentence(str));OutputThe output in ... Read More

Let’s say, we have two strings that contains characters in no specific order. We are required to write a function that takes in these two strings and returns a modified version of the second string in which all the characters that were present in the first string are omitted.Following are our strings −const first = "hello world"; const second = "hey there";Following is our function to remove all characters of first string from second −const removeAll = (first, second) => {    const newArr = second.split("").filter(el => {       return !first.includes(el);    });    return newArr.join(""); };Let's write ... Read More

We have a sorted array of positive integers like this −const arr = [1, 3, 6, 10, 11, 15];We are required to write a function, say findSmallest() that takes in one such array and returns the smallest positive integer that cannot be represented as the sum of some subarray of this original array.For example −For this array written above 2 is the smallest positive integer which cannot be reached by summing any subarray of this original array. So, now let's write the code for this function. As the array is sorted, we can achieve the solution to this problem in ... Read More

We have an array of numbers in JavaScript that contains numbers in an unsorted order. Our job is to write a function that takes in this array of numbers and returns an array of two elements, the top two elements of the array (greatest two elements of the array).We have to do this in one pass i.e., we need to execute this method in linear time like by using only one for loop or if we use ES6 function, we have to make sure to use only one and once and avoid nesting of methods which increases time complexity.So, now ... Read More

We have an array of Numbers/String literals where most of the entries are repeated. Our job is to write a function that takes in this array and returns the index of first such element which does not make consecutive appearances.If there are no such elements in the array, our function should return -1. So now, let's write the code for this function. We will use a simple loop to iterate over the array and return where we find non-repeating characters, if we find no such characters, we return -1 −Exampleconst arr = ['d', 'd', 'e', 'e', 'e', 'k', 'j', 'j', ... Read More