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 RoleNestProblem Set
🔥House Robber: Non-Adjacent MaximizationMedium
DAILY PROBLEM OF THE DAY+50 XP • Daily Streak
Solve today's challenge or tackle one of the 3 Super Hard challenges for +150 XP.
MediumDynamic Programming•Acceptance: 50.4%
House Robber: Non-Adjacent Maximization
Targeted in FAANG & Tech OA:GoogleAmazonMicrosoft
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
Recruiter Fast-Track ReferralVerified Candidate
Direct pipeline to Google, Amazon, Microsoft, Swiggy, & Uber recruiters
Top DevScore profiles bypass resume screening filters. Every verified problem solve writes authentic proof-of-work to your profile and dispatches you directly into employer inboxes on RoleNest.
Explore 5,000+ Direct ATS Openings on RoleNest ↗✓ Direct Referral Active
Language:
Ready to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.