Given n houses in a line with money in each, find the maximum amount a robber can steal, without stealing from two adjacent houses.

This problem can be solved using dynamic programming. For each house, the maximum amount that can be stolen is the greater of two options:

1. Robbing the current house: This means adding the current house's money to the maximum amount stolen up to the house two steps back (to avoid adjacent houses).
2. Skipping the current house: This means the maximum amount stolen is simply the maximum amount stolen up to the previous house.

We can iterate through the houses, keeping track of the maximum amounts stolen up to the previous two houses, and calculate the maximum for the current house based on these two options. The final result will be the maximum amount that can be stolen from all houses.