From 460511bd27cb226b22a21170ffc087aeb5e61d5b Mon Sep 17 00:00:00 2001
From: Won Joon Thomas Choi <113500771+724thomas@users.noreply.github.com>
Date: Fri, 4 Sep 2026 20:44:40 +0900
Subject: [PATCH] Create 3982. Sum of Integers with Maximum Digit Range.py

---
 ...m of Integers with Maximum Digit Range.py" | 24 +++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 "leetcode3/\354\265\234\354\233\220\354\244\200/3982. Sum of Integers with Maximum Digit Range.py"

diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/3982. Sum of Integers with Maximum Digit Range.py" "b/leetcode3/\354\265\234\354\233\220\354\244\200/3982. Sum of Integers with Maximum Digit Range.py"
new file mode 100644
index 00000000..61ea6ee7
--- /dev/null
+++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/3982. Sum of Integers with Maximum Digit Range.py"	
@@ -0,0 +1,24 @@
+class Solution:
+    def maxDigitRange(self, nums: list[int]) -> int:
+        def calc_digit_range(num):
+            largest = 0
+            smallest = float('inf')
+            while num:
+                remain = num%10
+                largest = max(largest, remain)
+                smallest = min(smallest, remain)
+                num = num // 10
+            return largest - smallest
+               
+        digit_ranges = []
+        largest = 0
+        for num in nums:
+            dr = calc_digit_range(num)
+            largest = max(largest, dr)
+            digit_ranges.append(dr)
+
+        ans = 0
+        for i in range(len(nums)):
+            if digit_ranges[i] == largest:
+                ans += nums[i]
+        return ans