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
Javascript Articles
Page 23 of 534
Number of carries required while adding two numbers in JavaScript
ProblemWe are required to write a JavaScript function that takes in two numbers.Our function should count the number of carries we are required to take while adding those numbers as if we were adding them on paper.Like in the following image while adding 179 and 284, we had used carries two times, so for these two numbers, our function should return 2.ExampleFollowing is the code −const num1 = 179; const num2 = 284; const countCarries = (num1 = 1, num2 = 1) => { let res = 0; let carry = 0; while(num1 + num2){ ...
Read MoreRemoving the second number of the pair that add up to a target in JavaScript
ProblemWe are required to write a JavaScript function that takes in an array of numbers and a target sum.Our function should remove the second number of all such consecutive number pairs from the array that add up to the target number.ExampleFollowing is the code −const arr = [1, 2, 3, 4, 5]; const target = 3; const removeSecond = (arr = [], target = 1) => { const res = [arr[0]]; for(i = 1; i < arr.length; i++){ if(arr[i] + res[res.length-1] !== target){ res.push(arr[i]); }; }; return res; }; console.log(removeSecond(arr, target));OutputFollowing is the console output −[ 1, 3, 4, 5 ]
Read MoreFinding the immediate bigger number formed with the same digits in JavaScript
ProblemWe are required to write a JavaScript function that takes in a number n. Our function should rearrange the digits of the numbers such that we form the smallest number using the same digits but just bigger than the input number.For instance, if the input number is 112. Then the output should be 121.ExampleFollowing is the code −const num = 112; const findNextBigger = (num = 1) => { const sortedDigits = (num = 1) => { return String(num) .split('') .sort((a, b) => b - a); }; let max = sortedDigits(num).join(''); max = Number(max); for(let i = num + 1; i
Read MoreInterchanging first letters of words in a string in JavaScript
ProblemWe are required to write a JavaScript function that takes in a string that contains exactly two words.Our function should construct and return a new string in which the first letter of the words are interchanged with each other.ExampleFollowing is the code −const str = 'hello world'; const interchangeChars = (str = '') => { const [first, second] = str.split(' '); const fChar = first[0]; const sChar = second[0]; const newFirst = sChar + first.substring(1, first.length); const newSecond = fChar + second.substring(1, second.length); const newStr = newFirst + ' ' + newSecond; return newStr; }; console.log(interchangeChars(str));OutputFollowing is the console output −wello horld
Read MoreNumber difference after interchanging their first digits in JavaScript
ProblemWe are required to write a JavaScript function that takes in an array of exactly two numbers. Our function should return the absolute difference between the numbers after interchanging their first digits.For instance, for the array [105, 413], The difference will be: |405 - 113| = 292ExampleFollowing is the code −const arr = [105, 413]; const interchangedDigitDiff = (arr = []) => { arr = arr.map(String); const [first, second] = arr; const fChar = first[0]; const sChar = second[0]; const newFirst = sChar + first.substring(1, first.length); const newSecond = fChar + second.substring(1, second.length); ...
Read MoreSearching for target string in a strangely sorted array in JavaScript
ProblemWe are required to write a JavaScript function that takes in a word target and an array of sorted(by length(increasing), number of uppercase letters(decreasing), natural order) unique words which always contains the target.The task of our function is to find the index(0 based) of the target in the array of words, which would always be in the list.ExampleFollowing is the code −const arr = ['cP', 'rE', 'sZ', 'am', 'bt', 'ev', 'hq', 'rx', 'yi', 'akC', 'nrcVpx', 'iKMVqsj']; const target = 'akC'; const findTarget = (arr = [], target = '') => { const index = arr.indexOf(target); return index; }; ...
Read MorePerforming power operations on an array of numbers in JavaScript
ProblemWe are required to write a JavaScript function that takes in an array of integers, arr, of even length.Suppose a number num where −num = (arr[0] * arr[0] + arr[1] * arr[1]) * (arr[2] * arr[2] + arr[3] * arr[3]) * … * (arr[n-2] * arr[n-2] + arr[n-1] * arr[n-1])Where n is the length of the array.Our function should find and return an array of two numbers [A, B] such that −A2 + B2 = numFor instance, if the array is −[1, 2, 3, 4]Then num = ( 1 + 4 ) * (9 + 16) = 125Then output should ...
Read MoreFinding reflection of a point relative to another point in JavaScript
Point Of Symmetry"Point reflection" or "point symmetry" is a basic concept in geometry where a given point, P, at a given position relative to a midpoint, Q has a corresponding point, P1, which is the same distance from Q but in the opposite direction.ProblemWe are required to write a JavaScript function that takes in two objects P and Q specifying two points in a 2-D plane.Our function should output the symmetric point of point P about Q.ExampleFollowing is the code −const p = { x: 6, y: -4 }; const q = { x: 11, y: 5 }; ...
Read MoreFinding the product of array elements with reduce() in JavaScript
ProblemWe are required to write a JavaScript function that takes in an array arr. Our function should find and return the product of all the elements of the array.ExampleFollowing is the code −const arr = [3, 1, 4, 1, 2, -2, -1]; const produceElements = (arr = []) => { const res = arr.reduce((acc, val) => { acc = acc * val; return acc; }, 1); return res; }; console.log(produceElements(arr));OutputFollowing is the console output −48
Read MoreEncoding decimal to factorial and back in JavaScript
ProblemCoding decimal numbers with factorials is a way of writing out numbers in a base system that depends on factorials, rather than powers of numbers.In this system, the last digit is always 0 and is in base 0!. The digit before that is either 0 or 1 and is in base 1!. The digit before that is either 0, 1, or 2 and is in base 2!, etc. More generally, the nth-to-last digit is always 0, 1, 2, ..., n and is in base n!.We will need two functions. The first one will receive a decimal number and return a ...
Read More