Minimize the Longest Continuous Hiking Time with K Rest Stops

Given an array of positive integers times of length n, where times[i] is the hiking time for the i-th consecutive trail segment, you may place rest stops between adjacent segments.

You must u...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: