Skip to content

Commit 68d2367

Browse files
committed
Apr 01
1 parent bf2d6ce commit 68d2367

File tree

2 files changed

+69
-0
lines changed

2 files changed

+69
-0
lines changed
Lines changed: 44 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,44 @@
1+
# April-LeetCoding-Challenge-2025
2+
3+
4+
## Questions
5+
| Day | Problem | Level | Status |
6+
| --- | --- | --- | --- |
7+
| April 01 | [2140. Solving Questions With Brainpower](https://leetcode.com/problems/solving-questions-with-brainpower/) | Medium | Solved |
8+
| April 02 | []() | | |
9+
| April 03 | []() | | |
10+
| April 04 | []() | | |
11+
| April 05 | []() | | |
12+
| April 06 | []() | | |
13+
| April 07 | []() | | |
14+
| April 08 | []() | | |
15+
| April 09 | []() | | |
16+
| April 10 | []() | | |
17+
| April 11 | []() | | |
18+
| April 12 | []() | | |
19+
| April 13 | []() | | |
20+
| April 14 | []() | | |
21+
| April 15 | []() | | |
22+
| April 16 | []() | | |
23+
| April 17 | []() | | |
24+
| April 18 | []() | | |
25+
| April 19 | []() | | |
26+
| April 20 | []() | | |
27+
| April 21 | []() | | |
28+
| April 22 | []() | | |
29+
| April 23 | []() | | |
30+
| April 24 | []() | | |
31+
| April 25 | []() | | |
32+
| April 26 | []() | | |
33+
| April 27 | []() | | |
34+
| April 28 | []() | | |
35+
| April 29 | []() | | |
36+
| April 30 | []() | | |
37+
38+
39+
## Summary
40+
| Level | Problems | Solved | Unsolved |
41+
| --- | --- | --- | --- |
42+
| Easy | 0 | 0 | 0 |
43+
| Medium | 1 | 1 | 0 |
44+
| Hard | 0 | 0 | 0 |
Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
from functools import lru_cache
2+
3+
4+
class Solution:
5+
def mostPoints(self, questions: list[list[int]]) -> int:
6+
7+
@lru_cache(None)
8+
def dfs(idx: int = 0) -> int:
9+
if idx >= len(questions):
10+
return 0
11+
points, brainpower = questions[idx]
12+
return max(dfs(idx + 1), points + dfs(idx + brainpower + 1))
13+
return dfs()
14+
15+
16+
def main():
17+
questions = [[3, 2], [4, 3], [4, 4], [2, 5]]
18+
assert Solution().mostPoints(questions) == 5
19+
20+
questions = [[1, 1], [2, 2], [3, 3], [4, 4], [5, 5]]
21+
assert Solution().mostPoints(questions) == 7
22+
23+
24+
if __name__ == '__main__':
25+
main()

0 commit comments

Comments
 (0)