Hi!

  I already solved this problem (on paper), but in O(n^2). How can I
solve it in O(n) or O(n logn)? Also, what are heaps?

     Thanks in advance!

> Hi!


>


>   I already solved this problem (on paper), but in O(n^2). How can I


> solve it in O(n) or O(n logn)? Also, what are heaps?


>


>      Thanks in advance!






Use Hesh Function !!!

Thanks, but what's hesh function?