House Robber
Too Long; Didn't Read
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 and alert the police if two adjacent houses were broken into on the same night**. Given an integer array, return the maximum amount you can rob tonight**without alerting the police***. Author: Sergei Golitsyn. The problem was solved by using an algorithm called 'robber'