Algorithm
Two Furthest Houses With Different Colors
Solution
class Solution:
def maxDistance(self, colors: List[int]) -> int:
n = len(colors)
res = 0
for i in range(n):
for j in range(i + 1, n):
if colors[i] != colors[j]:
res = max(res, j - i)
return resTime Complexity
O(n^2)
Space Complexity
O(1)
