> For the complete documentation index, see [llms.txt](https://coding-9.gitbook.io/untitled/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://coding-9.gitbook.io/untitled/dynamic-programming/dp-on-lis/1458.-max-dot-product-of-two-subsequences.md).

# 1458. Max Dot Product of Two Subsequences

## Problem Statement

<br>

Given two arrays `nums1` and `nums2`.

Return the maximum dot product between **non-empty** subsequences of nums1 and nums2 with the same length.

A subsequence of a array is a new array which is formed from the original array by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, `[2,3,5]` is a subsequence of `[1,2,3,4,5]` while `[1,5,3]` is not).

&#x20;

**Example 1:**

<pre><code><strong>Input: nums1 = [2,1,-2,5], nums2 = [3,0,-6]
</strong><strong>Output: 18
</strong><strong>Explanation: Take subsequence [2,-2] from nums1 and subsequence [3,-6] from nums2.
</strong>Their dot product is (2*3 + (-2)*(-6)) = 18.
</code></pre>

**Example 2:**

<pre><code><strong>Input: nums1 = [3,-2], nums2 = [2,-6,7]
</strong><strong>Output: 21
</strong><strong>Explanation: Take subsequence [3] from nums1 and subsequence [7] from nums2.
</strong>Their dot product is (3*7) = 21.
</code></pre>

**Example 3:**

<pre><code><strong>Input: nums1 = [-1,-1], nums2 = [1,1]
</strong><strong>Output: -1
</strong><strong>Explanation: Take subsequence [-1] from nums1 and subsequence [1] from nums2.
</strong>Their dot product is -1.
</code></pre>

&#x20;

**Constraints:**

* `1 <= nums1.length, nums2.length <= 500`
* `-1000 <= nums1[i], nums2[i] <= 1000`

## Intuition

```
Approach:

Normal Subsequence problem
Just edge case

1 -1
-1 1
For negative numbers, answer can go wrong, so we introdiuce extra condition in take
```

### Links

<https://leetcode.com/problems/max-dot-product-of-two-subsequences/>

### Video Links

### Approach 1:

```
```

{% code title="C++" lineNumbers="true" %}

```cpp
class Solution {
public:
    vector<vector<int>> dp; 
    int find_ans(vector<int>& nums1, vector<int>& nums2, int i, int j){
        if(i < 0 or j < 0)
            return -1e9;
        if(dp[i][j] != -1)
            return dp[i][j];

        int take, not_take;
        take = max(nums1[i]*nums2[j] ,nums1[i]*nums2[j] + find_ans(nums1, nums2, i-1, j-1));
        not_take = max(find_ans(nums1, nums2, i, j-1), find_ans(nums1, nums2, i-1, j));

        return dp[i][j] =  max(take, not_take);
    }


    int maxDotProduct(vector<int>& nums1, vector<int>& nums2) {
        dp = vector<vector<int>> (nums1.size(), vector<int> (nums2.size(), -1));
        return find_ans(nums1, nums2, nums1.size()-1, nums2.size()-1);
    }
};
```

{% endcode %}

### Approach 2:

```
```

{% code title="C++" lineNumbers="true" %}

```cpp
```

{% endcode %}

### Approach 3:

```
```

{% code title="C++" lineNumbers="true" %}

```cpp
```

{% endcode %}

### Approach 4:

```
```

{% code title="C++" lineNumbers="true" %}

```cpp
```

{% endcode %}

### Similar Problems

###