133. House Robber

Write a function solve that finds the maximum amount of money that can be robbed from houses without robbing adjacent ones. The houses will be given as a list where the value you can steal is given as integers in the list.

Example:
Input: [1,2,3,1]
Output: 4
Explanation: Rob houses 1 and 3, total amount = 1 + 3 = 4.

Run this challenge interactively in Python or JavaScript when the app loads.