Available question text
Find the minimum positive integer speed such that, when intermediate trains can only depart at integer hours (so each of the first n-1 rides contributes ceil(dist[i]/speed) hours and the last ride contributes dist[n-1]/speed hours), the total commute time ≤ hour; return -1 if no such speed exists. This is a monotonic feasibility check over speed (suitable for binary search).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1870. Minimum Speed to Arrive on Time
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source