Binary Searchmedium45 minFull Stack Developer

Scheduler Minimum Feasible Throughput

Full Stack Developer signal: binary search on answer + monotonic predicate in a campaign scheduler context. This is a ProdMatch-owned full stack engineer drill, framed as a April 2026 Meesho Marketing Automation simulation, not a copied platform question.

Company context

Meesho · Marketing Automation

Freshness

April 2026

Product surface

campaign scheduler

ProdMatch interview simulation based on product-team patterns; not a claim of a real company question.

Question

For campaign scheduler, choose the minimum processing rate so all campaigns finish before deadline. Each worker can process rate units per minute, rounded up per item.

Input

Work item sizes and deadline minutes.

Output

Minimum integer rate.

Constraints

1 <= items.length <= 200000
1 <= item size <= 1e9
Deadline is at least items.length.

Concepts

workflow graphs
API pagination
cache invalidation
binary search on answer
monotonic predicate

sizes [3,6,7,11], deadline=8 -> 4

Approach

Try framing your own approach first. The 30 seconds you think before peeking is where learning happens.

Clean Solution

Reveal the approach first.

How well did you understand?

Your rating tunes when this problem shows up again.

Common Mistakes

Use low + (high - low) // 2 to avoid overflow.
The predicate must be monotonic or binary search is invalid.

Next Similar Problems

Onboarding Minimum Feasible Throughputmedium Billing Minimum Feasible Throughputmedium CRM Minimum Feasible Throughputmedium