House robber circular
Houses with non-negative values are arranged in a circle given by 'nums' (the first and last houses are adjacent). Choose a subset of houses with maximum total value such that no two adjacent houses are chosen. Return the maximum total value. 1 <= len(nums) <= 10^5, 0 <= nums[i] <= 10^4.
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