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).