4080. Smallest Missing Multiple of K
My accepted Python solution to LeetCode problem 4080, Smallest Missing Multiple of K, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.2MB
- 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 0ms, memory 17.2MB, accepted 2025-12-31.
class Solution:
def missingMultiple(self, nums: List[int], k: int) -> int:
num_set = set(nums)
multiple = k
while multiple in num_set:
multiple += k
return multiple