FastPrep
Problem · Array

House Robber I

Learn this problem
● MediumInMobi logoInMobiFULLTIMEPHONE SCREEN

Problem statement

You are given an integer array nums. The value nums[i] is the amount available in the ith house on a street.

You may choose any set of houses, but you cannot choose two adjacent houses.

Return the maximum total amount you can collect.

Function

rob(nums: int[]) → int

Examples

Example 1

nums = [2,5,1,3]return = 8

Choose the houses with amounts 5 and 3. They are not adjacent, and their total is 8.

Example 2

nums = [4,1,1,9,1]return = 13

Choose the first house with amount 4 and the fourth house with amount 9 for a total of 13.

Constraints

  • 1 <= nums.length <= 10^5
  • 0 <= nums[i] <= 10^4
  • The maximum total fits in a signed int.

More InMobi problems

drafts saved locally
public int rob(int[] nums) {
    // write your code here
}
nums[2,5,1,3]
expected8
checking account