House Robber II

# Introduction

In this challenge, we will be solving the House Robber II problem. The goal is to determine the maximum amount of money a professional thief can rob from a street with houses arranged in a circle, without alerting the police. We need to write a function `rob2` that takes an integer array representing the amount of money in each house, and returns the maximum amount that can be robbed.