You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. The constraint is that adjacent houses have security systems, and it will contact the police if two adjacent houses are broken into on the same night. Given an integer array representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.
Click Run to execute sample tests.