LeetCode #645: Set Mismatch
β’ 36 words β’ 1 min
LeetCode #645: Set Mismatch:
class Solution:
def findErrorNums(self, nums: List[int]) -> List[int]:
n = len(nums)
s = set(nums)
t = set(range(1, n + 1))
missing = (t - s).pop()
duplicate = Counter(nums).most_common(1)[0][0]
return [duplicate, missing]
Related Posts
LeetCode #355: Design Twitter:
My original solution:
python from collections import defaultdict from itertools import chain class Twitter: def β¦
Apr 06, 2026
LeetCode #3822: Design Order Management System:
python from dataclasses import dataclass @dataclass class Entry(): orderType: OrderType price: int β¦
Mar 01, 2026
Previously, previously, previously, previously, previously.
