👨‍🔧 SwiftLint fixes

Sources/Solutions/003 - Longest Substring Without Repeating Characters/LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolution.swift

@@ -15,17 +15,17 @@ final class LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolution: Longe
         var indexArray = Array(repeating: -1, count: 128)
         var maxLength = 0
         var start = 0
-        
+
         let chars = Array(s)
 
         for i in 0..<chars.count {
             guard let asciiValue = chars[i].asciiValue else { continue }
             let asciiIndex = Int(asciiValue)
-            
+
             if indexArray[asciiIndex] != -1 {
                 start = max(start, indexArray[asciiIndex] + 1)
             }
-            
+
             indexArray[asciiIndex] = i
             maxLength = max(maxLength, i - start + 1)
         }

Sources/Solutions/004 - Median of Two Sorted Arrays/MedianOfTwoSortedArraysBinarySearchSolution.swift

@@ -16,20 +16,20 @@ final class MedianOfTwoSortedArraysBinarySearchSolution: MedianOfTwoSortedArrays
         let b = nums1.count < nums2.count ? nums2 : nums1
         let m = a.count
         let n = b.count
-        
+
         var low = 0
         var high = m
-        
+
         while low <= high {
             let i = (low + high) / 2
             let j = (m + n + 1) / 2 - i
-            
+
             let maxLeftA = (i == 0) ? Int.min : a[i - 1]
             let minRightA = (i == m) ? Int.max : a[i]
-            
+
             let maxLeftB = (j == 0) ? Int.min : b[j - 1]
             let minRightB = (j == n) ? Int.max : b[j]
-            
+
             if maxLeftA <= minRightB && maxLeftB <= minRightA {
                 if (m + n) % 2 == 0 {
                     return Double(max(maxLeftA, maxLeftB) + min(minRightA, minRightB)) / 2.0
@@ -42,7 +42,7 @@ final class MedianOfTwoSortedArraysBinarySearchSolution: MedianOfTwoSortedArrays
                 low = i + 1
             }
         }
-        
+
         return 0.0
     }
 }

Sources/Solutions/004 - Median of Two Sorted Arrays/MedianOfTwoSortedArraysMergeSolution.swift

@@ -13,9 +13,9 @@ final class MedianOfTwoSortedArraysMergeSolution: MedianOfTwoSortedArraysDefinit
 
     func findMedianSortedArrays(_ nums1: [Int], _ nums2: [Int]) -> Double {
         let mergedArray = (nums1 + nums2).sorted()
-        
+
         let mid = mergedArray.count / 2
-        
+
         if mergedArray.count % 2 == 1 {
             return Double(mergedArray[mid])
         }