Given a set of busy time intervals of two people as in a calendar, what is the algorithmic approach to find the free time intervals of both the people so as to arrange a new meeting?
 What is the algorithmic approach to find the free-time intervals of both people so they can arrange a meeting, given the set of busy-time intervals of two people, as in a calendar?