House Robber

Problem statement

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 system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.
Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.
You can find and test your solution on Leetcode: house robber.

For example, if we consider the following array: [10 13 23 17 6 11 18 16] representing the amount of money of each house along the street then the robber can earn 60$ without being detected.
Indeed, if the robber steals the house 0 (10$), the house 2 (23$), the house 5 (11$) and the house 7 (16$), it repesents 60$ in total and no robbed houses are stolen.