Binary Searchhard70 minPlatform Engineer

Packages Minimum Feasible Throughput

Platform Engineer signal: binary search on answer + monotonic predicate in a package dependency index context. This is a ProdMatch-owned platform engineer drill, framed as a May 2026 InMobi DevEx simulation, not a copied platform question.

Company context

InMobi · DevEx

Freshness

May 2026

Product surface

package dependency index

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

Question

For package dependency index, choose the minimum processing rate so all packages 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

build DAGs
tenant quotas
artifact caching
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

Build Minimum Feasible Throughputmedium Artifacts Minimum Feasible Throughputmedium Tenancy Minimum Feasible Throughputmedium