You are given a $0$ indexed $2$D integer array questions where questions[i] $=$ $[` ext{points}_i`, ` ext{brainpower}_i`]$.

The array represents an exam where you must process the questions in order from index $0$ to index questions.length $- 1$. For each question i, you have two choices:

• Solve question i: You earn points_i points, but you will be unable to solve the next brainpower_i questions. Consequently, the next question you can process is index i $+$ brainpower_i $+ 1$.

• Skip question i: You earn $0$ points and move directly to process question i $+ 1$.

Return the maximum total points you can earn on the exam.

Constraints:

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

• questions[i].length $= 2$

• $1 \leq$ points_i, brainpower_i $\leq 10^5$

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.