House Robber

#198
Medium
Dynamic Programming
O(n)
O(1)
Amazon
Microsoft
Google
View on LeetCode

Problem Description

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected.