leetcode1218

class Solution:
    def longestSubsequence(self, arr: List[int], difference: int) -> int:
        dp = collections.defaultdict(int)
        result = 0
        for val in arr:
            dp[val] = dp[val-difference] + 1
            if dp[val] > result:
                result = dp[val]
        return result