# Largest Rectangle in Histogram (LC4929) 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 **Largest Rectangle in Histogram**.

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

## 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
- Duplicate keys in maps

## Practice tip
During timed assessments, narrate invariants and test a tiny example before coding. For live interviews I also keep [AI tool for job interviews](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 window / map / heap / stack
  record answer
return answer
```

## Notes (r0444)
Personal study notes for interview prep.

*Disclosure: I work on Linkjob AI.*
