Sponsored
Use these hints if you're stuck. Try solving on your own first.
Use dynamic programming, define DP[i][j] as the maximum dot product of two subsequences starting in the position i of nums1 and position j of nums2.
Solve with full IDE support and test cases
