Leetcode 1218. Longest Arithmetic Subsequence of Given Difference

Find the length of the longest subsequence (preserving order) in which consecutive elements differ by a given fixed value. With arr up to 1e5, the core challenge is to compute this efficiently by aggregating the longest arithmetic chain ending at each value (dynamic programming over values).