Sign In
You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNest
🔥House Robber: Non-Adjacent MaximizationMedium
MediumDynamic Programming•Acceptance: 50.4%

House Robber: Non-Adjacent Maximization

Real-World Engineering Context
Energy harvesting schedules in IoT mesh nodes and CPU cache slot conflict resolution without adjacent bank collisions.
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. Adjacent houses have security systems connected that will automatically alert the police if two adjacent houses are broken into on the same night. Given an integer array `nums` representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

Sample Test Cases

Input: [[1,2,3,1]]
Expected: 4
Input: [[2,7,9,3,1]]
Expected: 12
Input: [[99]]
Expected: 99

Constraints

  • 1 <= nums.length <= 100
  • 0 <= nums[i] <= 400