Given an integer array **arr[]** of size **N**, the task is to find contiguous pair **{a, b}** such that sum of both elements in the pair is maximum. If there are more than one such pairs with maximum sum then print any of such pair. In the case of multiple pairs with the largest sum, print any one of them.

**Examples:**

Input:arr[] = {1, 2, 3, 4}

Output:3 4

Explanation:

Here, the contiguous pairs in the array are:

{1, 2} -> Sum 3

{2, 3} -> Sum 5

{3, 4} -> Sum 7

Maxiumum sum is7for the pair is(3, 4)so this is answer.

Input:arr[] = {11, -5, 9, -3, 2}

Output:11 -5

The contiguous pairs with their respective sums are :

{11, -5} -> Sum 6

{-5, 9} -> Sum 4

{9, -3} -> Sum 6

{-3, 2} -> Sum -1

The maximum sum obtained is 6 from the pairs (11, -5) and (9, -3).

**Approach:**

Follow the steps below to solve the problem:

- Generate all the continuous pairs one by one and calculate there sum.
- Compare the sum of every pair with the maximum sum and update the pair corresponding to the maximum sum accordingly.
- Return the pair representing the maximum sum.

Below is the implementation of the above approach :

## Python3

`# Python program to find the ` `# a contiguous pair from the ` `# which has the largest sum ` ` ` `# importing sys ` `import` `sys ` ` ` `# Function to find and return ` `# the largest sum contiguous pair ` `def` `largestSumpair(arr, n): ` `# Stores the contiguous pair ` ` ` `pair ` `=` `[] ` ` ` `# Intialize maximum sum ` ` ` `max_sum ` `=` `-` `sys.maxsize` `-` `1` ` ` ` ` `for` `i ` `in` `range` `(` `1` `, n): ` ` ` ` ` `# Compare sum of pair with max_sum ` ` ` `if` `max_sum < ( arr[i] ` `+` `arr[i` `-` `1` `] ): ` ` ` `max_sum ` `=` `arr[i] ` `+` `arr[i` `-` `1` `] ` ` ` ` ` `if` `pair ` `=` `=` `[]: ` ` ` `# Insert the pair ` ` ` `pair.append(arr[i` `-` `1` `]) ` ` ` `pair.append(arr[i]) ` ` ` `else` `: ` ` ` `pair[` `0` `] ` `=` `arr[i` `-` `1` `] ` ` ` `pair[` `1` `] ` `=` `arr[i] ` ` ` ` ` `return` `pair ` ` ` ` ` `# Driver Code ` `arr ` `=` `[` `11` `, ` `-` `5` `, ` `9` `, ` `-` `3` `, ` `2` `] ` `N ` `=` `len` `(arr) ` `pair ` `=` `largestSumpair(arr, N) ` `print` `(pair[` `0` `], end ` `=` `" "` `) ` `print` `(pair[` `1` `], end ` `=` `" "` `) ` |

*chevron_right*

*filter_none*

**Output:**

11 -5

**Time Complexity:** O(N)

**Auxiliary Space:** O(1)

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Find the smallest contiguous sum pair in an Array
- Pair with largest sum which is less than K in the array
- K-th Largest Sum Contiguous Subarray
- Largest Sum Contiguous Subarray
- Largest Ratio Contiguous subarray
- Largest sum contiguous increasing subarray
- Given a sorted array and a number x, find the pair in array whose sum is closest to x
- Range query for Largest Sum Contiguous Subarray
- Length of the largest subarray with contiguous elements | Set 1
- Largest sum contiguous subarray having only non-negative elements
- Find pair with maximum GCD in an array
- Find a pair from the given array with maximum nCr value
- Number of indices pair such that element pair sum from first Array is greater than second Array
- Find a pair (n,r) in an integer array such that value of nCr is maximum
- Find a pair (n,r) in an integer array such that value of nPr is maximum
- Find pair with maximum ratio in an Array
- Find pair with greatest product in array
- Find the maximum sum pair in an Array with even parity
- Given an absolute sorted array and a number K, find the pair whose sum is K
- Find Unique pair in an array with pairs of numbers

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.