Top Uber Interview Questions

Tiago R. - "function visitChildren(node) { let leftSubtreeHeight = 0; let rightSubtreeHeight = 0; let isChildrenBalanced = true; if (node.left) { const { isBalanced, height } = visitChildren(node.left); isChildrenBalanced = isChildrenBalanced && isBalanced; leftSubtreeHeight += height + 1; } if (isChildrenBalanced && node.right) { const { isBalanced, height } = visitChildren(node.right); isChildrenBalanced = isChildrenBalanced && isBalan"See full answer

Ramachandra N. - "def sortedSquares(nums): n = len(nums) result = [0] * n left, right = 0, n - 1 pos = n - 1 while left abs(nums[right]): result[pos] = nums[left] ** 2 left += 1 else: result[pos] = nums[right] ** 2 right -= 1 pos -= 1 return result `"See full answer

Jaime A. - "I would avoid converting order_date WITH monthly_totals AS ( SELECT department_id, SUM(CASE WHEN DATETRUNC('month', orderdate) = '2022-11-01' THEN orderamount ELSE 0 END) AS novtotal, SUM(CASE WHEN DATETRUNC('month', orderdate) = '2022-12-01' THEN orderamount ELSE 0 END) AS dectotal FROM orders WHERE order_date BETWEEN '2022-11-01' AND '2022-12-31' GROUP BY department_id ), mom_increases AS ( SELECT "See full answer

Exponent - "This is a Measure Success question with a slight twist. The twist here is we need to consider a hypothetical changes rather that one already built. This changes our formula slightly - specifically we may not be able to apply a UX flow to drive analysis since we're unsure of the implementation. Instead, we'll look at core behaviors that are indicative of success. Here's the modified formula: Ask clarifying questions State the goal of the feature **Apply a UX flow to drive a"See full answer

Prashant S. - "To improve the passenger experience at a major metropolitan airport, I would focus on streamlining the pre-arrival, arrival, and post-flight stages of their journey. Pre-arrival, we could integrate flight details into the Uber app and provide predictive ETAs to help passengers plan better. At the airport, we could partner with authorities to create dedicated drop-off and pickup zones, along with clear in-app navigation to reduce confusion. Post-flight, we could implement dynamic pickup zones, vi"See full answer

Rahul .. - "''' Problem Statement: Design a simplified Robinhood-like stock trading platform. Requirements: User Management: createuser(userid, name, initial_balance): Create user with cash balance getbalance(userid): Get user's cash balance deposit(user_id, amount): Add funds to account withdraw(user_id, amount): Withdraw funds (if sufficient balance) Stock Operations: updatestockprice(symbol, price): Update current price of a stock getstockprice(symb"See full answer

Exponent - "This is another Fermi problem — an estimation or approximation problem with limited information and back-of-the-envelope calculations. There's no right answer: interviewers want to understand how you think and how well you can explain your reasoning, rather than what you already know. Recall the formula for Fermi problems: Ask clarifying questions Catalog what you know Make equation(s) Think about edge cases to add to equation **Breakdown components of your"See full answer

Naga M. - "Based on the required significance level (usually less than 5%) and based on the test power (usually 95%?), I will calculate the required sample size. Once I get the sample size, then I will do the A/B testing until I meet the sample size."See full answer

Exponent - "This is a Fermi problem — an estimation or approximation problem with limited information and back-of-the-envelope calculations. There's no right answer: interviewers want to understand how you think and how well you can explain your reasoning, rather than what you already know. Recall the formula for Fermi problems: Ask clarifying questions Catalog what you know Make equation(s) Think about edge cases to add to equation **Breakdown components of your equat"See full answer

Ramachandra N. - "from collections import deque from typing import List def longestsubarraydifflessthan_n(nums: List[int], N: int) -> int: """ Find the length of the longest contiguous subarray such that the difference between any two elements in the subarray is less than N. Equivalent condition: max(subarray) - min(subarray) < N Approach (Optimal): Sliding window with two monotonic deques: max_d: decreasing deque of indices (front is index of current max"See full answer

Exponent - "This is a Fermi problem — an estimation or approximation problem with limited information and back-of-the-envelope calculations. There's no right answer: interviewers want to understand how you think and how well you can explain your reasoning, rather than what you already know. Recall the formula for Fermi problems: Ask clarifying questions Catalog what you know Make equation(s) Think about edge cases to add to equation **Breakdown components of your equat"See full answer

Adarsh S. - "Hey, Thanks for the question - it’s a fantastic challenge with real-world impact. Cool so this is the rough backbone structure that we can follow and ofcourse we can add meat later on to it and pivot if required. So here it goes: First would like to lay out the broader mission as to why we are doing this and then some clarification questions and then probably try to segment users via single or different approaches, then will pick which permutation makes sense as the target segment, then ge"See full answer