Maximum Subsequence Score

MediumHeapheap

Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.

Practice this as a mock interviewFree to start, no account needed

Problem

You are given two integer arrays nums1 and nums2 of equal length n and an integer k. Choose exactly k distinct indices. The score of the choice is (the sum of nums1 over the chosen indices) multiplied by (the minimum of nums2 over the chosen indices). Return the maximum possible score. The result can exceed 32-bit range. Aim for O(n log n) time.

Examples

Input: nums1 = [2,1,3], nums2 = [4,5,1], k = 2
Output: 12
Indices 0 and 1 give (2 + 1) * min(4, 5) = 12; the other pairs give 5 and 4.
Input: nums1 = [7,1,2], nums2 = [1,9,3], k = 1
Output: 9
With one index the score is nums1[i] * nums2[i]; index 1 gives 1 * 9.

Constraints

  • 1 <= k <= n <= 10^5
  • `nums1.length == nums2.length == n`
  • 0 <= nums1[i], nums2[i] <= 10^5

What the interviewer grades

A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.

More heap problems