Programming Basic

Problem - 4795

A numeric array of length $N$ is given. We need to design a function that finds all positive numbers in the array that have their opposites in it as well. Describe approaches for solving optimal worst case and optimal average case performance, respectively.


This problem is essentially the same as # 4793 where target = $0$.

 

report an error