mediumArrayGreedyHash TableHeap Priority QueueSorting 0 views
Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values
You are given two integer arrays x and y, each of length n.
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.
Example 1
Input: x = [1,2,1,3,2], y = [5,3,4,6,2]
Output: 14
Example 2
Input: x = [1,2,1,2], y = [4,5,6,7]
Output: -1
Constraints
- n == x.length == y.length
- 3 <= n <= 10^5
- 1 <= x[i], y[i] <= 10^6
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.