Implement `rob(nums)` returning the maximum sum you can take without picking two adjacent elements.
+ 1 hidden test run on Submit.
Rolling the best-including and best-excluding values yields the answer in O(n) time, O(1) space.
Run your code to see results.