Find All Pairs Adding Up to Target
Given an array of integers ARR
of length N
and an integer Target
, your task is to return all pairs of elements such that they add up to the Target
.
Input:
The first line contains an integer 'T' denoting the number of test cases.
Then, the test case follows.
The first line of each test case contains two space-separated integers 'N' and 'Target'.
The second line contains 'N' space-separated integers denoting the elements of the array.
Output:
For each test case, print pairs of integers denoting the elements which add up to the target.
Each pair must be printed in a new line.
If no pair is found, print (-1, -1).
Example:
For example, consider the following input/output:
Input:
2
5 9
2 7 4 5 6
4 10
1 2 8 4
Output:
2 7
4 5
-1 -1
Constraints:
1 <= T <= 100
1 <= N <= 5000
-10^9 <= TARGET <= 10^9
-10^9 <= ARR[i] <= 10^9
Note:
You do not need to print anything; the function is already set up to handle output.
Be the first one to answer
Add answer anonymously...
Interview Questions Asked to Software Engineer at Other Companies
Top Skill-Based Questions for Providence Global Center Software Engineer
Algorithms Interview Questions and Answers
250 Questions
Data Structures Interview Questions and Answers
250 Questions
Web Development Interview Questions and Answers
250 Questions
Java Interview Questions and Answers
250 Questions
Software Development Interview Questions and Answers
250 Questions
SQL Interview Questions and Answers
250 Questions
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

