Uber SDE1 上门挂经

在亚麻工作1年有余

先是OA (Hackerrank) (75 分钟):

  • 1 ad-hoc question (dont remember exactly, was pretty easy)
  • 1 binary search question: Given K cabs, where ith cab takes Ki minutes, what is the minumum time to complete N trips with K cabs. Assume no waiting time between trips.

Onsite: (4 hours):

第一轮 (1 小时)

  • question1: https://www.geeksforgeeks.org/segregate-even-and-odd-numbers/
  • question 2: same as previous question while maintaining the same order. The interviewer expected an O(N) time and O(1) space solution. I couldn’t code this. (Later I found out that it’s impossible to do this. The interviewer had no idea though.)

第二轮 (1 小时)

  • question 1: don’t remember the exact question, but was similar to TSP.

Lunch: This can also be counted as a culture fit kind of a round.

第三轮 (1 小时)

  • Was interviewed by the hiring manager. He was an old SDE at Amazon, in my sister team. Hence has some Amazon leadership principles related discussion.

第四轮 (Bar Raiser)

总体体验不错
but the recruiter ghosts you a lot after the interview.