A very interesting problem found at hackerrank which is very easy and based on remainder and divisibility concept of mathematics. In this problem an array will be input, we have to count pairs from that array, whose sum is divisible by a specific given number 'k'. array size max 100.