Question:
There are houses numbered from 1 to 1000.
There are satellites positioned to cover the house broadcasting.
Given two arrays L and R, L[i] and R[i] represents the house range where L[i] < R[i].
At any time, i satellite will cover houses between L[i] and R[i].
Return minimum number of satellites to cover all houses or else return -1 if all houses are not covered.

Answer:
In comments. (Highly recommend to brainstorm first)

Result: Couldn't solve this problem. Greate experience giving the interview though. Interviewer made sure to give hints. Rejected