The interview process consisted of three 40-minute technical interviews, conducted one after the other, each with a different interviewer.

The first interview focused on learning a new coding language (Go) on the spot.

The second interview focused on OOP code design.

The third interview focused on algorithmic problem-solving.

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. This means the first house is the neighbor of the last one. Meanwhile, adjacent houses have security systems connected, and they will automatically contact the police if two adjacent houses are broken into on the same night.

Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.

Example 1: Input: [2,3,2] Output: 3 (To be solved in any programming language/pseudo-code)