IndiGo Seat Allocation Matrix
IndiGo Seat Allocation Matrix
HardArrays0% accepted
Ravi works for IndiGo airlines and needs to allocate seats for a flight from Delhi to Mumbai. Given a 2D seat matrix where some seats are already booked, he must find the longest diagonal line where seats can be allocated together for family groups.
Approach
Given an N×M 2D array representing aircraft seats (0=available, 1=booked), find the longest diagonal sequence of available seats.
Input
[[0,1,0,0],[0,0,1,0],[1,0,0,0],[0,1,0,0]]
Output
4
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