Day 48 of LeetCode
Documenting LeetCode solving.
Q125
312. Burst Balloons
Hard. DP
Reverse thinking.
class Solution:
def maxCoins(self, nums: List[int]) -> int:
nums = [1] + nums + [1]
dp = {}
def dfs(l, r):
if l > r:
...
evelynsjourney.hashnode.dev1 min read