Pair Sum Problem Statement

You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

Note:

Each pair should be ordered such that the first value is less than or equal to the second value. The list of pairs should be sorted in non-decreasing order based on their first values. If two pairs have the same first value, the pair with the smaller second value should come first.

Input:

N S
ARR[0] ARR[1] ... ARR[N-1]

Output:

C
x1 y1
x2 y2
...

Example:

Input:
N = 5, S = 7
ARR = [3, 1, 2, 4, 5]
Output:
[2, 5]
[3, 4]

Constraints:

  • 1 ≤ N ≤ 103
  • -105 ≤ ARR[i] ≤ 105
  • -2 * 105 ≤ S ≤ 2 * 105

Time Limit: 1 sec

Note:

You don't need to print the output; just implement the logic to return the required result.

AnswerBot
1d

Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

  • Iterate through the array and use a hashmap to store the difference between the target sum and each element....read more

Help your peers!
Add answer anonymously...
Housing.com Front end Engineer Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter