Uber Drivers Software Engineer interview: recursive strings and trees

I had two separate interviews built around DSA problems. The first was a recursion-based string-manipulation question. The second moved to trees and asked for a tree coding solution.

Both interviews added follow-ups after the main question, so finishing the initial problem was not the end of it. Those extensions raised the difficulty and made the rounds feel more demanding than the opening prompts suggested. I did not receive an offer, and I came away realizing that I had underestimated how quickly the questions would move beyond the initial task.

Location: San Francisco, CA. Overall feedback: Positive. Offer status: No offer.