Hard

Quiz

#1458 Max Dot Product of Two Subsequences

APPROACH

You are given two integer arrays nums1 and nums2. Find the maximum dot product achievable by selecting equal-length, non-empty subsequences — one from each array — and computing their dot product.

A subsequence preserves relative order but may skip elements (e.g., [2,3,5] is a subsequence of [1,2,3,4,5] while [1,5,3] is not).

Example 1:

Input: nums1 = [2,1,-2,5], nums2 = [3,0,-6]

Output: 18

Explanation: Take subsequence [2,-2] from nums1 and subsequence [3,-6] from nums2.

Their dot product is (2*3 + (-2)*(-6)) = 18.

Example 2:

Input: nums1 = [3,-2], nums2 = [2,-6,7]

Output: 21

Explanation: Take subsequence [3] from nums1 and subsequence [7] from nums2.

Their dot product is (3*7) = 21.

Example 3:

Input: nums1 = [-1,-1], nums2 = [1,1]

Output: -1

Explanation: Take subsequence [-1] from nums1 and subsequence [1] from nums2.

Their dot product is -1.

1 of 4

1:00

What is the optimal approach for this problem?