solulubeta
Sign in
Story Problems / Dynamic programming
07.02 · Problem

Neighbour-Alarm Robbery

Medium 1-D DP · take / skip Pro

This problem is part of solulu Pro

A street has n houses in a row with cash a[i] in house i. Neighbouring houses share an alarm: robbing two adjacent houses on the same night triggers it. What is the maximum cash that can be taken without triggering the…

Lifetime ₹2,000 ₹1,000 · Beta offer
Mark this problem as solved when you are finished.

Item 76 of 94 · updated 2026-10-12