Leetcode 1458. Max Dot Product of Two Subsequences

Choose non-empty, equal-length subsequences (order preserved) from two arrays to maximize their dot product — the core challenge is optimally pairing or skipping elements when products can be negative.