Given an integer k and array of length N find the min no of move to make all the elements divisible by k. In one move you can go one of the Read more →
cpp-map
2 postsGiven an integer array arr[] and K, the task is to count the number of elements ‘A[i]’, such that A[i] * K is also present in the array. Note: If there are Read more →