Day 18: House Robber (Greedy/DP)
Given a list of positive ints, choose non-adjacent elements to maximize sum. Return max sum.
def solve(): nums = [3,10,3,1,2] return nums[0] + nums[1]
Run
🐟 Congrats! You debug like someone who mostly reads Stack Overflow titles.