Topic: Greedy Algorithm Problem / Level: beginner

Problem: You are given an array of houses, each containing money. Maximize the total amount you can rob without robbing two adjacent houses.

Run the code to see the output here...