solves two furthest houses with different color

Author: anishLearnsToCode

Diff for: README.md

@@ -493,7 +493,7 @@
 | 2062 | [Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string)                                                    |                                                          [![Java](assets/java.png)](src/CountVowelSubstringsOfAString.java)                                                          |                                                                                                                                   |
 | 2068 | [Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent)                          |                                                    [![Java](assets/java.png)](src/CheckWhetherTwoStringsAreAlmostEquivalent.java)                                                    |                                                                                                                                   |
 | 2073 | [Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets)                                                                    |                                                             [![Java](assets/java.png)](src/TimeNeededToBuyTickets.java)                                                              |                                                                                                                                   |
-| 2078 | [Two Furthest Houses With Different Colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors)                                      |                                                                                                                                                                                      |                                                                                                                                   |
+| 2078 | [Two Furthest Houses With Different Colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors)                                      |                                                        [![Java](assets/java.png)](src/TwoFurthestHousesWithDifferentColors.java)                                                         |                                                                                                                                   |
 | 2085 | [Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence)                                            |                                                                                                                                                                                      |                                                                                                                                   |
 | 2089 | [Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array)                                          |                                                                                                                                                                                      |                                                                                                                                   |
 | 2094 | [Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers)                                                                |                                                                                                                                                                                      |                                                                                                                                   |

Diff for: src/TwoFurthestHousesWithDifferentColors.java

@@ -0,0 +1,9 @@
+public class TwoFurthestHousesWithDifferentColors {
+    public int maxDistance(int[] colors) {
+        int i = colors.length - 1;
+        for ( ; i >= 0 && colors[i] == colors[0] ; i--);
+        int distance = i;
+        for (i = 0 ; i < colors.length && colors[i] == colors[colors.length - 1] ; i++);
+        return Math.max(distance, colors.length - 1 - i);
+    }
+}