Solving Questions With Brainpower solution leetcode

For Solution
Click Here!
Solving Questions With Brainpower solution leetcode: You are given a 0indexed 2D integer array questions
where questions[i] = [points_{i}, brainpower_{i}]
.
The array describes the questions of an exam, where you have to process the questions in order (i.e., starting from question 0
) and make a decision whether to solve or skip each question. Solving question i
will earn you points_{i}
points but you will be unable to solve each of the next brainpower_{i}
questions. If you skip question i
, you get to make the decision on the next question.
 For example, given
questions = [[3, 2], [4, 3], [4, 4], [2, 5]]
: If question
0
is solved, you will earn3
points but you will be unable to solve questions1
and2
.  If instead, question
0
is skipped and question1
is solved, you will earn4
points but you will be unable to solve questions2
and3
.
 If question
Return the maximum points you can earn for the exam.
Example 1: Solving Questions With Brainpower solution leetcode
Input: questions = [[3,2],[4,3],[4,4],[2,5]] Output: 5 Explanation: The maximum points can be earned by solving questions 0 and 3.  Solve question 0: Earn 3 points, will be unable to solve the next 2 questions  Unable to solve questions 1 and 2  Solve question 3: Earn 2 points Total points earned: 3 + 2 = 5. There is no other way to earn 5 or more points.
Solving Questions With Brainpower solution leetcode Example 2:
Input: questions = [[1,1],[2,2],[3,3],[4,4],[5,5]] Output: 7 Explanation: The maximum points can be earned by solving questions 1 and 4.  Skip question 0  Solve question 1: Earn 2 points, will be unable to solve the next 2 questions  Unable to solve questions 2 and 3  Solve question 4: Earn 5 points Total points earned: 2 + 5 = 7. There is no other way to earn 7 or more points.
Constraints: Solving Questions With Brainpower solution leetcode
1 <= questions.length <= 10^{5}
questions[i].length == 2
1 <= points_{i}, brainpower_{i} <= 10^{5}

For Solution
Click Here!