How to find the sum of sub -arrays in an int array and return the largest sum value and the index position of those two elements

Well, as the question is asking for the "index position of those two elements", I assume that the only sub-arrays which are of interest are those with two elements.

In an array of size 'n', there will be 'n' ways of selecting the first element and 'n-1' ways of selecting the second element. So, altogether, there will be n * (n-1) / 2 combinations to consider and work out their sums, remembering that you're not interested in the order of the two elements - the sum is the same either way :)

So all you need to do is to set up a double 'for' loop (with indices i and j( > i) say), work out i + j and test whether it's greater than the previous highest total and record the indices of the highest combination as you go.

1 Reply

Know the answer? Post it — somebody with the same question will find it here.

Alan18y ago
Well, as the question is asking for the "index position of those two elements", I assume that the only sub-arrays which are of interest are those with two elements.

In an array of size 'n', there will be 'n' ways of selecting the first element and 'n-1' ways of selecting the second element. So, altogether, there will be n * (n-1) / 2 combinations to consider and work out their sums, remembering that you're not interested in the order of the two elements - the sum is the same either way :)

So all you need to do is to set up a double 'for' loop (with indices i and j( > i) say), work out i + j and test whether it's greater than the previous highest total and record the indices of the highest combination as you go.
+1