Check If an Integer Is a Power of 3 in C++

sudhir sharma
Updated on 01-Feb-2022 08:04:05

749 Views

In this problem, we are given an integer N. Our task is to find whether a given integer is a power of 3 or not.Let's take an example to understand the problem, Input : N = 729 Output : YesExplanation −36 = 719 Solution ApproachA solution to the problem is by checking for the value that is power of 3. We will check if the given number N divides 1162261467 (319). If it is a power of 3, the remainder with be 0 i.e. N will divide it. If it does not, the number is not the power of 3.ExampleProgram ... Read More

Find Value of y Mod 2 Raised to Power x in C++

sudhir sharma
Updated on 01-Feb-2022 08:00:18

209 Views

In this problem, we are given two values x and y. Our task is to find value of y mod (2 raised to power x).Let's take an example to understand the problem, Input : x = 2, y = 19 Output : 3Explanation −y % 2x = 19 % 22 = 19 % 4 = 3 Solution ApproachA simple solution to the problem is by directly calculating the value of 2x using the pow() function and then finding the value of y % 2x.Another approach to solve the problem is by using log. For the value of y < 2x, ... Read More

Find Value of K-th Bit in Binary Representation in C++

sudhir sharma
Updated on 01-Feb-2022 07:31:06

408 Views

In this problem, we are given two values n and k. Our task is to find value of k-th bit in binary representation.Let's take an example to understand the problem, Input : n= 5, k = 2 Output : 0Explanation −Binary of 5 = 0101 Second LSB bit is 0.Solution ApproachA solution to the problem is by performing bitwise AND of the binary conversion of the number N with a number with all bits unset and one bit set which is at kth position, to get the result.ExampleProgram to illustrate the working of our solution, #include using namespace std; ... Read More

Find Value of n-1 + n-2 + n-3 + n-4 mod 5 in C++

sudhir sharma
Updated on 01-Feb-2022 07:26:40

235 Views

In this problem, we are given a value n. Our task is to find value of (n^1 + n^2 + n^3 + n^4) mod 5 for given n.Let's take an example to understand the problem, Input : n= 5 Output : 0Explanation −(51 + 52 + 53 + 54) mod 5 = (5 + 25 + 125 + 625) mod 5 = (780) mode 5 = 0Solution ApproachA simple solution to the problem is by directly finding the value of the equation for the given value of N and then calculating its modulus with 5.ExampleProgram to illustrate the working of ... Read More

Future of Home Automation

sudhir sharma
Updated on 01-Feb-2022 07:23:07

3K+ Views

Home Automation is creating new automation technologies for houses that will make them smart using internet-based technologies. These homes/houses that use home automation technologies are smart Homes.This field of home automation is fastly emerging in technology making homes safer and better places to live. These features help users to virtually monitor and control home attributes like lights, entertainment systems, security, climate control, etc.FUTURE OF HOME AUTOMATIONHome Automation is getter popular day by day making it the basic requirement for future homes which will be smart enough to provide the best possible comfort to people. This technology has a lot of ... Read More

First Element That Appears Even Number of Times in an Array in C++

sudhir sharma
Updated on 01-Feb-2022 07:22:24

246 Views

In this problem, we are given an array arr[] consisting of N integer values. Our task is to create a program for finding the first element that appears even number of times in an array. If any element exists that satisfies the condition return it otherwise return -1 denoting false.Let's take an example to understand the problem, Input: arr[] = {2, 3, 7, 2, 3, 6, 4, 1, 2} Output: 3Solution ApproachA simple method to solve the problem is by considering each element of the array one by one and then checking the element's occurrence frequency even and returning the ... Read More

Frugal Number in C++

sudhir sharma
Updated on 01-Feb-2022 07:15:58

147 Views

In this problem, we are given a positive integer N. Our task is to create a program to check whether the given number is a Frugal number or not.FRUGAL NUMBER − A number whose number of digits is strictly greater than the number of digits in the prime factorization of the given number.Example − 625, prime factors of number 625 is 54.The number of digits in 625 is 3.The number of digits in 54 is 2.3 is strictly greater than 2. Hence, 625 is a frugal number.First few frugal number are − 125, 128, 243, 256, 343, 512, 625, etc.Let’s ... Read More

Flattening a Linked List in C++

sudhir sharma
Updated on 01-Feb-2022 06:41:02

460 Views

In this problem, we are given linked list consisting of two pointer nodes, right and down.Right node is the main linked list pointer.Down node is for secondary linked list starting with that node.All the linked lists are sorted.Our task is to create a program to flatten a linked list and the resulting list will itself be a sorted one.Let’s take an example to understand the problemInputOutput1-> 9-> 8 -> 4 -> 6-> 7-> 2-> 3-> 5Solution ApproachA solution to the problem is using merge sort for a linked list. This method will merge the lists recursively in a sorted order ... Read More

Flatten a Multilevel Linked List in C++

sudhir sharma
Updated on 31-Jan-2022 12:54:39

547 Views

In this problem, we are given a multilevel linked list. Our task is to create a program to flatten a multilevel linked list.The flattening operation is done in such a way that the first level nodes will occur first in the linked list and then the second level nodes will occur.Multilevel linked list is a multi-dimensional data structure in which every node of the linked list has two link pointers, one a link to the next node and one to the child list with one or more nodes. This child pointer may or may not point to other list nodes.ExampleLet’s ... Read More

Fizz Buzz Implementation in C++

sudhir sharma
Updated on 31-Jan-2022 12:31:34

5K+ Views

In this problem, we will see the implementation and types of Fizz-Bizz problem.Fizz Buzz − it is a simple programming problem in which the programmer changes the occurrence o all multiples of 3 by ‘Fizz’ and all multiples of 5 by ‘Buzz’ in the numbers from 1 to 100.Let’s take an example to understand the problem1, 2, 'Fizz', 4, 'Buzz', 'Fizz' , 7, 8, 'Fizz' , 'Buzz', 11, 'Fizz' , 13, 14, 'Fizz Buzz' , 16, 17, 'Fizz' , 19, 'Buzz', ....Solution ApproachA simple approach to solving the problem is by simply using a loop from 1 to 100. And ... Read More

Advertisements