1458. Max Dot Product of Two Subsequences

Choose non-empty equal-length subsequences from nums1 and nums2 maximising their dot product (sum of paired products). This is a sequence-alignment DP: at each (i,j) you decide whether to pair the…