K Max Sum Combinations Problem Statement

Given two arrays/lists A and B, each of size N, and an integer K, you need to determine the K maximum and valid sum combinations from all possible combinations of sums generated by adding one element from array A with one element from array B.

Input:

The first line contains an integer 'T', representing the number of test cases. Each test case includes:
The first line with two integers 'N' and 'K', indicating the size of the arrays/lists and the number of sum combinations required.
The second line with 'N' space-separated integers representing the elements of array 'A'.
The third line with 'N' space-separated integers representing the elements of array 'B'.

Output:

For each test case, return the top 'K' maximum sum combinations in descending order.

Example:

Input:
A : [1, 3] 
B : [4, 2]
K : 2
Output:
[7, 5]
Explanation:

The possible sum combinations are 5(3 + 2), 7(3 + 4), 3(1 + 2), and 5(1 + 4). The 2 maximum sum combinations are 7 and 5.

Constraints:

  • 1 ≤ T ≤ 5
  • 1 ≤ N ≤ 100
  • 1 ≤ K ≤ N
  • -105 ≤ A[i], B[i] ≤ 105
  • Time limit: 1 sec
Note:
You are not required to print anything explicitly; just implement the function as instructed.
AnswerBot
2d

The problem involves finding the K maximum sum combinations from two arrays by adding one element from each array.

  • Iterate through all possible sum combinations of elements from arrays A and B.

  • Store th...read more

Help your peers!
Add answer anonymously...
DE Shaw Software Developer Intern 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