Count pairs in array divisible by K

PHOTO EMBED

Mon Oct 10 2022 02:34:54 GMT+0000 (Coordinated Universal Time)

Saved by @Ranjan_kumar #c++

class Solution
{
    public:
    long long countKdivPairs(int A[], int n, int K)
    {
        //code here
        long ans=0;
        unordered_map<int,int>m;
        for(int i=0;i<n;i++)
        {
            int rem=A[i]%K;
            if(rem!=0)
            {
                ans+=m[K-rem];
            }
            else ans+=m[0];
            m[rem]++;
        }
        return ans;
    }
};
content_copyCOPY

Medium level paypal

https://practice.geeksforgeeks.org/problems/count-pairs-in-array-divisible-by-k/1?page=1&company[]=PayPal&sortBy=submissions