Given an array of size n, the task is to find the minimum number of operations required in the array such that the product of… Read More
Tag Archives: maths-power
Given two integers P and Q, the task is to check whether a pair (P, Q) is equal or not, and a pair is said… Read More
Given an array A[] having N positive integers, the task is to find the minimum number of steps to build this array from an initial… Read More
Given an integer N, the task is to calculate the maximum number of times N can be divided by an integer K, where K is… Read More
Given 4 integers A, B, Z1, and Z2. The task is to compare A*10Z1 and B*10Z2. Examples: Input: A = 19, Z1 = 2, B… Read More
Given two numbers N and M(M > 1), the task is to find the highest power of M that divides N. Examples: Input: N =… Read More
Given a number N, the task is to find the minimum number of operations to convert the given integer into any power of K where… Read More
Given two integers N & K. The task is to find the nearest power of K for the integer N. If there are two nearest… Read More
Given two integers L and R. The task is to find the sum of all the odd numbers which are perfect square in the range… Read More
Given a non-negative integer N, the task is to check if that integer can be represented as a summation of multiples of 3, 5, and… Read More
Given string str of size N, the task is to print the characters of string whose frequency is a power of K in a lexicographically… Read More
Given an array arr[] with N non-negative integers, find the maximum number of elements that are the same non-negative powers of their indices. arr[i] =… Read More
Given an array arr[] with N non-negative integers, the task is to find the number of elements that are Kth powers of their indices, where… Read More
Given a positive integer N, the task is to express 2^N in the sum of powers of 2 and in exactly N+1 terms. Print those… Read More
Given two positive integers N and K. The task is to find the Kth number that can be written as the sum of different non-negative… Read More
