#198

House Robber

medium· 1-D DPruns: 0

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; if two adjacent houses are robbed on the same night, the police are alerted. Given an integer array nums representing the money in each house, return the maximum you can rob tonight without alerting the police.

wpm 0acc 100%time 0:000 / 183

class Solution:
    def rob(self, nums: list[int]) -> int:
        prev, curr = 0, 0
        for num in nums:
            prev, curr = curr, max(curr, prev + num)
        return curr

click the box to focus · tab inserts 4 spaces · backspace to correct · esc to pause

desktop only

codedrill is a typing game and needs a real keyboard. open this on a laptop or desktop to practice.

you can still browse problems and sections from your phone.