House Robber II

Try to solve the House Robber II problem.


A professional robber plans to rob some houses along a street. These houses are arranged in a circle, which means that the first and the last house are neighbors. The robber cannot rob adjacent houses because they have security alarms installed.

Following the constraints mentioned above and given an integer array money representing the amount of money in each house, return the maximum amount the robber can steal without alerting the police.


  • 11\leq money.length 103\leq 10^3
  • 00\leq money[i] 103\leq 10^3

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy