J'ai postulé via un recruteur. Le processus a pris 1 semaine. J'ai passé un entretien chez Uber (San Francisco, CA)
Entretien
Standard technical phone screen plus onsite. The onsite had two coding questions, an architecture question, a "bar raiser" which was really a business conversation with a general manager from another team, and a 1:1 with a manager about cultural fit.
All coding interviews, even onsite, are done eith coderpad which I liked.
Overall the team was doing interesting stuff, but they low balled the offer in both equity and salary. Their process is optimized for offer collectors, so don't interview at Uber unless you also interview at similar size companies. The recruiter was very transparent about the fact that they will give you the lowest offer in the band unless you have competing offers and won't negotiate otherwise. I was pretty disappointed in this because I chose to be selective and interview at Uber because I was actually interested in the company. It tells me something about career development within Uber that this was the case. I declined the offer and stayed at my current employer.
Questions d'entretien [1]
Question 1
Phone screen: Given a stream of events, bucket them into buckets of a given time window (phone screen). Also had a derivative of the TwoSum question and a Knapsack problem in disguise as something else.
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.