title: How to find all pairs in an array such that the sum of the pair equals the product of the pair efficiently?
body: <p>I know the brute-force approach. Is there a way to do it in less than O(N<sup>2</sup>) complexity?</p>