Marathon Checkpoint Coverage
Marathon Checkpoint Coverage
HardArrays0% accepted
Race organizers in Mumbai place N checkpoints at various distances. K checkpoints malfunction simultaneously (contiguous segment). Removing malfunctioning checkpoints, find the maximum total distance covered by remaining checkpoints.
Approach
Find the maximum sum of a subarray after removing one contiguous subarray of length exactly K.
Input
5 2
10 5 8 3 7
Output
23
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