Skip to main content
House Robber | AlgoCracked
AlgoCracked
ProblemsHouse Robber
Medium50.0% acceptance
Dynamic ProgrammingArray

House Robber

Houses along a street each hold some money nums[i] . You cannot rob two adjacent houses (an alarm links neighbours). Return the maximum total you can rob. Input format Input is a single array, e.g. [[2,7,9,3,1]] .

Loading workspace…