Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1109. Corporate Flight Bookings
Given n flights and bookings [first, last, seats] that add seats to every flight in a range, compute the final seats per flight; the core challenge is applying many range additions efficiently (use a difference array + prefix sum to get O(n + m) time).
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid October, 2024
Junior
Solve a problem about trains, tickets, and people onboarding and offboarding (variation of range queries problem)
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.