Write java code to find out if it exists that the sum of three integers is zero among a sequence integers.
Sigiloso
This post is useful! Their proposed algorithm's time complexity is O(N^2) http://stackoverflow.com/questions/2070359/finding-three-elements-in-an-array-whose-sum-is-closest-to-an-given-number