Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Front End Technology Articles
Page 316 of 652
Are bits alternating in integer using JavaScript?
ProblemWe are required to write a JavaScript function that takes in an integer, num, as the first and the only argument.Our function should check whether the binary representation of num has alternating bits − namely, if two adjacent bits will always have different values.For example, if the input to the function isInputconst num = 5;Outputconst output = true;Output ExplanationBecause the binary form of 5 is 101 which have alternating bits.ExampleFollowing is the code − Live Democonst num = 5; const isAlternating = (num = 1) => { const binary = num.toString(2); let curr = binary[0]; for(let i = ...
Read MoreSorting array based on increasing frequency of elements in JavaScript
ProblemWe are required to write a JavaScript function that takes in an array of numbers, arr, as the first and the only argument.The array arr, might contain some duplicates. Our function is supposed to sort the array in such a way that the elements that appear for least number of times are placed first followed by elements in increasing frequency.If two elements appear for the same number of times in the array then they should be placed in increasing order.For example, if the input to the function isInputconst arr = [5, 4, 5, 4, 2, 1, 12];Outputconst output = [1, ...
Read MoreMinimum deletion sum of characters in JavaScript
ProblemWe are required to write a JavaScript function that takes in two strings of English lowercase alphabets, str1 and str2, as the first and the second argument respectively.Our function is supposed to find and return the lowest ASCII sum of deleted characters to make two strings equal.For example, if the input to the function isInputconst str1 = 'sea'; const str2 = 'eat';Outputconst output = 231;Output ExplanationDeleting "s" from "sea" adds the ASCII value of "s" (115) to the sum.Deleting "t" from "eat" adds 116 to the sum.At the end, both strings are equal, and 115 + 116 = 231 is ...
Read MoreProduct of subarray just less than target in JavaScript
ProblemWe are required to write a JavaScript function that takes in an array of numbers, arr, as the first argument, and a number, target, as the second argument.Our function is supposed to count and return the number of (contiguous) subarrays where the product of all the elements in the subarray is less than target.For example, if the input to the function isInputconst arr = [10, 5, 2, 6]; const target = 100;Outputconst output = 8;Output ExplanationThe 8 subarrays that have product less than 100 are −[10], [5], [2], [6], [10, 5], [5, 2], [2, 6], [5, 2, 6].Note that [10, ...
Read MoreFinding maximum length of common subarray in JavaScript
ProblemWe are required to write a JavaScript function that takes in two arrays of literals, arr1 and arr2, as the first and the second argument respectively.Our function is supposed to return the maximum length of a subarray that appears in both arrays.For example, if the input to the function isInputconst arr1 = [1, 2, 3, 2, 1]; const arr2 = [3, 2, 1, 4, 7];Outputconst output = 3;Output ExplanationThe repeated subarray with maximum length is [3, 2, 1].ExampleFollowing is the code − Live Democonst arr1 = [1, 2, 3, 2, 1]; const arr2 = [3, 2, 1, 4, 7]; const maximumLength ...
Read MoreFinding state after all collisions in JavaScript
ProblemWe are required to write a JavaScript function that takes in an array, arr, that represents the positions of different asteroids in a one-dimensional space.For each asteroid, the absolute value represents its size, and the sign represents its direction (positive meaning right, negative meaning left). Each asteroid moves at the same speed.Our function is supposed to find out the state of the asteroids after all collisions. If two asteroids meet, the smaller one will explode. If both are the same size, both will explode. Two asteroids moving in the same direction will never meet.For example, if the input to the ...
Read MoreJust smaller number with monotone digits in JavaScript
Monotonically Increasing DigitsAn integer has monotone increasing digits if and only if each pair of adjacent digits x and y satisfy x { const checkMonotone = (x) =>{ if (x = nextDigit) { currentDigit = nextDigit x = next } else { return false } } return true } if (checkMonotone(num)) { return num } const digits = num.toString().split('').map(x => Number(x)) return digits.reduce((acc, num, index) => { if (num >= 1) { const current = parseInt(digits.slice(0, index).join('') + num - 1 + new Array(digits.length - index - 1).fill('9').join(''), 10) if (checkMonotone(current)) { return Math.max( acc,current) } } return acc }, 0) } console.log(monotoneIncreasingDigits(num));Output299
Read MoreFinding distance to next greater element in JavaScript
ProblemWe are required to write a JavaScript function that takes in an array of numbers, arr, as the first and the only argument.Our function should construct a new array for the input in which each corresponding element is the distance to the next greater element than the current element, and if there is no greater element to the right of the current element, we should push 0 for that corresponding element in the res array and finally we should return this array.For example, if the input to the function isInputconst arr = [12, 13, 14, 11, 16, 10, 12, 17, ...
Read MoreConvert mixed case string to lower case in JavaScript
ProblemWe are required to write a JavaScript function convertToLower() that takes in a string method that converts the string it is being called upon into lowercase string and returns the new string.For example, if the input to the function isInputconst str = 'ABcD123';Outputconst output = 'abcd123';ExampleFollowing is the code − Live Democonst str = 'ABcD123'; String.prototype.convertToLower = function(){ let res = ''; for(let i = 0; i < this.length; i++){ const el = this[i]; const code = el.charCodeAt(0); if(code >= 65 && code
Read MoreSplitting a string into maximum parts in JavaScript
ProblemWe are required to write a JavaScript function that takes in a string, str, as the first and the only argument.The purpose of our function is to partition this string into as many parts as possible so that each letter appears in at most one part, and return an array of integers representing the size of these parts.For example, if the input to the function isInputconst str = "ababcbacadefegdehijhklij";Outputconst output = [9, 7, 8];Output ExplanationThe partition is "ababcbaca", "defegde", "hijhklij". This is a partition so that each letter appears in at most one part. A partition like "ababcbacadefegde", "hijhklij" is ...
Read More