Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
3572. Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values
Medium
30 Points
Array
Hash Table
Greedy
Sorting
Heap (Priority Queue)
You are given two integer arrays x and y, each of length n. You must choose three distinct indices i, j, and k such that:
Your goal is to maximize the value of y[i] + y[j] + y[k] under these conditions. Return the maximum possible sum that can be obtained by choosing such a triplet of indices.
If no such triplet exists, return -1.
Examples
Example 1
Input: x = [1,2,1,3,2], y = [5,3,4,6,2]
Output: 14
Explanation:
Example 2
Input: x = [1,2,1,2], y = [4,5,6,7]
Output: -1
Explanation:
Constraints
n == x.length == y.length
3 <= n <= 105
1 <= x[i], y[i] <= 106
3572. Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values
Medium
30 Points
Array
Hash Table
Greedy
Sorting
Heap (Priority Queue)
You are given two integer arrays x and y, each of length n. You must choose three distinct indices i, j, and k such that:
Your goal is to maximize the value of y[i] + y[j] + y[k] under these conditions. Return the maximum possible sum that can be obtained by choosing such a triplet of indices.
If no such triplet exists, return -1.
Examples
Example 1
Input: x = [1,2,1,3,2], y = [5,3,4,6,2]
Output: 14
Explanation:
Example 2
Input: x = [1,2,1,2], y = [4,5,6,7]
Output: -1
Explanation: