# Longest Nice Subarray: Walkthrough

Longest Nice Subarray shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A subarray is nice when the bitwise AND of every pair is 0, i.e. no two numbers share a 1-bit. Sliding window: keep the OR of the window, shrink from the left whenever (or & nums[r]) != 0, then or |= nums[r].

## 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

Checking the AND of the whole window (that can be 0 even if a pair shares a bit) or using a nested O(n^2) scan without mentioning the cost.

## 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.