Tiffin Delivery Route Minimum Time
Tiffin Delivery Route Minimum Time
MediumArrays0% accepted
Ravi runs a dabba (tiffin) delivery service in Pune. Today he has N delivery stops, each requiring a certain time. He must serve all stops but can skip exactly 1 to reduce total time. Find the minimum total time.
Approach
Given an array of N delivery times, find the minimum total time by excluding exactly one stop.
Input
5
15 20 10 25 30
Output
70
More Arrays 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