Compute minimum servers for cyclic tasks
Company: Google
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Overview: This question evaluates understanding of interval scheduling, overlap detection, and handling cyclic time via modular arithmetic for tasks that wrap past midnight, reflecting competency in reasoning about resource allocation on continuous timelines.