2025-08-21 11:32:12 +0300 MSK

Longest Arithmetic Subsequence of Given Difference
Tags:

Code

class Solution:
    def longestSubsequence(self, arr: List[int], difference: int) -> int:
        dp = {}
        for num in arr:
            prv = num - difference 
            if prv in dp:
                dp[num] = dp[prv] + 1
            else:
                dp[num] = 1
        return max(dp.values())