9/7 – Received the OA. I don't really remember the details anymore.
9/2 – Got notified it was the last day to do the OA, so I did it quickly. Three fairly simple questions, plus a recorded video interview (details shared earlier in this thread).
10/21 – HR reached out to schedule an interview.
11/7 – VO1. One question was the second question from the OA, plus a greedy problem. Aside from asking about time/space complexity, there were no follow-ups. The interviewer was really nice — I finished early and we ended up having a good chat, so it wrapped up ahead of schedule.
11/21 – VO2, the hiring manager round. The interviewer was also great, and for the first time in an interview I actually had a real conversation with them — we went about 10 minutes over.
11/26 – Offer call.
VO1 greedy question:
There are two interns who need to complete n tasks. Each task can only be done by one of them. For task i, if intern 1 does it, they earn reward1[i] points; if intern 2 does it, they earn reward2[i] points. The condition is: intern 1 must complete exactly k tasks, and intern 2 completes the remaining n-k tasks. Tasks can be assigned in any order — they don't have to be contiguous. The question: how do you assign the tasks so the two people's combined score is maximized, and return that maximum value.
Discussion
Loading comments…