Easy Problemsoptimizationlinear
House Robber
Given a row of n houses, each holding some amount of money, choose a subset of houses to rob so that no two chosen houses are next to each other. Maximize the total amount collected.
Do this lesson first: house robberThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.