Round 1
Questions:
-
Problem - 1: Given an array of unique elements, count the number of pairs such that their absolute difference is equal to a given target K.
Constraints: N <= 10^5 -
Problem - 2: Count the number of sub-arrays in an array of positive elements such that the sub-array product is equal to K.
Constraints: N <= 10^5, K <= 100
Candidate's Approach
The candidate solved both problems in 6 minutes, indicating a quick and efficient approach to the problems presented.
Interviewer's Feedback
No feedback provided.