2140. Solving Questions With Brainpower Medium

@problem@discussion
#Array#Dynamic Programming



1/**
2 * [2140] Solving Questions With Brainpower
3 *
4 * You are given a 0-indexed 2D integer array questions where questions[i] = [pointsi, brainpoweri].
5 * 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 pointsi points but you will be unable to solve each of the next brainpoweri questions. If you skip question i, you get to make the decision on the next question.
6 * 
7 * 	For example, given questions = [[3, 2], [4, 3], [4, 4], [2, 5]]:
8 * 	
9 * 		If question 0 is solved, you will earn 3 points but you will be unable to solve questions 1 and 2.
10 * 		If instead, question 0 is skipped and question 1 is solved, you will earn 4 points but you will be unable to solve questions 2 and 3.
11 * 	
12 * 	
13 * 
14 * Return the maximum points you can earn for the exam.
15 *  
16 * Example 1:
17 * 
18 * Input: questions = [[3,2],[4,3],[4,4],[2,5]]
19 * Output: 5
20 * Explanation: The maximum points can be earned by solving questions 0 and 3.
21 * - Solve question 0: Earn 3 points, will be unable to solve the next 2 questions
22 * - Unable to solve questions 1 and 2
23 * - Solve question 3: Earn 2 points
24 * Total points earned: 3 + 2 = 5. There is no other way to earn 5 or more points.
25 * 
26 * Example 2:
27 * 
28 * Input: questions = [[1,1],[2,2],[3,3],[4,4],[5,5]]
29 * Output: 7
30 * Explanation: The maximum points can be earned by solving questions 1 and 4.
31 * - Skip question 0
32 * - Solve question 1: Earn 2 points, will be unable to solve the next 2 questions
33 * - Unable to solve questions 2 and 3
34 * - Solve question 4: Earn 5 points
35 * Total points earned: 2 + 5 = 7. There is no other way to earn 7 or more points.
36 * 
37 *  
38 * Constraints:
39 * 
40 * 	1 <= questions.length <= 10^5
41 * 	questions[i].length == 2
42 * 	1 <= pointsi, brainpoweri <= 10^5
43 * 
44 */
45pub struct Solution {}
46
47// problem: https://leetcode.com/problems/solving-questions-with-brainpower/
48// discuss: https://leetcode.com/problems/solving-questions-with-brainpower/discuss/?currentPage=1&orderBy=most_votes&query=
49
50// submission codes start here
51
52impl Solution {
53    pub fn most_points(questions: Vec<Vec<i32>>) -> i64 {
54        
55    }
56}
57
58// submission codes end
59
60#[cfg(test)]
61mod tests {
62    use super::*;
63
64    #[test]
65    fn test_2140() {
66    }
67}
68


Back
© 2025 bowen.ge All Rights Reserved.