PracHub
QuestionsPremiumLearningGuidesInterview PrepNEWCoaches
|Home/System Design/Uber

Design MapReduce for schedule aggregation

Last updated: Mar 29, 2026

Quick Overview

This question evaluates a candidate's ability to design MapReduce-based distributed data processing for aggregating calendar availability, focusing on partitioning, time representation, handling data skew, and validating correctness and performance at scale.

  • medium
  • Uber
  • System Design
  • Software Engineer

Design MapReduce for schedule aggregation

Company: Uber

Role: Software Engineer

Category: System Design

Difficulty: medium

Interview Round: Onsite

Design a MapReduce pipeline that processes large-scale scheduling data (users’ busy intervals) to compute common available time slots of at least duration d for specified groups. Define the map outputs (keys/values), partitioning, and reduce logic; explain how you discretize time, mitigate data skew, and validate results at scale.

Quick Answer: This question evaluates a candidate's ability to design MapReduce-based distributed data processing for aggregating calendar availability, focusing on partitioning, time representation, handling data skew, and validating correctness and performance at scale.

Related Interview Questions

  • Design an Uber Eats Cart Service - Uber (medium)
  • Design a Scalable Calendar Service - Uber (medium)
  • Design A URL Shortener - Uber (medium)
  • Design Restaurant Search and Monitoring - Uber (hard)
  • Design Nearby Restaurant Search - Uber
Uber logo
Uber
Aug 1, 2025, 12:00 AM
Software Engineer
Onsite
System Design
5
0

MapReduce Design: Common Availability From Busy Intervals

Context

You are given large-scale calendar data: each user has 0 or more busy intervals during the day. For a set of specified groups (each group is a set of user IDs), compute the common available time slots whose duration is at least d minutes. Assume all timestamps are normalized to UTC and intervals are half-open [start, end).

Input datasets:

  • Busy intervals: records (user_id, start_ts, end_ts)
  • Group membership: records (group_id, user_id)
  • Query parameter: minimum duration d (minutes)

Output:

  • For each (group_id, calendar_day), the list of common free intervals of length ≥ d.

Requirements

  1. Define the Map outputs (keys/values), partitioning, and Reduce logic.
  2. Explain how you discretize time (or avoid discretization) and the trade-offs.
  3. Describe how you mitigate data skew (e.g., very large groups, rush-hour hotspots).
  4. Explain how you validate correctness and performance at scale.

Solution

Show

Comments (0)

Sign in to leave a comment

Loading comments...

Browse More Questions

More System Design•More Uber•More Software Engineer•Uber Software Engineer•Uber System Design•Software Engineer System Design
PracHub

Master your tech interviews with 7,500+ real questions from top companies.

Product

  • Questions
  • Learning Tracks
  • Interview Guides
  • Resources
  • Premium
  • For Universities
  • Student Access

Browse

  • By Company
  • By Role
  • By Category
  • Topic Hubs
  • SQL Questions
  • Compare Platforms
  • Discord Community

Support

  • support@prachub.com
  • (916) 541-4762

Legal

  • Privacy Policy
  • Terms of Service
  • About Us

© 2026 PracHub. All rights reserved.