Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1218. Longest Arithmetic Subsequence of Given Difference
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source