add max distance between colors

Author: boudhayan

Algorithm Solutions In Swift.xcodeproj/project.pbxproj

@@ -27,9 +27,10 @@
 		1F21EF1A2F6899B500E0274E /* TargetIndicies.swift in Sources */ = {isa = PBXBuildFile; fileRef = 1F21EF192F6899AB00E0274E /* TargetIndicies.swift */; };
 		1F21EF1D2F6899E400E0274E /* IsMajorityElement.swift in Sources */ = {isa = PBXBuildFile; fileRef = 1F21EF1C2F6899DC00E0274E /* IsMajorityElement.swift */; };
 		1F21EF202F689A1B00E0274E /* ArrayIntersection.swift in Sources */ = {isa = PBXBuildFile; fileRef = 1F21EF1F2F689A1500E0274E /* ArrayIntersection.swift */; };
-		1F21EF232F689A3D00E0274E /* CountPairs.swift in Sources */ = {isa = PBXBuildFile; fileRef = 1F21EF222F689A3900E0274E /* CountPairs.swift */; };
+		1F21EF232F689A3D00E0274E /* CountPairsII.swift in Sources */ = {isa = PBXBuildFile; fileRef = 1F21EF222F689A3900E0274E /* CountPairsII.swift */; };
 		1F21EF262F689A6000E0274E /* FixedPoint.swift in Sources */ = {isa = PBXBuildFile; fileRef = 1F21EF252F689A5900E0274E /* FixedPoint.swift */; };
 		1F21EF292F689A9B00E0274E /* MaximumCount.swift in Sources */ = {isa = PBXBuildFile; fileRef = 1F21EF282F689A9600E0274E /* MaximumCount.swift */; };
+		1F21EF2C2F6A556900E0274E /* MaxDistanceColors.swift in Sources */ = {isa = PBXBuildFile; fileRef = 1F21EF2B2F6A555F00E0274E /* MaxDistanceColors.swift */; };
 		1F7037522F3E5618002CFFE1 /* Algorithms in Frameworks */ = {isa = PBXBuildFile; productRef = 1F7037512F3E5618002CFFE1 /* Algorithms */; };
 		1F7037552F3E5642002CFFE1 /* BasicContainers in Frameworks */ = {isa = PBXBuildFile; productRef = 1F7037542F3E5642002CFFE1 /* BasicContainers */; };
 		1F7037572F3E5642002CFFE1 /* BitCollections in Frameworks */ = {isa = PBXBuildFile; productRef = 1F7037562F3E5642002CFFE1 /* BitCollections */; };
@@ -375,9 +376,10 @@
 		1F21EF192F6899AB00E0274E /* TargetIndicies.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = TargetIndicies.swift; sourceTree = "<group>"; };
 		1F21EF1C2F6899DC00E0274E /* IsMajorityElement.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = IsMajorityElement.swift; sourceTree = "<group>"; };
 		1F21EF1F2F689A1500E0274E /* ArrayIntersection.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = ArrayIntersection.swift; sourceTree = "<group>"; };
-		1F21EF222F689A3900E0274E /* CountPairs.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = CountPairs.swift; sourceTree = "<group>"; };
+		1F21EF222F689A3900E0274E /* CountPairsII.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = CountPairsII.swift; sourceTree = "<group>"; };
 		1F21EF252F689A5900E0274E /* FixedPoint.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = FixedPoint.swift; sourceTree = "<group>"; };
 		1F21EF282F689A9600E0274E /* MaximumCount.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = MaximumCount.swift; sourceTree = "<group>"; };
+		1F21EF2B2F6A555F00E0274E /* MaxDistanceColors.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = MaxDistanceColors.swift; sourceTree = "<group>"; };
 		1F85E42D2F500D060097933E /* RecursiveBubbleSort.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = RecursiveBubbleSort.swift; sourceTree = "<group>"; };
 		1F85E4302F500D210097933E /* RecusriveInsertionSort.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = RecusriveInsertionSort.swift; sourceTree = "<group>"; };
 		1F85E4352F5062420097933E /* SortedRotated.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = SortedRotated.swift; sourceTree = "<group>"; };
@@ -807,7 +809,7 @@
 		1F21EF212F689A3500E0274E /* Count Pairs */ = {
 			isa = PBXGroup;
 			children = (
-				1F21EF222F689A3900E0274E /* CountPairs.swift */,
+				1F21EF222F689A3900E0274E /* CountPairsII.swift */,
 			);
 			path = "Count Pairs";
 			sourceTree = "<group>";
@@ -828,6 +830,14 @@
 			path = "Maximum Count";
 			sourceTree = "<group>";
 		};
