Facebook : Find largest number of dis-intersect segments

A number of events for a day, starting time and end time

find a solution that maximizes the number of events

one can finish in the day. Events may over lap with each other.