Destroy Sequential Targets — LeetCode 2453 Python Solution

The problem

You are given a 0-indexed array nums consisting of positive integers, representing targets on a number line. You are also given an integer space.

Example

Input

nums = [3,7,8,1,1,5], space = 2

Output

1

Explanation

If we seed the machine with nums[3], then we destroy all targets equal to 1,3,5,7,9,...

Python solution

class Solution:
    def destroyTargets(self, nums: List[int], space: int) -> int:
        cnt = Counter(v % space for v in nums)
        ans = mx = 0
        for v in nums:
            t = cnt[v % space]
            if t > mx or (t == mx and v < ans):
                ans = v
                mx = t
        return ans

Complexity

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 2453. Destroy Sequential Targets is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Hash Table and Counting.

The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.

Related problems