J'ai postulé via un recruteur. J'ai passé un entretien chez Uber (Amsterdam) en févr. 2019
Entretien
Overall a nice experience with Uber in Amsterdam. Recruiters and interviewers are respectful and timely with answers. Was scheduled to have 2 phone interviews before an on-site. Made it to the 2nd one before unexpectedly being cut, for reasons I'll detail below. When I asked for a bit more specific feedback, the recruiter was kind enough to collect it and share it over the phone.
1st phone screen was mostly just a coding question using a shared editor on hackerrank. It was mostly data structures-related, and when I got a bit stuck on 1 part of the problem, interviewer and I talked it through.
2nd phone screen was a small discussion on a past project, then a high-level design discussion, then a coding question at the end. I really thought I breezed through every portion, the interviewer never challenged me, and only had to sit back and watch while I was implementing the live coding question. There were some minor compilation errors at the end (missing constructor and getters/setters, using a method that was part of the List interface instead of Collection interface ). Nothing show-stopping at all, and immediately afterwards the algorithm printed out the correct solution on the 1st try.
Afterwards received a rejection, and after the call, found out that although the interviewer found me to be very communicative, but it was my "coding speed" and "syntax errors" that ultimately led me to be rejected. I'll let you draw your own conclusions there.
Questions d'entretien [1]
Question 1
Basic data structures and algorithms (more emphasis on the data structures). But I suppose more emphasis should be taken on coding speed and syntax, even if you can solve the question in the required time and get a running program.
The phone screen lasted about 30 minutes and began with general questions about my background before diving into technical topics. I was asked to solve a DSA question on finding the top K frequent elements, discussing both the min-heap and bucket-sort approaches. Surprisingly, I had recently practiced a similar problem on the algorithm section of PracHub, which helped me articulate my thought process clearly. The interview continued with an onsite where I tackled system design and behavioral questions, and overall, the experience was straightforward and positive, leading to an offer that I happily accepted.
Questions d'entretien [1]
Question 1
Top K Frequent Elements: given an integer array and integer k, return the k most frequent elements. Walk through both the min-heap approach (O(n log k) time) and the bucket-sort approach (O(n) time), then discuss the trade-offs in time, space, and which one you'd pick for a streaming variant where new numbers keep arriving.
Surprisingly, the interview felt quite straightforward, especially for a senior role. I started with a technical screen, where I was asked to design an Uber Eats cart service. It caught me off guard initially, but then I remembered a specific mock I had practiced on PracHub that was nearly spot-on with this scenario. The final round included some behavioral questions, and although I received an offer, I ultimately decided to decline. Overall, it was a positive experience.
J'ai postulé en ligne. J'ai passé un entretien chez Uber (Bengaluru)
Entretien
Round 1 - Coding
Question: Count Rectangle-Line Intersections. Given a set of rectangles and a set of vertical line segments, count how many places the vertical lines intersect the rectangle edges (ignoring edge-on-edge overlaps).
Questions d'entretien [1]
Question 1
Count Rectangle-Line Intersections. Given a set of rectangles and a set of vertical line segments, count how many places the vertical lines intersect the rectangle edges.