From 31174e124cfbf1f788027e7c65f2d3b15631976f Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Thu, 2 Oct 2025 12:50:31 -0400 Subject: [PATCH] Create README - LeetHub --- 0213-house-robber-ii/README.md | 36 ++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 0213-house-robber-ii/README.md diff --git a/0213-house-robber-ii/README.md b/0213-house-robber-ii/README.md new file mode 100644 index 0000000..e45c4fa --- /dev/null +++ b/0213-house-robber-ii/README.md @@ -0,0 +1,36 @@ +

213. House Robber II

Medium

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. 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.

+ +

Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,2]
+Output: 3
+Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,1]
+Output: 4
+Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
+Total amount you can rob = 1 + 3 = 4.
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3]
+Output: 3
+
+ +

 

+

Constraints:

+ +