There are n flights labeled from $1$ to n.

You are given an array of flight bookings bookings, where bookings[i] = [first_i, last_i, seats_i] represents a booking for all flights from first_i to last_i inclusive, with seats_i seats reserved for each flight.

Return an array answer of length n, where answer[i] is the total number of seats reserved for flight $i + 1$.

Constraints:

• $1 \leq$ n $\leq 2 imes 10^4$

• $1 \leq$ bookings.length $\leq 2 imes 10^4$

• bookings[i].length $= 3$

• $1 \leq$ first_i $\leq$ last_i $\leq$ n

• $1 \leq$ seats_i $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.