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 392 of 534
Nearest Prime to a number - JavaScript
We are required to write a JavaScript function that takes in a number and returns the first prime number that appears after n.For example: If the number is 24,Then the output should be 29ExampleFollowing is the code −const num = 24; const isPrime = n => { if (n===1){ return false; }else if(n === 2){ return true; }else{ for(let x = 2; x < n; x++){ if(n % x === 0){ return false; } } return true; }; }; const nearestPrime = num => { while(!isPrime(++num)){}; return num; }; console.log(nearestPrime(24));OutputFollowing is the output in the console −29
Read MoreChecking the intensity of shuffle of an array - JavaScript
An array of numbers is 100% shuffled if no two consecutive numbers appear together in the array (we only consider the ascending order case here). And it is 0% shuffled if pairs are of consecutive numbers.For an array of length n there will be n-1 pairs of elements (without distorting its order).We are required to write a JavaScript function that takes in an array of numbers and returns a number between [0, 100] representing the intensity of shuffle in the arrayExampleFollowing is the code −const arr = [4, 23, 1, 23, 35, 78, 4, 45, 7, 34, 7]; // this function calculates deviation from ascending sort const shuffleIntensity = arr => { let inCorrectPairs = 0; if(arr.length
Read MoreRandom name generator function in JavaScript
We are required to write a JavaScript function that takes in a number n and returns a random string of length n containing no other than the 26 English lowercase alphabetsExampleLet us write the code for this function −const num = 8; const randomNameGenerator = num => { let res = ''; for(let i = 0; i < num; i++){ const random = Math.floor(Math.random() * 27); res += String.fromCharCode(97 + random); }; return res; }; console.log(randomNameGenerator(num));OutputFollowing is the output in the console −kdcwpingNote − This is one of many possible outputs. Console output is expected to differ every time/
Read MoreFinding the nth day from today - JavaScript (JS Date)
We are required to write a JavaScript function that takes in a number n as the only input.The function should first find the current day (using Date Object in JavaScript) and then the function should return the day n days from today.For example −If today is Monday and n = 2, Then the output should be −WednesdayExampleFollowing is the code −const num = 15; const findNthDay = num => { const weekday=new Array(7); weekday[1]="Monday"; weekday[2]="Tuesday"; weekday[3]="Wednesday"; weekday[4]="Thursday"; weekday[5]="Friday"; weekday[6]="Saturday"; weekday[7]="Sunday" const day = new Date().getDay(); const daysFromNow = num % ...
Read MoreBeginning and end pairs in array - JavaScript
We are required to write a JavaScript function that takes in an array of Number / String literals and returns another array of arrays. With each subarray containing exactly two elements, the nth element from start nth from last.For example −If the array is −const arr = [1, 2, 3, 4, 5, 6];Then the output should be −const output = [[1, 6], [2, 5], [3, 4]];ExampleFollowing is the code −const arr = [1, 2, 3, 4, 5, 6]; const edgePairs = arr => { const res = []; const upto = arr.length % 2 === 0 ? arr.length ...
Read MoreFind the primorial of numbers - JavaScript
The primorial of a number n is equal to the product of first n prime numbers.For example, if n = 4Then, the output primorial(n) is, 2*3*5*7 = 210We are required to write a JavaScript function that takes in a number and returns its primordial.ExampleFollowing is the code −const num = 4; const isPrime = n => { if (n===1){ return false; }else if(n === 2){ return true; }else{ for(let x = 2; x < n; x++){ if(n % x === 0){ ...
Read MoreCount the number of data types in an array - JavaScript
We are required to write a JavaScript function that takes in an array that contains elements of different data types and the function should return a map representing the frequency of each data type.Let’s say the following is our array −const arr = [23, 'df', undefined, null, 12, { name: 'Rajesh' }, [2, 4, 7], 'dfd', null, Symbol('*'), 8];ExampleFollowing is the code −const arr = [23, 'df', undefined, null, 12, { name: 'Rajesh'}, [2, 4, 7], 'dfd', null, Symbol('*'), 8]; const countDataTypes = arr => { return arr.reduce((acc, val) => { const dataType ...
Read MoreChecking if two arrays can form a sequence - JavaScript
We are required to write a JavaScript function that takes in two arrays of numbers.And the function should return true if the two arrays upon combining and shuffling can form a consecutive sequence, false otherwise.For example − If the arrays are −const arr1 = [4, 6, 2, 9, 3]; const arr2 = [1, 5, 8, 7];Then the output should be true.ExampleFollowing is the code −const arr2 = [1, 5, 8, 7]; const canFormSequence = (arr1, arr2) => { const combined = [...arr1, ...arr2]; if(combined.length < 2){ return true; }; combined.sort((a, b) => a-b); ...
Read MoreExpressing numbers in expanded form - JavaScript
Suppose we are given a number 124 and are required to write a function that takes this number as input and returns its expanded form as a string.The expanded form of 124 is −'100+20+4'ExampleFollowing is the code −const num = 125; const expandedForm = num => { const numStr = String(num); let res = ''; for(let i = 0; i < numStr.length; i++){ const placeValue = +(numStr[i]) * Math.pow(10, (numStr.length - 1 - i)); if(numStr.length - i > 1){ res += `${placeValue}+` }else{ res += placeValue; }; }; return res; }; console.log(expandedForm(num));OutputFollowing is the output in the console −100+20+5
Read MoreFinding the element larger than all elements on right - JavaScript
We are required to write a JavaScript function that takes in an array of numbers and returns a subarray that contains all the element from the original array that are larger than all the elements on their right.ExampleFollowing is the code −const arr = [12, 45, 6, 4, 23, 23, 21, 1]; const largerThanRight = (arr = []) => { const creds = arr.reduceRight((acc, val) => { let { largest, res } = acc; if(val > largest){ res.push(val); largest = val; }; return { largest, res }; }, { largest: -Infinity, res: [] }); return creds.res; }; console.log(largerThanRight(arr));OutputFollowing is the output in the console −[ 1, 21, 23, 45 ]
Read More