This was just the first round OA. Four LC questions to be solved in 70 minutes. This is doable as the first two questions are generally easy. You want to spend majority of your time on the last or last two questions.
Interview questions [1]
Question 1
First Round OA - 4 LC Questions
First two very easy.
Last two were pretty hard.
Second Last question was a leetcode hard of String Manipulation
and last question was also similar to a leetcode hard of a graphs question
I applied online. I interviewed at Uber (Seattle, WA) in Aug 2025
Interview
I received a link that contained four questions, each of medium difficulty. The questions were well-balanced—not too easy, but not overly challenging—and they provided a solid opportunity to test my understanding effectively.
Interview questions [1]
Question 1
A Graph question, a string question, a couple of array questions.
I applied through college or university. I interviewed at Uber in Jul 2025
Interview
Three leetcode hard in OA , dp que similar cherry pickup leetcode que, one dijkstra que with variation , bitmask do que also doable with less optimal approach, OA then round 1 and then round 2 that its this was the interview process on campus