filmov
tv
Solving Questions With Brainpower - LeetCode 2140 - Python Solution

Показать описание
Solution Blog (sign into leetcode to view):
Approach:
There are two different paths!
1. Grab the current questions points & skip "cost" questions ahead
2. Don't add any points & move to the next question
First look at implementing the top down recursive solution, then look at how to cache it (memoization). Finally, think about how can I take this implicit recursive relationship and translate it into an explicit bottom up solution!
Complexity:
- Time: O(N)
- Space: O(N)
Hope this helped a bit! Have an awesome day!
#leetcode #python #tutorial
Approach:
There are two different paths!
1. Grab the current questions points & skip "cost" questions ahead
2. Don't add any points & move to the next question
First look at implementing the top down recursive solution, then look at how to cache it (memoization). Finally, think about how can I take this implicit recursive relationship and translate it into an explicit bottom up solution!
Complexity:
- Time: O(N)
- Space: O(N)
Hope this helped a bit! Have an awesome day!
#leetcode #python #tutorial