# Max Dot Product Of Two Subsequences: Walkthrough

Max Dot Product Of Two Subsequences shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Pick non-empty subsequences of nums1 and nums2 of equal length to maximize their dot product. DP: dp[i][j] is the best dot product using prefixes i and j, and the last chosen pair may be (nums1[i-1], nums2[j-1]). Transition: skip i, skip j, or take the pair plus max(0, dp[i-1][j-1]) — the max(0, ...) lets you start a fresh subsequence when the previous product is negative.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n*m).

## Common mistake

Forcing the subsequences to be non-empty but still adding dp[i-1][j-1] even when it is largely negative without the start-fresh option, or allowing empty subsequences (dot product 0).

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at try it free.