Uber | Software Engineer 2 | Interview Experience

uber logo
uber
Software Engineer 22.5 years
July 10, 20251 reads

Summary

I interviewed for a Software Engineer 2 position at Uber, which included a Code Signal assessment, a Zoom interview, and two on-site rounds focusing on Data Structures and Low-Level Design. My experience concluded with a rejection after completing all scheduled rounds.

Full Experience

Background: YOE: 2.5 years, Currently working at a PBC

Round 1 : Code Signal Assesment (70 min) This consisted of 4 DSA problems. I don't remember the exact questions, but the first two were easy, the third was of medium difficulty, and the fourth was medium to hard.

Round 2 : Zoom Interview (1 hr) This is an elimination round. I was asked only one question. https://leetcode.com/problems/reconstruct-itinerary/description/

Rounds 3 and 4 are conducted in person at the Uber office on the same day. Candidates who clear both rounds proceed to Rounds 5 and 6, which are also held face-to-face on another day.

Round 3 : Data Structures (1 hr)

https://www.techiedelight.com/find-optimal-cost-to-construct-binary-search-tree/

I hadn't seen this question before the interview. I managed to come up with a recursive solution during the interview, but the interviewer asked for an optimized approach. I later discovered that it's a well-known problem, couldn't find similar question on LeetCode.

Round 4 : LLD (1 hr)

It was more like a machine coding round, where I was given a set of use cases and had to design classes and implement the solution accordingly. The round was conducted on CodeSignal.

Got rejection mail the next day

Interview Questions (2)

Q1
Reconstruct Itinerary
Data Structures & Algorithms

I was asked only one question. The problem Reconstruct Itinerary is linked here: https://leetcode.com/problems/reconstruct-itinerary/description/

Q2
Find Optimal Cost to Construct Binary Search Tree
Data Structures & Algorithms

I hadn't seen this question before the interview. I managed to come up with a recursive solution during the interview, but the interviewer asked for an optimized approach. I later discovered that it's a well-known problem, couldn't find similar question on LeetCode. The problem Find Optimal Cost to Construct Binary Search Tree is linked here: https://www.techiedelight.com/find-optimal-cost-to-construct-binary-search-tree/

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!