Milk Van Route Optimization Stop
Milk Van Route Optimization Stop
MediumBinary Search0% accepted
A milk van driver in Bangalore has a sorted list of delivery routes based on time. He needs to find the optimal stop to make a delivery at a specific time.
Approach
Given an array of delivery times (minutes from start) and a target time, find the closest delivery stop.
Input
times=[30, 60, 90, 120, 150], target=95
Output
2
More Binary Search problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards