#715Medium#145 in Infosys's list· asked at 11 companies
House Robber II
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: nums = [2,3,2] Output: 3
You cannot rob house 1 and house 3 since they are adjacent.
Example 2
Input: nums = [1,2,3,1] Output: 4
Example 3
Input: nums = [1,2,3] Output: 3
Constraints
- •
1 <= nums.length <= 100 - •
0 <= nums[i] <= 1000