Leetcode 2594. Minimum Time to Repair Cars

Given mechanics where a mechanic of rank r needs r * n^2 minutes to fix n cars, find the minimum time T such that all mechanics working in parallel can fix at least cars total; this reduces to finding the smallest T for which sum floor(sqrt(T / r_i)) >= cars, typically solved with a binary search over time.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2594. Minimum Time to Repair Cars

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact