# Maximum Subsequence Score: Explained
Maximum Subsequence Score shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Pair nums1[i] with nums2[i] and sort pairs by nums2 descending. Keep a min-heap of the k chosen nums1 values (the ones paired with efficiencies so far). Score is sum(nums1_chosen) * current nums2, and you drop the smallest nums1 when the heap exceeds k.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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 log n).
## Common mistake
Picking the k largest nums1 without regarding the nums2 that will multiply the sum.
## 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 AI tool for job interviews.