It was a hackerrank test with 2 problems and 75 mins to solve. Luckily, test was very easy.

Problem - 1
Given an array of unique elements, count number of pairs such that their absolute difference is equal to a given target K.
N <= 10^5

Problem - 2
Count the number of sub-arrays in an array of positive elements such that sub array product is equal to K.
N <= 10^5, K <= 100

Solved both in 6 minutes. Will update about further rounds if I get a interview call