House robber circular
Houses are arranged in a circle (first and last are adjacent). Return the max you can rob without robbing two adjacent houses.
Implement
rob_circular(nums: list[int]) → intExamples
in
[[2,3,2]]out3What 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
[[2,3,2]]3not run yetsample