Woodstock Blog

a tech blog for general algorithmic interview questions

[Greedy] Each Employee 2 Events



You are given N ranges of date offsets when N employees are present in an organization. Something like

    1-4 (i.e. employee will come on 1st, 2nd, 3rd and 4th day ) 

Organize an event on minimum number of days such that each employee can attend the event at least twice.


Greedy algorithm, according to the top answer:

  1. First, sort all ranges based on ENDING date in increasing order (bucket or counting sort).

  2. For each range, select last two days (because they produce maximum possibility to overlap next range)

  3. Skip following ranges that also contains those two days, until:

    1. a range that either covers only one day (we then select last day of this range) or
    2. does not cover any of the two (we then select last two days of this range).
  4. Then continue.


not written