You are given an array of strings words.

The distance between two indices i and j (where i $\leq$ j) is defined as j $-$ i $+$ $1$.

Return the maximum distance between two indices i and j such that words[i] $\neq$ words[j]. If no two unequal words exist, return $0$.

Constraints:

• $1 \leq$ words.length $\leq 100$

• $1 \leq$ words[i].length $\leq 10$

• words[i] consists of lowercase English letters.

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.