一道想不明白的面试题

Given a stream of time stamps, separate them into different buckets, such that:

  1. No element in one bucket is more than 30 minutes apart;
  2. For any two adjacent bucket b1, and b2, there must be at least one element in the bucket, so that p1<p2 - 30minutes
    Expand the range of each bucket as much as possible

which company please?

硅谷的一家start-up,做ML-智能城市的,不到十个人。名字还是不讲了吧。
面我的人是斯坦福的phD。猎头让我好好准备NP-complete的问题。

Could you give examples please?