Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
We are required to write a JavaScript function that takes in a number and checks whether it is a Fibonacci number or not (i.e., it falls in Fibonacci series or not).Our function should return true if the number is a Fibonacci number, false otherwise.The code for this will be −const num = 2584; const isFibonacci = num => { if(num === 0 || num === 1){ return true; } let prev = 1; let count = 2; let temp = 0; while(count
Suppose, we have a sorted array of literals like this −const arr = [32, 32, 63, 63, 63, 75, 75, 86, 87, 88, 89];We are required to write a JavaScript function that takes in one such array and returns the first unique number in the array.If there is no such number in the array, our function should return false.For this array, the output should be 86.The code for this will be −const arr = [32, 32, 63, 63, 63, 75, 75, 86, 87, 88, 89]; const firstUnique = arr => { let appeared = false; for(let i = ... Read More
We are required to write a JavaScript function that takes in an array of Numbers and returns the smallest number from it using recursion.Let’s say the following are our arrays −const arr1 = [-2, -3, -4, -5, -6, -7, -8]; const arr2 = [-2, 5, 3, 0];The code for this will be −const arr1 = [-2, -3, -4, -5, -6, -7, -8]; const arr2 = [-2, 5, 3, 0]; const min = arr => { const helper = (a, ...res) => { if (!res.length){ return a; }; ... Read More
We are required to write a JavaScript function that takes in a number and returns an English count number for it.For example 3 returns 3rdThe code for this will be −const num = 3; const englishCount = num => { if (num % 10 === 1 && num % 100 !== 11){ return num + "st"; }; if (num % 10 === 2 && num % 100 !== 12) { return num + "nd"; }; if (num % 10 === 3 && num % 100 !== 13) { return num + "rd"; }; return num + "th"; }; console.log(englishCount(num)); console.log(englishCount(111)); console.log(englishCount(65)); console.log(englishCount(767));Following is the output on console −3rd 111th 65th 767th
Suppose, we have a string that contains some capitalized English alphabets like this −const str = "Connecting to server Connection has been successful We found result";We are required to write a JavaScript function that takes in one such string and inserts a comma ', ' before the space before every capital letter in the string.The code for this will be −const str = "Connecting to server Connection has been successful We found result"; const capitaliseNew = str => { let newStr = ''; const regex = new RegExp(/.[A-Z]/g); newStr = str.replace(regex, ', $&'); return newStr; }; ... Read More
We are required to write a JavaScript function that takes in an array of numbers. The number should find the smallest element in the array and remove it in place.The code for this will be −const arr = [2, 1, 3, 2, 4, 5, 1]; const removeSmallest = arr => { const smallestCreds = arr.reduce((acc, val, index) => { let { num, ind } = acc; if(val >= num){ return acc; }; ind = index; num = val; return { ind, num }; }, { num: Infinity, ind: -1 }); const { ind } = smallestCreds; if(ind === -1){ return; }; arr.splice(ind, 1); }; removeSmallest(arr); console.log(arr);Following is the output on console −[ 2, 3, 2, 4, 5, 1 ]
Given a non-negative integer, we are required to write a function that returns an array containing a list of independent digits in reverse order.For example:348597 => The correct solution should be [7,9,5,8,4,3]The code for this will be −const num = 348597; const reverseArrify = num => { const numArr = String(num).split(''); const reversed = []; for(let i = numArr.length - 1; i >= 0; i--){ reversed[i] = +numArr.shift(); }; return reversed; }; console.log(reverseArrify(num));Following is the output on console −[ 7, 9, 5, 8, 4, 3 ]
We are required to write a JavaScript function that takes in an array of numbers that contains at least one duplicate pair of numbers.Our function should return the distance between all the duplicate pairs of numbers that exist in the array.The code for this will be −const arr = [2, 3, 4, 2, 5, 4, 1, 3]; const findDistance = arr => { var map = {}, res = {}; arr.forEach((el, ind) => { map[el] = map[el] || []; map[el].push(ind); }); Object.keys(map).forEach(el => { if (map[el].length > ... Read More
Suppose, we have a string that contains words separated by hyphens like this −const str = 'this-is-an-example';We are required to write a JavaScript function that takes in one such string and converts it into a camelCase string.For the above string, the output should be −const output = 'thisIsAnExample';The code for this will be −const str = 'this-is-an-example'; const changeToCamel = str => { let newStr = ''; newStr = str .split('-') .map((el, ind) => { return ind && el.length ? el[0].toUpperCase() + el.substring(1) : el; }) .join(''); return newStr; }; console.log(changeToCamel(str));Following is the output on console −thisIsAnExample
We are required to write a JavaScript function that takes in an array of Numbers as the first argument and a Number as the second argument.The function should return an array of two numbers from the original array whose sum is closest to the number provided as the second argument.The code for this will be −const arr = [1, 2, 3, 4, 5, 6, 7]; const num = 14; const closestPair = (arr, sum) => { let first = 0, second = 0; for(let i in arr) { for(let j in arr) { ... Read More