Finding Conflict algorithm doubt
Take all $2n$ starting and ending times and sort them, then walk through the list in sorted order, increasing a counter at each "starting" time, and decreasing the counter at each "ending" time.  On every counter increase, check whether this is the highest the counter has gone so far, and if so update the best-so-far event.