Uber Backend Engineer Interview Questions (2026)

1. 1Recruiter Screen30 minEasy

   Role targeting, level calibration and process expectations.

2. 2Technical Phone Screen60 minMedium

   One or two medium DSA problems (CodeSignal or live) with emphasis on correct, runnable code and edge cases.

3. 3Onsite Coding I60 minHard

   Practical problem such as building a rate limiter or an in-memory index, judged on working code and API cleanliness.

4. 4Onsite Coding II60 minHard

   Algorithmic problem often with a geospatial or streaming flavor, pushed to optimal complexity.

5. 5System Design60 minHard

   Design a real-time marketplace system (dispatch, ETA, surge) with hard follow-ups on scale, geo-sharding and failure modes.

6. 6Behavioral / Hiring Manager Round45 minMedium

   STAR stories mapped to Uber's cultural norms: ownership, bold bets, customer obsession and conflict handling.

1. Q1

   In a Uber backend interview, solve this DSA problem from ride matching: implement an LFU cache with LRU tie-breaking. Provide the algorithm, prove correctness, and analyze complexity under peak holiday traffic

   MediumData Structures & AlgorithmsCaching

   How to answer:

   Model the problem with hash maps for keys and frequency buckets with ordered sets. The target solution should achieve O(1) expected get/put, handle empty inputs and ties, and explain why simpler brute-force approaches do not scale.

2. Q2

   In a Uber backend interview, solve this DSA problem from trip receipt generation: identify hot keys from a high-volume request stream. Provide the algorithm, prove correctness, and analyze complexity under 10k requests per second

   HardData Structures & AlgorithmsCaching

   How to answer:

   Model the problem with count-min sketch with heap validation or exact counts for bounded keys. The target solution should achieve sublinear memory for approximate tracking, handle empty inputs and ties, and explain why simpler brute-force approaches do not scale.

3. Q3

   Design cache-aware read APIs with explicit cache-control semantics and invalidation hooks for Uber's surge pricing state transition workflow. Specify endpoints or RPCs, request and response schemas, error handling, authentication, idempotency, and pagination where relevant

   MediumAPI DesignCaching

   How to answer:

   A strong answer defines resource-oriented REST endpoints or clear RPC methods for safe transitions, idempotency keys, validation, and conflict responses. It includes stable identifiers, authorization boundaries, validation rules, explicit error codes, rate limits, and backward-compatible versioning.

4. Q4

   Design a highly available regional service for Uber's ride matching using multi-layer cache hierarchies, invalidation fanout, hot-key handling, and stale reads. The system must handle 100k events per second, zero-downtime deployment, and duplicate client retries. Explain architecture, data flow, consistency, and operations

   HardDistributed SystemsCaching

   How to answer:

   A strong answer decomposes the system into stateless frontends, partitioned services, durable storage, and async processing. It justifies partitioning, replication, leader election or quorum decisions, and regional failover, uses idempotency and back-pressure, and defines SLOs, alerts, and rollback mechanisms.

5. Q5

   Design a global low-latency platform for Uber's driver incentives using multi-layer cache hierarchies, invalidation fanout, hot-key handling, and stale reads. The system must handle 1 billion stored records, a 150 ms p99 target, and GC or runtime pauses. Explain architecture, data flow, consistency, and operations

   ExpertDistributed SystemsCaching

   How to answer:

   A strong answer decomposes the system into stateless frontends, partitioned services, durable storage, and async processing. It justifies multi-region routing, data locality, cache hierarchy, and conflict resolution, uses idempotency and back-pressure, and defines SLOs, alerts, and rollback mechanisms.

6. Q6

   Design a migration and retention plan for Uber's surge pricing with emphasis on cache metadata, invalidation logs, materialized views, and read-through/write-through tradeoffs. Include tables or collections, keys, indexes, consistency guarantees, and a migration strategy

   HardDatabase DesignCaching

   How to answer:

   A strong answer starts from access patterns, then proposes online migrations, backfills, archival, data validation, and rollback. It explains transaction scope, isolation level, retention needs, and how the model handles growth to millions of merchants or hosts.

7. Q7

   Uber's driver incentives has grown to 1 billion stored records. Propose a capacity plan focused on hit ratio improvement, origin shielding, stampede prevention, hot-key splitting, and invalidation load while preserving zero-downtime deployment. Explain bottlenecks, tradeoffs, instrumentation, and rollout

   HardScalabilityCaching

   How to answer:

   A strong answer quantifies traffic first, then targets the highest-risk bottleneck with traffic estimates, CPU and memory sizing, database QPS, and dependency budgets. It uses staged rollout, load tests, dashboards, and fallback behavior rather than only adding more machines.

