From 3ebdf3d3b94214bb7bfd12f9c8b52b06bc961dce Mon Sep 17 00:00:00 2001
From: Simon Oberzier <simon@Simons-MacBook-Pro.fritz.box>
Date: Thu, 8 Jan 2026 22:45:44 +0100
Subject: [PATCH] Problem 3 and 4

---
 .../solution.py                                  | 16 ++++++++++++++++
 0004-median-of-two-sorted-arrays/solution.py     |  5 +++++
 2 files changed, 21 insertions(+)
 create mode 100644 0003-longest-substring-without-repeating-characters/solution.py
 create mode 100644 0004-median-of-two-sorted-arrays/solution.py

diff --git a/0003-longest-substring-without-repeating-characters/solution.py b/0003-longest-substring-without-repeating-characters/solution.py
new file mode 100644
index 0000000..ca761a2
--- /dev/null
+++ b/0003-longest-substring-without-repeating-characters/solution.py
@@ -0,0 +1,16 @@
+class Solution:
+    def lengthOfLongestSubstring(self, s: str) -> int:
+        count = 0
+        current = []
+        solutions = {}
+        for c in s:
+            if c in current:
+                solutions[count] = current
+                idx = current.index(c)
+                current = current[idx + 1:]
+                count -= idx + 1
+            current.append(c)
+            count += 1
+        solutions[count] = current
+        return max(solutions.keys())
+        
\ No newline at end of file
diff --git a/0004-median-of-two-sorted-arrays/solution.py b/0004-median-of-two-sorted-arrays/solution.py
new file mode 100644
index 0000000..05aa0f7
--- /dev/null
+++ b/0004-median-of-two-sorted-arrays/solution.py
@@ -0,0 +1,5 @@
+class Solution:
+    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
+        nums1 = sorted(nums1 + nums2)
+        length = len(nums1)
+        return nums1[length//2] if length % 2 == 1 else float(sum(nums1[length//2-1:length//2+1]))/2
\ No newline at end of file