Leetcode 2140: Solving Questions With Brainpower
In this problem, we are trying to find a testing strategy to optimize the number of points in a test giving the following rules:
You are given a 0-indexed 2D integer array
questions[i] = [pointsi, brainpoweri].
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
iwill earn you
pointsipoints but you will be unable to solve each of the next