**Longest Arithmetic Subsequence with Difference Constraint - Google Top Interview Questions**

### Problem Statement :

Given a list of integers nums and an integer diff, return the length of the longest arithmetic subsequence where the difference between each consecutive numbers in the subsequence is diff. Constraints 0 ≤ n ≤ 100,000 where n is the length of nums Example 1 Input nums = [-2, 0, 3, 6, 1, 9] diff = 3 Output 4 Explanation We can pick the subsequence [0, 3, 6, 9]. Example 2 Input nums = [9, 8, 7, 5, 3] diff = -2 Output 4 Explanation We can pick the subsequence [9, 7, 5, 3].

### Solution :

` ````
Solution in C++ :
int solve(vector<int>& nums, int diff) {
int res = 0;
unordered_map<int, int> hash;
for (const auto& num : nums) res = max(res, hash[num] = hash[num - diff] + 1);
return res;
}
```

` ````
Solution in Java :
import java.util.*;
class Solution {
public int solve(int[] nums, int diff) {
int n = nums.length;
if (n == 0)
return 0;
// Maximum length is atleast 1
int maxLen = 1;
// Init map of processed values
Map<Integer, Integer> numsMap = new HashMap<>();
for (int i = 0; i < n; i++) {
int comp = nums[i] - diff;
if (numsMap.containsKey(comp))
numsMap.put(nums[i], numsMap.get(comp) + 1);
else
numsMap.put(nums[i], 1);
maxLen = Math.max(numsMap.get(nums[i]), maxLen);
}
return maxLen;
}
}
```

` ````
Solution in Python :
class Solution:
def solve(self, nums, diff):
seen = defaultdict(int)
mx = 0
for x in nums:
if x - diff in seen:
seen[x] = seen[x - diff] + 1
else:
seen[x] = 1
mx = max(mx, seen[x])
return mx
```

## View More Similar Problems

## Insert a Node at the head of a Linked List

Given a pointer to the head of a linked list, insert a new node before the head. The next value in the new node should point to head and the data value should be replaced with a given value. Return a reference to the new head of the list. The head pointer given may be null meaning that the initial list is empty. Function Description: Complete the function insertNodeAtHead in the editor below

View Solution →## Insert a node at a specific position in a linked list

Given the pointer to the head node of a linked list and an integer to insert at a certain position, create a new node with the given integer as its data attribute, insert this node at the desired position and return the head node. A position of 0 indicates head, a position of 1 indicates one node away from the head and so on. The head pointer given may be null meaning that the initial list is e

View Solution →## Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

View Solution →## Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

View Solution →## Reverse a linked list

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio

View Solution →## Compare two linked lists

You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis

View Solution →