Count Numbers Upto N that are Both Perfect Square and Perfect Cube in C++

Sunidhi Bansal
Updated on 31-Aug-2020 08:19:15

5K+ Views

We are given a number N. The goal is to count the numbers upto N that are perfect squares as well as perfect cubes. For example, 1, 64 are both perfect squares and perfect cubes.We will use sqrt() to calculate square root and cbrt() to calculate cube root of a number.Let’s understand with examples.Input − N=100Output − Count of numbers that are perfect squares and cubes − 2Explanation − 1 and 64 are only numbers from 1 to 100 that are both perfect squares and cubes.Input − N=5000Output −Count of numbers that are perfect squares and cubes − 3Explanation − ... Read More

Count Numbers with Unit Digit K in Given Range in C++

Sunidhi Bansal
Updated on 31-Aug-2020 08:16:53

582 Views

We are given an interval [first, last]. The goal is to find the count of numbers that have a unit digit k and lie between range [first, last].We will do this by traversing from i=first to i=last. For each number i compare its unit digit with the k, if they are the same increment the count.Let’s understand with examples.Input − first=8 last=40 , k=8Output − Count of numbers with unit digit k − 4Explanation −Numbers between 8 and 40 with unit digit = 8 8, 18, 28, 38Input − first=100 last=200 , k=9Output − Count of numbers with unit digit ... Read More

Determine Array Having Majority Element in JavaScript

AmitDiwan
Updated on 31-Aug-2020 07:09:46

181 Views

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

Equality of Two Arrays in JavaScript

AmitDiwan
Updated on 31-Aug-2020 07:03:35

402 Views

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

Check if String1 Ends with String2 in JavaScript

AmitDiwan
Updated on 31-Aug-2020 07:00:38

137 Views

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

Check for Ugly Number in JavaScript

AmitDiwan
Updated on 31-Aug-2020 06:59:27

1K+ Views

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

Reverse All the Words of a Sentence in JavaScript

AmitDiwan
Updated on 31-Aug-2020 06:56:12

4K+ Views

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

Remove All Characters of First String from Second in JavaScript

AmitDiwan
Updated on 31-Aug-2020 06:53:32

403 Views

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

Smallest Positive Value That Cannot Be Represented as Sum of Subarray in JavaScript

AmitDiwan
Updated on 31-Aug-2020 06:52:36

172 Views

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

Return Top Two Elements from Array in JavaScript

AmitDiwan
Updated on 31-Aug-2020 06:51:08

346 Views

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

Advertisements