You are given a $2$D integer array events where events[i] = [startTime_i, endTime_i, value_i]. The $i^{ ext{th}}$ event starts at startTime_i and ends at endTime_i, and attending this event yields a value of value_i.

You can choose at most $2$ non overlapping events to attend such that the total sum of their values is maximized.

Return the maximum sum of values you can achieve.

Note: If you choose to attend $2$ events, their active intervals cannot overlap. Specifically, if the first event ends at time $t$, the second event must start at a time strictly greater than $t$.

Constraints:

• $2 \leq$ events.length $\leq 10^5$

• events[i].length $= 3$

• $1 \leq$ startTime_i $\leq$ endTime_i $\leq 10^9$

• $1 \leq$ value_i $\leq 10^6$

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.