The interview process began with a coding challenge, followed by two technical phone interviews, and then an onsite interview.

The coding challenge practice example was very simple, although the two questions in the actual test were rather difficult. I don't believe I did very well on the second one, which involved complex string manipulation and a recursion problem.

The first few questions in the phone interviews were relatively easy, but they built on each other and became progressively harder: basic problems, then easy DP optimization, and finally complex optimization.

Notably, the second interviewer was over an hour late to the call.

During the onsite interview, my first interviewer was also an hour late. I sat in the waiting room the entire time.

Despite the delays, the schedule remained the same, so I only had 15 minutes for a 45-minute interview slot. This rushed me through the rest of the interviews.

Given a list of numbers, determine if a nonzero subset of any of its elements can add to 0 mod 2015, with repetition.