Find minimal time to serve customers

Q: Find minimal time to serve customers

This is a Coding & Algorithms interview question from Pinterest for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You manage a bank with k tellers; teller i takes serviceTimes[i] minutes to serve one customer and works continuously. Given an integer array serviceTimes and an integer m (customers to serve), return the minimum integer time T such that sum over i of floor(T / serviceTimes[i]) >= m. Describe your algorithm, prove correctness, analyze time/space complexity, and implement it. Discuss edge cases (very large m, slow tellers, identical rates).

Find minimal time to serve customers

Comments (0)