House Robber

Medium•array•Expected: O(n) time, O(n) space•Interview Context

dynamic-programming

Problem

Given an array representing money in each house, return the maximum amount you can rob without robbing two adjacent houses.

Language: