# Corporate Flight Bookings: Interview Notes

Corporate Flight Bookings shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

bookings[i] = [first, last, seats] adds seats to every flight in [first, last]. Difference array: add seats at first, subtract at last+1, then prefix-sum to recover the per-flight totals.

## 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 + m).

## Common mistake

Looping each booking across its interval (O(n m)), which TLEs, or putting the subtract at last instead of last+1.

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