← AppLovin Interview Insights

AppLovin·Software Engineer·Onsite - System Design / Architecture·Senior

Senior
Apr 2026

Summary

System design round at Applovin focused entirely on designing Uber Pool. Pretty deep dive, they wanted specifics on matching, dispatch, routing, and ETA all in one go.

Questions Asked (1)

Q1

Design the Uber Pool (ride-share) feature with the goal of maximizing passengers picked up per trip without meaningfully increasing the original passenger's travel distance. Cover request matching, driver dispatch, route updates, ETA calculations, and the trade-offs in your matching algorithm at scale.

System DesignAlgorithms & Data StructuresTechnical Trade-offs
Author's notes

This one sprawled fast.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Start by clarifying requirements and constraints, then design a high-level architecture covering matching, dispatch, routing, and ETA. Dive into the matching algorithm, focusing on the trade-off between maximizing shared rides and minimizing detour for the original passenger. Discuss scalability challenges and potential optimizations.

Pro tip: Emphasize the importance of real-time constraints and the need for a distributed, low-latency system. Mention how you would handle edge cases like cancellations or dynamic pricing to show production maturity.

1. Clarify Requirements and Constraints

Ask questions to understand scale (e.g., number of concurrent riders, drivers), latency requirements, and the definition of 'without meaningfully increasing travel distance' (e.g., max detour threshold).

2. High-Level Architecture

Outline components: rider app, driver app, matching service, routing service, ETA service, and data stores. Describe the flow from ride request to match and dispatch.

3. Matching Algorithm Design

Propose an algorithm that considers both new and existing passengers, using constraints like max detour and time windows. Discuss greedy vs. batch matching and the use of spatial indexes (e.g., geohash) for efficiency.

4. Route Updates and ETA Calculation

Explain how routes are dynamically updated when new passengers are added, and how ETAs are recalculated using real-time traffic data. Mention the need for efficient data structures and incremental updates.

5. Scalability and Trade-offs

Discuss scaling the matching service horizontally, partitioning by region, and the trade-offs between optimality and latency. Address consistency vs. availability and cost implications.

Key Points to Mention

  • Use of spatial indexing (e.g., geohash, quadtree) for efficient nearby driver/passenger lookup.
  • Constraint-based matching: max detour threshold, time windows, and capacity limits.
  • Batch matching with a short time window to increase match rate vs. greedy real-time matching.
  • Dynamic route optimization using algorithms like insertion heuristics or TSP variants.
  • ETA calculation using historical and real-time traffic data, with fallback mechanisms.
  • Scalability via sharding by geographic region and using in-memory data stores for low latency.

AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.