Round 1
Questions:
A perfect pair (x, y) is such that
min( | x - y |, | x + y | ) <= min( | x |, | y |) && max( | x - y |, | x + y | ) >= max( | x |, | y |)
Given an array of unsorted integers, find the number of perfect pairs.
Example: [2, -3, 5]
(2, -3) and (-3, 5) are perfect pairs.
Can we do this better than n^2?
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.