## Modulo of a large Binary String

Given a large binary string str and an integer K, the task is to find the value of str % K. Examples: Input: str =… Read More »

Given a large binary string str and an integer K, the task is to find the value of str % K. Examples: Input: str =… Read More »

Given an array arr[] of integers and an integer K. The task is to sort the elements of the given array in the increasing order… Read More »

Given two very large numbers L and R where L ≤ R, the task is to compute the sum of all the natural numbers from… Read More »

Given four integers A, B, K, M. The task is to find (A + iB)K % M which is a complex number too. A +… Read More »

Given two integers A and B. The task is to find the count of all possible values X such that A % X = B.… Read More »

Given an integer K, the task is to find the length of the smallest no. N which is divisible by K and formed by using… 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 three integers X, N and M. The task is to find XXX…(N times) % M where X can be any digitfrom the range [1,… Read More »

Given a string str representing a large integer, the task is to find the result of N % 4. Examples: Input: N = 81 Output:… Read More »

Given three positive integers N, A and B. The task is to count the numbers of length N containing only digits A and B and… Read More »

Given an integer n, the task is to count the number of pairs (i, j) such that ((n % i) % j) % n is… Read More »

Given two positive integers n and k. Find minimum positive integer x such that the (x % k) * (x / k) == n, where… Read More »

Given an array arr[] of integers, the task is to find the LCM of all the elements of the array modulo M where M =… Read More »

Given two integers A and B where A is not divisible by B, the task is to express A / B as a natural number… Read More »

Given a prime . The task is to count all the primitive roots of . A primitive root is an integer x (1 <= x… Read More »