**Problem Statement:**
Given the required input arguments, write an efficient algorithm to solve the **House Robber** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge.
**Hint / Expected Approach:**
dp[i] = max(dp[i-1], dp[i-2] + nums[i])
**Edge Cases to Consider:**
- (1) Single house
- (2) Two houses
- (3) All same values