Merge pull request #1834 from CodingTestStudy2/김민제

[김민제] Day16

Author: github-actions[bot]

leetcode3/김민제/3471. Find the Largest Almost Missing Integer.py

@@ -0,0 +1,19 @@
+
+class Solution:
+    def largestInteger(self, nums: List[int], k: int) -> int:
+        count = {}
+
+        for i in range(len(nums) - k + 1):
+            sub = set(nums[i:i+k])
+
+            for num in sub:
+                count[num] = count.get(num, 0) + 1
+
+        answer = -1
+
+        for num in count:
+            if count[num] == 1:
+                answer = max(answer, num)
+
+        return answer
+