✨ Brute force solution for problem 003

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

@@ -0,0 +1,31 @@
+//
+//  LongestSubstringWithoutRepeatingCharactersBruteForceSolution.swift
+//  LeetSwift
+//
+//  Created by Jobert on 10/07/2024.
+//
+
+import Core
+import Foundation
+import Problems
+
+final class LongestSubstringWithoutRepeatingCharactersBruteForceSolution: LongestSubstringWithoutRepeatingCharactersDefinition {
+
+    func lengthOfLongestSubstring(_ s: String) -> Int {
+        let chars = Array(s)
+        var maxLength = 0
+
+        for i in 0..<chars.count {
+            var seen = Set<Character>()
+            for j in i..<chars.count {
+                if seen.contains(chars[j]) {
+                    break
+                }
+                seen.insert(chars[j])
+                maxLength = max(maxLength, j - i + 1)
+            }
+        }
+
+        return maxLength
+    }
+}

Tests/SolutionsTests/003 - Longest Substring Without Repeating Characters/LongestSubstringWithoutRepeatingCharactersSolutionTests.swift

@@ -12,7 +12,7 @@ import XCTest
 
 final class LongestSubstringWithoutRepeatingCharactersSolutionTests: XCTestCase {
 
-    let solution: LongestSubstringWithoutRepeatingCharactersDefinition = LongestSubstringWithoutRepeatingCharactersSolution()
+    let solution: LongestSubstringWithoutRepeatingCharactersDefinition = LongestSubstringWithoutRepeatingCharactersBruteForceSolution()
 
     func testSolution() {
         for testData in data {