In this problem, we are given two values n and a prime number p. Our task is to find Square Root under Modulo p (When p is in form of 4*i + 3). Here, p is of the form (4*i + 3) i.e. p % 4 = 3 for i > 1 and p being a prime number.Here are some numbers, 7, 11, 19, 23, 31...Let's take an example to understand the problem, Input : n = 3, p = 7 Output :Solution ApproachA simple solution to the problem is using a loop. We will loop from 2 to (p ... Read More

In this problem, we are given a prime number N. Our task is to find the number of primitive roots modulo prime.Primitive Root of a number − It is a number (r) smaller than N which has all values of r^x(mod N) different for all X in range [0, n-2].Let’s take an example to understand the problem, Input : N = 5 Output : 2Solution ApproachA simple solution to the problem is based on a trial method. We will check for all numbers from 2 to (N-1) for the conditions with x ranging from [0, n-2] and break if a value ... Read More

In this problem, we are given N points that lie in a 2D plane. Our task is to find the number of points that have at least 1 point above, below, left or right of it.We need to count all the points that have at least 1 point which satisfies any of the below conditions.Point above it − The point will have the same X coordinate and the Y coordinate is one more than its current value.Point below it − The point will have the same X coordinate and the Y coordinate is one less than its current value.Point left ... Read More

In this problem, we are given an array arr of size n. Our task is to Find the number of operations required to make all array elements EqualThe operation is defined as distribution of equal weights from the element with maximum weight to all the elements of the array.If it is not possible to make array elements equal, print -1. Let’s take an example to understand the problem,  Input : arr[] = {7, 3, 3, 3} Output : 3ExplanationArray after distribution is {4, 4, 4, 4}Solution ApproachA simple solution to the problem is by finding the largest value of the array. ... Read More

In this problem, we are given a positive number of 1. Our task is to find the Nth binary string in sorted order.We need to find the Nth string in an infinite list of strings created using only two symbols a and b sorted in lexicographical order.The list is −a, b, aa, ab, ba, bb, aaa, aab, aba, …Let’s take an example to understand the problem, Input : N = 8 Output : aabSolution ApproachA simple solution to the problem is by using loops to generate all n strings. And then return the Nth string. This solution does the work ... Read More

In this problem, we are given a graph of N nodes. Our task is to Find the maximum possible value of the minimum value of the modified array.For the graph we have a permutation of nodes which is the number of induces with minimum 1 node on the left of it sharing a common edge.Let’s take an example to understand the problem, Input : N = 4, edge = {{1, 2}, {2, 3}, {3, 4}, {4, 1}} Output : 3Solution ApproachA simple solution to the problem is by traversing the tree from one node visiting all its adjacent nodes. We ... Read More

In this problem, we are given an array arr[] of size n and a number S. Our task is to Find the maximum possible value of the minimum value of the modified array.Here, are the rules to modify the array, The difference between the sum of the array elements before and after modification should be S.Negative values in the modified array are not allowed.If the modified array, the minimum values of the array need to be maximized.The modification of the array can be done by increasing or decreasing any element of the array.Using these constraints, we need to find the ... Read More

In this problem, we are given an array of characters all in lowercase. Our task is to Maximum occurrence of prefix in the Array.We need to count the occurrence of non-empty prefixes whose occurrence count is maximum.Let’s take an example to understand the problem, Input : string = “xyyzkxyyzk” Output : 2Solution ApproachThe logic is to visualize that the prefix of an array must always, obviously, contain the first character of the string and so would be its repeating occurrences. And the first character of a string is obviously a prefix with the least number of characters. So the maximum ... Read More

In this problem, we are given a number N. Our task is to find the number of divisors of all numbers in the range [1, n].Let’s take an example to understand the problem,Input : N = 7 Output : 1 2 2 3 2 4 2Solution ApproachA simple solution to the problem is by starting from 1 to N and for every number count the number of divisors and print them.Example 1Program to illustrate the working of our solution#include using namespace std; int countDivisor(int N){    int count = 1;    for(int i = 2; i

In this problem, we are given a number N which is the size of an array consisting of all zeros and Q queries each of the following type −update(s, e, val ) -> this query will update all elements from s to e (both inclusive) to val.Our task is to find the number of different numbers in the array after applying the given operation q timesLet’s take an example to understand the problem, Input : N = 6, Q = 2 Q1 = update(1, 4, 3) Q2 = update(0, 2, 4) Output : 2ExplanationInitial array, arr[] = {0, 0, ... Read More