BBMP Pothole Corridor Detection
BBMP Pothole Corridor Detection
HardArrays100% accepted
BBMP Bangalore receives pothole reports as GPS coordinates along roads. Find the longest continuous corridor where consecutive potholes are within distance D to prioritize repair zones.
Approach
Given an array of sorted pothole coordinates and distance threshold D, find the longest consecutive corridor where adjacent potholes are at most D units apart.
Input
coords=[10,15,20,30,35],D=5
Output
3
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