So, we split the problem into two linear subproblems:

We compute the maximum robbery amount for both and return the maximum of the two.

solve() function: It solves the linear House Robber problem using space-optimized dynamic programming.

prev: stores the result for (i-1)th house
prev2: stores the result for (i-2)th house
At each step, we decide whether to pick the current house or not and update accordingly.

Code

#include <