There are $n$ houses lined up on a street, with each house painted in a certain color. You are given a $0$ indexed integer array colors of length $n$, where colors[i] represents the color of the $i^{ ext{th}}$ house.

The distance between the $i^{ ext{th}}$ house and the $j^{ ext{th}}$ house is defined as $|i - j|$.

Return the maximum possible distance between two houses that have different colors.

Constraints:

• n == colors.length

• $2 \leq n \leq 100$

• $0 \leq$ colors[i] $\leq 100$

• At least two houses have different colors in the generated test data.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.