## Fibonacci Power

Given a number n. You are required to find ( Fib(n) ^ Fib(n) ) % 10^9 + 7, where Fib(n) is the nth fibonacci number.… Read More »

- Sum of the series 1^1 + 2^2 + 3^3 + ..... + n^n using recursion
- Larger of a^b or b^a (a raised to power b or b raised to power a)
- Sum of minimum element of all sub-sequences of a sorted array
- Total number of subsets in which the product of the elements is even
- Count number of trailing zeros in (1^1)*(2^2)*(3^3)*(4^4)*..
- Minimum removals in a number to be divisible by 10 power raised to K
- Ways to paint N paintings such that adjacent paintings don't have same colors
- Find the multiple of x which is closest to a^b
- Minimum number of given powers of 2 required to represent a number
- Count of numbers having only 1 set bit in the range [0, n]
- Find 2^(2^A) % B
- Print all integers that are sum of powers of two given numbers
- Largest subset where absolute difference of any two element is a power of 2
- Maximum GCD from Given Product of Unknowns
- Find the count of numbers that can be formed using digits 3, 4 only and having length at max N.
- Count number of binary strings of length N having only 0's and 1's
- Third last digit in 5^N for given N
- Check if a number can be represented as sum of non zero powers of 2
- Power in Mathematics
- Fibonacci Power

Given a number n. You are required to find ( Fib(n) ^ Fib(n) ) % 10^9 + 7, where Fib(n) is the nth fibonacci number.… Read More »

Given an integer N, the task is to count the number of binary strings of length N having only 0’s and 1’s. Note: Since the… Read More »

Given two integers A and B, the task is to calculate 22A % B. Examples: Input: A = 3, B = 5 Output: 1 223… Read More »

Given an integer n, the task is to count the numbers having only 1 set bit in the range [0, n]. Examples: Input: n =… Read More »

Given an integer n, the task is to find the sum of the series 11 + 22 + 33 + ….. + nn using recursion.… Read More »

Given a positive integer N. The task is to find the value of 3rd digit from last (right-most) of 5N. Examples: Input : N =… Read More »

Given a number N. Find the count of such numbers that can be formed using digits 3 and 4 only and having length at max… Read More »

Given an integer N, the task is to check whether N can be represented as the sum of powers of 2 where all the powers… Read More »

Given a sorted array A of n integers. The task is to find the sum of minimum of all possible subsequences of A. Note: Considering… Read More »

Given an integer x and an array arr[] each element of which is a power of 2. The task is to find the minimum number… Read More »

Given two integers N and P where P is the product of N unknown integers, the task is to find the GCD of those integers.… Read More »

Given an integer n, the task is to find the number of trailing zeros in the function i.e. f(n) = 11 * 22 * 33… Read More »

Given an array arr[] of distinct elements -109 ≤ ai ≤ 109. The task is to find the largest sub-set from the given array such… Read More »

Given two integers n and m, where n represent some paintings numbered from 1 to n and m represent some colours 1 to m with… Read More »

Given three non-negative integers x, y and bound, the task is to print all the powerful integer ≤ bound in sorted order. A powerful integer… Read More »