Longest Arithmetic Subsequence of Given Difference
Given an integer array arr and an integer difference, return the length of the longest subsequence in arr which is an arithmetic sequence such that the difference between adjacent elements in the subsequence equals difference.
A subsequence is a sequence that can be derived from arr by deleting some or no elements without changing the order of the remaining elements.
Example 1
Input
arr = [1,2,3,4], difference = 1Output
4The longest arithmetic subsequence is [1, 2, 3, 4].
Example 2
Input
arr = [1,3,5,7], difference = 1Output
1The longest arithmetic subsequence is any single element.
Constraints
- 1 <= arr.length <= 10^5
- -10^4 <= arr[i], difference <= 10^4
Asked at 2 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.