← Google questions
Coding1900 Codeforces rating

Minimize uncovered segments given segment array and workers

Filed under Google

Given an array of non-overlapping time segments and k workers who can each work for a fixed duration q in one go, find the minimum number of uncovered segments.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.