cpp-map Archives - Cplusplus

Find the min number of move to make all the elements divisible by k

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 below operation. 1. For any index i we can do a[i] = a[i] + p 2. p = p + 1 The value of p starts… Read More »

Count of elements A[i] such that A[i] * K is also present in the Array

Given 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 duplicates in the array, count them separately. Examples: Input : arr = { 2, 4, 5, 7, 10}, K = 2 Output : 2 Explanation :… Read More »