2078. Two Furthest Houses With Different Colors (Easy) - TengnanYao/daily_leetcode GitHub Wiki

class Solution:
    def maxDistance(self, colors: List[int]) -> int:
        n = len(colors)
        for i in range(n):
            if colors[-1] != colors[i]:
                for j in range(n - 1, -1, -1):
                    if colors[j] != colors[0]:
                        return max(n - 1 - i, j)