From b349644272bff309b46df77c04aed1f7d0d88d00 Mon Sep 17 00:00:00 2001
From: t0xa <pro100ton@gmail.com>
Date: Sat, 7 Feb 2026 17:34:39 +0300
Subject: [PATCH] Add solution for unique elements in arrays

---
 .../unique_elements_in_two_arrays.py          | 49 +++++++++----------
 1 file changed, 24 insertions(+), 25 deletions(-)

diff --git a/algocode/two_pointers/unique_elements_in_two_arrays.py b/algocode/two_pointers/unique_elements_in_two_arrays.py
index 00201c7..7c26955 100644
--- a/algocode/two_pointers/unique_elements_in_two_arrays.py
+++ b/algocode/two_pointers/unique_elements_in_two_arrays.py
@@ -14,32 +14,31 @@
 len(nums1) + len(nums2) >= 1
 """
 
-def solve(nums1, nums2):
+def solve_1(nums1, nums2):
     res = []
-    if len(nums1) > len(nums2):
-        short = nums2
-        long = nums1
-    else:
-        short = nums1
-        long = nums2
-    s, l = 0, 0
-    while s < len(short):
-        if short[s] == long[l]:
-            l+=1
-            s+=1
-        elif short[s] < long[l]:
-            res.append(short[s])
-            s+=1
-        elif short[s] > long[l]:
-            
+    i = 0
+    j = 0
+    while i < len(nums1):
+        if j >= len(nums2):
+            res = res + nums1[i:]
+            return res
+        if nums1[i] == nums2[j]:
+            j += 1
+            i += 1
+        elif nums1[i] < nums2[j]:
+            res.append(nums1[i])
+            i += 1
+        elif nums1[i] > nums2[j]:
+            res.append(nums2[j])
+            j += 1
+    res = res + nums2[j:]
+    return res 
 
-    return res
+print(solve_1(nums1 = [1,5,7,9], nums2 = [2,3,5,6,7,8]))
+print([1,2,3,6,8,9])
 
-s
-1,5,7,9
-l
-2,3,5,6,7,8
-
-
-[1,2,3,6,8,9]
+print(solve_1(nums1 = [2,3], nums2 = [1]))
+print([1,2,3])
 
+print(solve_1(nums1 = [1], nums2 = [1,2]))
+print([1,2])