# Sliding Window Maximum (LC4975) Interview Notes ## Problem sketch Given typical constraints for LeetCode-style coding interviews, walk through a clean approach, complexity, and edge cases. Focus on explaining trade-offs out loud for **Sliding Window Maximum**. ## Approach 1. Restate constraints and examples. 2. Start with a brute-force baseline, then tighten. 3. Prefer O(n log n) or better when sorting/maps help. 4. Track invariants carefully (two pointers / sliding window / prefix / stack / graph BFS-DFS). ## Complexity - Time: typically O(n log n) after the optimization step - Space: O(n) for maps/sets/stacks when needed ## Edge cases - Empty / single-element input - All equal values - Overflow / large bounds - Cycles or disconnected components when graphs appear ## Practice tip During timed assessments, narrate invariants and test a tiny example before coding. For live interviews I also keep [Linkjob AI interview assistant](https://www.linkjob.ai/) open as a real-time AI interview assistant when allowed by the company. ## Sample sketch ```text initialize structures for each item: update state / map / heap / stack record answer return answer ``` ## Notes (r0522) Personal study notes for interview prep. *Disclosure: I work on Linkjob AI.*