diff --git "a/leetcode3/\354\235\264\354\247\204\355\235\254/3719. Longest Balanced Subarray I.java" "b/leetcode3/\354\235\264\354\247\204\355\235\254/3719. Longest Balanced Subarray I.java"
new file mode 100644
index 00000000..b34e6484
--- /dev/null
+++ "b/leetcode3/\354\235\264\354\247\204\355\235\254/3719. Longest Balanced Subarray I.java"	
@@ -0,0 +1,27 @@
+class Solution {
+    public int longestBalanced(int[] nums) {
+        int maxLen = 0;
+        int n = nums.length;
+
+        for (int i = 0; i < n; i++) {
+            Set<Integer> evenSet = new HashSet<>();
+            Set<Integer> oddSet = new HashSet<>();
+
+            for (int j = i; j < n; j++) {
+                int current = nums[j];
+
+                if (current % 2 == 0) {
+                    evenSet.add(current);
+                } else {
+                    oddSet.add(current);
+                }
+
+                if (evenSet.size() == oddSet.size()) {
+                    maxLen = Math.max(maxLen, j - i + 1);
+                }
+            }
+        }
+
+        return maxLen;
+    }
+}
\ No newline at end of file