LeetCode #3595: Once Twice
β’ 25 words β’ 1 min
LeetCode #3595: Once Twice:
Counter:
from collections import Counter
class Solution:
def onceTwice(self, nums: List[int]) -> List[int]:
return [num for (num, _) in Counter(nums).most_common()[::-1][:2]]
Related Posts
LeetCode #747: Largest Number At Least Twice of Others:
python class Solution: def dominantIndex(self, nums: List[int]) -> int: g = max(nums) for β¦
Jan 06, 2026
LeetCode #355: Design Twitter:
My original solution:
python from collections import defaultdict from itertools import chain class Twitter: def β¦
Apr 06, 2026
Previously, previously, previously, previously.
Thiago Perrotta