You are given a $2$D integer array coins and an integer k. Each element coins[i] $= [l_i, r_i, c_i]$ represents a contiguous range of bags from position $l_i$ to $r_i$ inclusive, where each bag contains $c_i$ coins. Any position that does not fall into any segment contains $0$ coins.

You want to collect coins from a sequence of k consecutive bags.

Return the maximum total number of coins you can collect from any window of k consecutive bags.

Constraints:

• $1 \leq$ coins.length $\leq 10^5$

• $1 \leq$ k $\leq 10^9$

• coins[i] $= [l_i, r_i, c_i]$

• $1 \leq l_i \leq r_i \leq 10^9$

• $1 \leq c_i \leq 1000$

• The given segments do not overlap.

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.