# Closest Subsequence Sum: Interview Notes

Closest Subsequence Sum shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Return a subsequence sum of nums closest to goal. n <= 40: meet-in-the-middle, generate all subset sums of each half, sort one half, and binary-search the partner that best approaches goal.

## 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(2^{n/2} n).

## Common mistake

Enumerating 2^n subsets of the whole array.

## 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 undetectable AI interview copilot.