I didn't get past the phone screen. The question asked was a classic problem first posed in the 70's, whose optimal algorithm was discovered a year after publication, i.e., fairly tough.

I don't think the interviewer expected me to find the O(n) solution, but I fumbled quite a bit just to get from the O(n^3) to the O(n^2) solution. I don't want to give away the question, but it is one of the problems discussed on GeeksforGeeks, which makes for good pre-interview prep anyway.

All in all, the phone screen was scheduled quickly, and the interviewer did try to put me at ease initially, so that was great. I do think tougher algorithm questions should be saved for at least an on-site, since it is hard to reason through without a whiteboard.

Why would you like to work here?