# Longest Well Performing Interval: Interview Notes

Longest Well Performing Interval shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Hours > 8 are tiring (+1), others are -1. A well-performing interval has a strictly positive sum (more tiring than non-tiring days). This is the longest subarray with sum > 0: map prefix sums to first index and, for each prefix p, look up the first occurrence of p-1 (any smaller prefix also works but p-1 is sufficient because prefixes move by 1).

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

Looking for sum >= 0 (that would include balanced intervals) or using Kadane, which maximizes sum rather than length.

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