House robber
Given house values along a street, return the maximum you can rob without robbing two adjacent houses.
Implement
rob(nums: list[int]) → intExamples
in
[[1,2,3,1]]out4What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,2,3,1]]4not run yetsample