# Count Good Meals: Walkthrough

Count Good Meals shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A good meal is two dishes whose goods sum to a power of two. Count frequencies; for each value x and each power p in 1..2^21, add freq[p-x] (halve when 2x=p to avoid double-counting pairs). Use a hashmap.

## 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 * 22).

## Common mistake

Only checking sum==2 or another single target, or double-counting unordered pairs.

## 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 https://linkjob.ai.