cpp-flashcards/org/study_deck_02/dsa/1-d-dynamic-programming/0198-house-robber.org

#+ANKI_DECK: study_deck_02
* TODO 0198. House Robber :medium:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*0198. House Robber][0198. House Robber]]
:END:

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 and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given an integer array ~nums~ representing the amount of money of each house, return /the maximum amount of money you can rob tonight without alerting the police/.

*Example 1:*


#+begin_src
Input: nums = [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
Total amount you can rob = 1 + 3 = 4.
#+end_src


*Example 2:*


#+begin_src
Input: nums = [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
Total amount you can rob = 2 + 9 + 1 = 12.
#+end_src


*Constraints:*

 - ~1 <= nums.length <= 100~

 - ~0 <= nums[i] <= 400~

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python :lc-problem 198 :lc-lang python3
class Solution:
    def rob(self, nums: List[int]) -> int:
#+end_src

** TODO C++
#+begin_src cpp :lc-problem 198
class Solution {
public:
    int rob(vector<int>& nums) {
        
    }
};
#+end_src