+		1F21EF2A2F6A555A00E0274E /* Max Distance */ = {
+			isa = PBXGroup;
+			children = (
+				1F21EF2B2F6A555F00E0274E /* MaxDistanceColors.swift */,
+			);
+			path = "Max Distance";
+			sourceTree = "<group>";
+		};
 		1F85E42C2F500D010097933E /* Recursive Bubble Sort */ = {
 			isa = PBXGroup;
 			children = (
@@ -1603,6 +1613,7 @@
 				1F21EF212F689A3500E0274E /* Count Pairs */,
 				1F21EF242F689A5400E0274E /* Fixed Point */,
 				1F21EF272F689A9200E0274E /* Maximum Count */,
+				1F21EF2A2F6A555A00E0274E /* Max Distance */,
 			);
 			path = LeetCode;
 			sourceTree = "<group>";
@@ -3070,6 +3081,7 @@
 				6AF5790526A6DCA1007B37CA /* LarrysArray.swift in Sources */,
 				6AA826BC2807584F00F79CDF /* GroupAnagrams1.swift in Sources */,
 				1F21EF052F68979A00E0274E /* LargestTriangleArea.swift in Sources */,
+				1F21EF2C2F6A556900E0274E /* MaxDistanceColors.swift in Sources */,
 				6ABBA2862A6C701C00660250 /* HashMap.swift in Sources */,
 				6AD56D762C4196F100E06EE0 /* MaximumGain.swift in Sources */,
 				6A67AE4E2868E0B000DCD992 /* RiverSizes.swift in Sources */,
@@ -3138,7 +3150,7 @@
 				6ABE6FCD26FD071600C6E524 /* SingleNumber.swift in Sources */,
 				6A5022FC2856F5E900688107 /* LRUCache.swift in Sources */,
 				6AF578AD26A2E7F0007B37CA /* NthFibonacci.swift in Sources */,
-				1F21EF232F689A3D00E0274E /* CountPairs.swift in Sources */,
+				1F21EF232F689A3D00E0274E /* CountPairsII.swift in Sources */,
 				6AE51D3926B3C20500102A7C /* MergeOverlappingIntervals.swift in Sources */,
 				1F85E4312F500D2A0097933E /* RecusriveInsertionSort.swift in Sources */,
 				6AF5789826A2E728007B37CA /* BranchSums.swift in Sources */,

Algorithm Solutions In Swift/main.swift

@@ -11,3 +11,4 @@ import Foundation
 
 
 //*************** START PRACTICE *************************
+

LeetCode/Count Pairs/CountPairs.swift LeetCode/Count Pairs/CountPairsII.swiftLeetCode/Count Pairs/CountPairs.swift renamed to LeetCode/Count Pairs/CountPairsII.swift

@@ -0,0 +1,26 @@
+//
+//  MaxDistanceColors.swift
+//  Algorithm Solutions In Swift
+//
+//  Created by littlebanana on 18/03/26.
+//
+
+func maxDistance(_ colors: [Int]) -> Int {
+    var l = 0, r = colors.count - 1
+    while colors[l] == colors[r] {
+        r -= 1
+    }
+    let leftDistance = r - l
+    l = 0
+    r = colors.count - 1
+    while colors[l] == colors[r] {
+        l += 1
+    }
+    let rightDistance = r - l
+    return max(leftDistance, rightDistance)
+}
+
+
+//print(maxDistance([4,4,4,11,4,4,11,4,4,4,4,4]
+//
+//))