# Longest Subarray With Maximum Bitwise AND: Interview Notes
Longest Subarray With Maximum Bitwise AND shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The maximum AND of any subarray is simply the maximum element (AND only shrinks). The answer is the longest run of that maximum value.
## 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).
## Common mistake
Computing AND of the whole array, or looking for the longest run of 1-bits across different numbers.
## 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.