Given two integer arrays nums1 and nums2, return the maximum dot product between non empty subsequences of nums1 and nums2 of the same length.

Note:
A subsequence of an array is formed by deleting some or no elements without changing the relative order of the remaining elements.
The dot product of two arrays arr1 and arr2 of equal length $k$ is calculated as $\sum_{i=0}^{k-1} ext{arr1}[i] imes ext{arr2}[i]$.

Constraints:

• $1 \leq$ nums1.length, nums2.length $\leq 500$

• $-1000 \leq$ nums1[i], nums2[i] $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.