Recently, I successfully completed the Uber Online Assessment (OA). Based on my experience, the overall difficulty is moderate—there are no extremely tricky questions, but the OA tests coding modeling skills and clear problem-solving thinking. Some questions may seem simple at first glance, but taking the wrong approach can waste a lot of time and lead to failing test cases, which may impact your overall OA score. Here, I provide a complete recap of the real questions, core solving strategies, and timeline to help others prepare efficiently and avoid pitfalls.
Uber OA Timeline Reference
The OA process is fast-paced, and the HR communication is prompt. Here is a timeline for reference:
- Jan 22: Submitted Uber job application
- Jan 29: Received OA notification and completed the assessment
- Feb 5: Completed immigration evaluation
- Feb 8: Received interview invitation
The process is smooth, reducing anxiety during preparation.
3 High-Frequency Questions & Core Solutions
Question 1: Maximum Items Within Budget
Problem: Given a sorted array of item prices, Alex starts at a specified position pos and moves right. Each stall allows buying at most one item. Determine the maximum number of items Alex can buy without exceeding a given budget amount.
Solution: Since the array is sorted, the optimal strategy is to buy cheaper items first. Use a linear traversal from pos, accumulating prices until the total exceeds the budget. The count of items before exceeding the budget is the answer. Alternatively, precompute prefix sums and apply binary search to efficiently find the maximum purchasable items.
Question 2: Updatable Fixed Sum Pair Count
Problem: Given two arrays, primary and secondary, there are two operations: update a value in secondary and query the number of pairs (i,j) where primary[i] + secondary[j] = targetSum.
Solution: Maintain a hash table counting occurrences of values in secondary. On update, adjust the hash counts. On query, iterate primary and for each element x, look up targetSum - x in the hash table. Sum all counts to get the total number of valid pairs. Updates are O(1), queries are O(n).
Question 3: Optimal Time Using Elevator and Stairs
Problem: A user wants to travel from the start floor to the target floor using a combination of elevator and stairs. Elevator travel takes time and increases energy, while stairs consume energy and time proportional to current energy. Energy cannot be negative. Compute the minimal total travel time.
Solution: Enumerate all possible elevator stop floors. For each stop, calculate total time including elevator and stair segments, ensuring energy never drops below zero. Keep track of the minimal total time among all valid paths. The solution is efficient and intuitive.
Preparation Tips
Uber OA emphasizes clear problem-solving and modeling rather than complex code. Understanding high-frequency question types and core logic is key to success. If you are unsure about passing the OA or worried about tricky questions, leverage proven preparation experience and curated question collections. We have helped hundreds of students pass OAs, get interview invites, and land offers. For more high-frequency question sets, solution guides, and preparation assistance, contact us: Programhelp Contact.
Top comments (0)