# Maximum AND Sum Of Array: Interview Notes
Maximum AND Sum Of Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Assign n numbers into 2*numSlots slots (two per slot number 1..numSlots); a number in slot k scores nums[i] AND k. n and slots are tiny, so bitmask DP over occupied slot-seats: dp[mask] = max score placing the next number into any free seat.
## 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 * 2^{2s} * s).
## Common mistake
Putting at most one number per slot or maximizing the AND without the two-per-slot capacity.
## 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.