8. Q8

   Uber's surge pricing has grown to millions of merchants or hosts. Propose a bottleneck reduction plan focused on hit ratio improvement, origin shielding, stampede prevention, hot-key splitting, and invalidation load while preserving limited memory per worker. Explain bottlenecks, tradeoffs, instrumentation, and rollout

   HardScalabilityCaching

   How to answer:

   A strong answer quantifies traffic first, then targets the highest-risk bottleneck with profiling, caching, batching, pooling, sharding, and load shedding. It uses staged rollout, load tests, dashboards, and fallback behavior rather than only adding more machines.

9. Q9

   Uber's fraud detection has grown to thousands of partitions. Propose a resilience and cost plan focused on hit ratio improvement, origin shielding, stampede prevention, hot-key splitting, and invalidation load while preserving a 150 ms p99 target. Explain bottlenecks, tradeoffs, instrumentation, and rollout

   ExpertScalabilityCaching

   How to answer:

   A strong answer quantifies traffic first, then targets the highest-risk bottleneck with autoscaling, graceful degradation, SLOs, error budgets, and cost controls. It uses staged rollout, load tests, dashboards, and fallback behavior rather than only adding more machines.

10. Q10

    For Uber's ETA computation flow, write production-quality backend code to implement a bounded producer-consumer pipeline with cancellation while meeting bursty traffic during launches. Describe the main function or class interface, the core data structures, and the edge cases you would test

    MediumCodingConcurrency

    How to answer:

    A strong answer proposes a small, testable interface and uses queues/channels, semaphores, graceful shutdown, and back-pressure. It handles retries, invalid input, timeouts, and cleanup explicitly, and states O(n) work with bounded memory.

11. Q11

    For Uber's airport queueing flow, write production-quality backend code to make a shared counter map safe under high contention while meeting partial downstream failures. Describe the main function or class interface, the core data structures, and the edge cases you would test

    MediumCodingConcurrency

    How to answer:

    A strong answer proposes a small, testable interface and uses sharded locks or atomic counters with clear ownership. It handles retries, invalid input, timeouts, and cleanup explicitly, and states O(1) expected operations with reduced contention.

12. Q12

    In a Uber backend interview, solve this DSA problem from map-matching: schedule tasks with dependencies on a fixed-size worker pool. Provide the algorithm, prove correctness, and analyze complexity under thousands of partitions

    MediumData Structures & AlgorithmsConcurrency

    How to answer:

    Model the problem with topological sort plus ready queue. The target solution should achieve O(V + E) scheduling overhead, handle empty inputs and ties, and explain why simpler brute-force approaches do not scale.

13. Q13

    In a Uber backend interview, solve this DSA problem from ETA computation: find a deadlock cycle from lock acquisition logs. Provide the algorithm, prove correctness, and analyze complexity under hundreds of microservices

    HardData Structures & AlgorithmsConcurrency

    How to answer:

    Model the problem with construct wait-for graph and run DFS cycle detection. The target solution should achieve O(V + E) time, handle empty inputs and ties, and explain why simpler brute-force approaches do not scale.

14. Q14

    Design asynchronous job APIs with status, cancellation, leases, and safe concurrent updates for Uber's driver incentives read/write workflow. Specify endpoints or RPCs, request and response schemas, error handling, authentication, idempotency, and pagination where relevant

    MediumAPI DesignConcurrency

    How to answer:

    A strong answer defines resource-oriented REST endpoints or clear RPC methods for create, retrieve, update, list, and audit operations. It includes stable identifiers, authorization boundaries, validation rules, explicit error codes, rate limits, and backward-compatible versioning.

15. Q15

    Design asynchronous job APIs with status, cancellation, leases, and safe concurrent updates for Uber's surge pricing state transition workflow. Specify endpoints or RPCs, request and response schemas, error handling, authentication, idempotency, and pagination where relevant

    MediumAPI DesignConcurrency

    How to answer:

    A strong answer defines resource-oriented REST endpoints or clear RPC methods for safe transitions, idempotency keys, validation, and conflict responses. It includes stable identifiers, authorization boundaries, validation rules, explicit error codes, rate limits, and backward-compatible versioning.

Practice these with instant AI feedback in a live mock interview → Start a Uber Backend Engineer mock

Strong DSA and scalable system design; prepare analytical/behavioral stories

Indicative Backend Engineer pay in India: ~₹10–45 LPA (role-level range, not a Uber-specific figure).

Other roles at Uber

Backend Engineer interviews at other companies