Your question is Efficient Rectangle Matching. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Given a 2D set of rectangles that may overlap, find the most efficient way to return the first matching rectangle for a given point.
