Problem Statement There are houses in a row, and each house contains amount of cash. A robber wants to steal from these houses, but he cannot rob two consecutive houses.
You have to help him and determine the maximum amount of money the robber can get. Constraints: Check the examples on the problem page. Work through examples by hand before coding. Understanding the pattern makes implementation simple. Practice with similar problems to reinforce your understanding.