4107. Find Missing Elements
My accepted Python solution to LeetCode problem 4107, Find Missing Elements, running in 3ms.
- Difficulty: Easy
- Python
- Runtime 3ms
- Memory 17.4MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 3ms, memory 17.4MB, accepted 2025-12-30.
class Solution:
def findMissingElements(self, nums: List[int]) -> List[int]:
num_set = set(nums)
min_val = min(nums)
max_val = max(nums)
return [i for i in range(min_val, max_val + 1) if i not in num_set]