{"id":809,"date":"2025-07-30T16:42:57","date_gmt":"2025-07-30T11:12:57","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=809"},"modified":"2025-07-30T16:42:59","modified_gmt":"2025-07-30T11:12:59","slug":"house-robber-ii","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/house-robber-ii\/","title":{"rendered":"House Robber II | Leetcode 213 | All 4 Solutions"},"content":{"rendered":"\n

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle.<\/strong> That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses were broken into on the same night<\/strong>.<\/p>\n\n\n\n

Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

Given an integer array nums<\/code> representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police<\/strong><\/em>.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> nums = [2,3,2]
Output:<\/strong> 3
Explanation:<\/strong> You cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses.<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [1,2,3,1]
Output:<\/strong> 4
Explanation:<\/strong> Rob house 1 (money = 1) and then rob house 3 (money = 3).
Total amount you can rob = 1 + 3 = 4.<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [1,2,3]
Output:<\/strong> 3<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n