Parking Lot Slot Optimization Challenge
Parking Lot Slot Optimization Challenge
HardArrays0% accepted
Priya manages a multi-level parking structure in Bangalore. Each level has slots with different sizes. She receives vehicle requests with specific size requirements and must find the level with maximum contiguous available space to minimize fragmentation for future vehicles.
Approach
Given an array of parking levels with available slots, find which level has the largest contiguous empty space after placing vehicles of given sizes.
Input
slots=[0,0,3,0,2,0,0], vehicles=[2,1]
Output
2
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