ProblemNest
Sign In
You are coding as a Guest. Sign in with Google in 1 tap to save your daily streak, lock in +50 XP & boost your college rank!
Save Streak (1-Tap Google)
9:00 AM Daily Incident ReleaseMaintaining a 7-day streak grants a 2.5× Recruiter Visibility Multiplier on the Recruiter Talent Radar.
Multiplier Ladder:1d: 1.0ו3d: 1.5ו7d: 2.5× MAX
🔥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
Verified Proof-of-Work ATS PortfolioCryptographic Verification
Export tamper-proof problem verifications to your direct ATS applications
DevScore: Unranked (0/1000)

Every verified problem solve writes authentic cryptographic proof-of-work to your profile. Attach your verified DevScore badge to ATS applications to stand out to engineering hiring teams across 4,000+ verified live tech openings (23,000+ cumulative audited) on RoleNest.

Explore 4,000+ Direct ATS Openings on RoleNest ↗Solve Challenge to Activate Ledger