From addfbed48dae5aaeaa272ca378d482dbd03ebcd5 Mon Sep 17 00:00:00 2001
From: Won Joon Thomas Choi <113500771+724thomas@users.noreply.github.com>
Date: Sat, 31 Oct 2026 23:42:00 +0900
Subject: [PATCH] Create 3719. Longest Balanced Subarray I.py

---
 .../3719. Longest Balanced Subarray I.py"     | 21 +++++++++++++++++++
 1 file changed, 21 insertions(+)
 create mode 100644 "leetcode3/\354\265\234\354\233\220\354\244\200/3719. Longest Balanced Subarray I.py"

diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/3719. Longest Balanced Subarray I.py" "b/leetcode3/\354\265\234\354\233\220\354\244\200/3719. Longest Balanced Subarray I.py"
new file mode 100644
index 00000000..a6ef80d7
--- /dev/null
+++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/3719. Longest Balanced Subarray I.py"	
@@ -0,0 +1,21 @@
+class Solution:
+    def longestBalanced(self, nums: list[int]) -> int:
+        n = len(nums)
+        ans = 0
+
+        for i in range(n):
+            even = set()
+            odd = set()
+
+            for j in range(i, n):
+                num = nums[j]
+
+                if num % 2 == 0:
+                    even.add(num)
+                else:
+                    odd.add(num)
+
+                if len(even) == len(odd):
+                    ans = max(ans, j - i + 1)
+
+        return ans