Rob houses in circle
Houses are arranged in a circle; house i holds nums[i] coins. You cannot rob two adjacent houses (and house 0 is adjacent to house n-1). You must rob at least one house. Return the maximum coins you can collect. 1 <= n <= 2000, 0 <= nums[i] <= 10^4.
Implement
rob_circle(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