uber | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The online assessment consisted of a mix of algorithmic questions and practical coding challenges. I had a total of 4 questions to solve in 90 minutes, using a code editor to write the answers and test them with provided test cases.
Technical Questions
- Two Sum: Given an array of integers, return the indices of the two numbers such that they add up to a specific target. (Easy, Array, Hash Table)
- Balanced Binary Tree: Implement a function to check if a binary tree is balanced. (Medium, Tree)
- Min Stack: Design a stack that supports push, pop, top, and retrieves the minimum element in constant time. (Medium, Stack)
- Longest Substring Without Repeating Characters: Given a string s, find the length of the longest substring without repeating characters. (Medium, Hash Table, Sliding Window)
Tips & Insights
I spent time reviewing the programming language specifics and practiced on the LeetCode platform before the interview. The assessment was fair, but the time constraint was a bit stressful. I recommend mastering common algorithms and practicing code under timed conditions. Good luck!