Is it possible to find maximum sum of two numbers in an unsorted array such that the numbers are not adjacent to each other in O(N)?
Given n real numbers, how can I find two of them, such that the sum |x+y| is minimal for all possible choices of x and y, at a better running time than O(n^2)?