From 22e4fd6ec947682fb239b73f01be275b99f7dd02 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Jobert=20S=C3=A1?= <bearinmind@jobear.dev>
Date: Wed, 17 Jul 2024 18:07:14 +0200
Subject: [PATCH] =?UTF-8?q?=E2=9C=A8=20Problem=20003=20Optimized=20Solutio?=
 =?UTF-8?q?n?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...eCharsOptimizedSlidingWindowSolution.swift | 35 +++++++++++++++++++
 ...sOptimizedSlidingWindowSolutionTests.swift | 28 +++++++++++++++
 2 files changed, 63 insertions(+)
 create mode 100644 Sources/Solutions/003 - Longest Substring Without Repeating Characters/LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolution.swift
 create mode 100644 Tests/SolutionsTests/003 - Longest Substring Without Repeating Characters/LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolutionTests.swift

diff --git a/Sources/Solutions/003 - Longest Substring Without Repeating Characters/LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolution.swift b/Sources/Solutions/003 - Longest Substring Without Repeating Characters/LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolution.swift
new file mode 100644
index 0000000..2d0d469
--- /dev/null
+++ b/Sources/Solutions/003 - Longest Substring Without Repeating Characters/LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolution.swift	
@@ -0,0 +1,35 @@
+//
+//  LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolution.swift
+//  LeetSwift
+//
+//  Created by Jobert on 10/07/2024.
+//
+
+import Core
+import Foundation
+import Problems
+
+final class LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolution: LongestSubstringWithUniqueCharsDefinition {
+
+    func lengthOfLongestSubstring(_ s: String) -> Int {
+        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)
+        }
+
+        return maxLength
+    }
+}
diff --git a/Tests/SolutionsTests/003 - Longest Substring Without Repeating Characters/LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolutionTests.swift b/Tests/SolutionsTests/003 - Longest Substring Without Repeating Characters/LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolutionTests.swift
new file mode 100644
index 0000000..3429cbb
--- /dev/null
+++ b/Tests/SolutionsTests/003 - Longest Substring Without Repeating Characters/LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolutionTests.swift	
@@ -0,0 +1,28 @@
+//
+//  LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolutionTests.swift
+//  LeetSwift
+//
+//  Created by Jobert Sá on 17/07/2024.
+//
+
+import XCTest
+@testable import Problems
+@testable import Solutions
+@testable import TestSupport
+
+final class LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolutionTests: XCTestCase {
+
+    let solution: LongestSubstringWithUniqueCharsDefinition = LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolution()
+
+    func testSolution() {
+        for testData in data {
+            let input = testData.input
+
+            let output = solution.lengthOfLongestSubstring(input)
+
+            XCTAssertEqual(output, testData.expectedOutput)
+        }
+    }
+}
+
+extension LongestSubstringWithUniqueCharsOptimizedSlidingWindowSolutionTests: LongestSubstringWithUniqueCharsTestCaseProvider { }