Skip to content
LC-2453 Medium LeetCode

2453. Destroy Sequential Targets

Read the full problem statement on LeetCode.
Difficulty: medium Acceptance: 41% Topics: Array, Hash Table, Counting
View full problem on LeetCode

Reading material

Reference solution (spoiler · python)
# Time:  O(n)
# Space: O(s), s is the value of space

import collections


# freq table
class Solution(object):
    def destroyTargets(self, nums, space):
        """
        :type nums: List[int]
        :type space: int
        :rtype: int
        """
        cnt = collections.Counter(x%space for x in nums)
        mx = max(cnt.itervalues())
        return min(x for x in nums if cnt[x%space] == mx)

Solution from kamyu104/LeetCode-Solutions · MIT