Uber | SSE | Bangalore | L5-A

I applied for the SSE L5-A role at Uber in Bangalore without a referral. My experience is 5 years.

BPS Round

In this round, I was presented with a grid problem:

• You have an n x n grid.
• Each cell (i, j) has a direction (U, D, L, R).
• If you move in the same direction as indicated, cost = 0.
• If you move in a different direction, cost = 1.
• Find minimum cost to go from (0, 0) to (n-1, n-1).

I solved this problem using a 0/1 BFS approach and successfully cleared the round.

Onsite

DSA Round

1. The first question was a variation of LeetCode 1438: Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.
2. The second question was: Given an integer N, find the smallest palindromic number greater than N.

I managed to solve both questions. For the second question, I had a bug in one test case, but I clearly explained my thought process and how I would resolve it, which satisfied the interviewer.

LLD/MC Round

I was asked to design a vending machine with several specific and somewhat unusual requirements. Unfortunately, I missed one crucial requirement during my implementation, and due to time constraints, I couldn't rewrite my solution to incorporate it. It felt like a very extensive implementation for a 1-hour round.

I am fairly certain that I won't be moving forward to the subsequent HLD and Hiring Manager rounds. It appears this is the end of my interview journey with Uber this time.