House robber teaches DP where each step is a choice with a constraint: take this item and lose its neighbour, or skip it. Greedy picks like "take the biggest" fail here, which is exactly why DP is needed. The same take-or-skip idea appears in scheduling with gaps and in many array optimisation questions. It is a very common interview warm-up for DP rounds.