Longest arithmetic progression with the given common difference

https://www.geeksforgeeks.org/longest-arithmetic-progression-with-the-given-common-difference/

Given an unsorted array of size n and an integer d which is the common difference, the task is to find the length of the longest AP.
For all j, greater than some i(<n),

if a[j] = a[i] + (j-i) * d

i.e. a[j] is in the AP of a[i] from index i to j.

Examples:

Input: n = 6, d = 2
arr[] = {1, 2, 5, 7, 9, 85}
Output: 4
The longest AP, taking indices into consideration, is [1, 5, 7, 9]
since 5 is 2 indices ahead of 1 and would fit in the AP if started
from index 0. as 5 = 1 + (2 – 0) * 2. So the output is 4.

Input: n = 10, d = 3
arr[] = {1, 4, 2, 5, 20, 11, 56, 100, 20, 23}
Output: 5
The longest AP, taking indices into consideration, is [2, 5, 11, 20, 23]
since 11 is 2 indices ahead of 5 and 20 is 3 indices ahead of 11. So they
would fit in the AP if started from index 2.

Naive Approach: For each element calculate the length of the longest AP it could form and print the maximum among them. It involves O(n2) time complexity.

An efficient approach is to use Hashing.

Create a map where the key is the starting element of an AP and its value is the number of elements in that AP. The idea is to update the value at key ‘a'(which is at index i and whose starting element is not yet there in the map) by 1 whenever the element at index j(>i) could be in the AP of ‘a'(as the starting element). Then we print the maximum value among all values in the map.

static int maxlenAP(int a[], 

                    int n, int d)

{

    // key=starting element of an AP,

    // value=length of AP

    HashMap<Integer, Integer> m = 

                    new HashMap<Integer, Integer>();

  

    // since the length of longest 

    // AP is at least one i.e. 

    // the number itself.

    int maxt = 1;

  

    // if element a[i]'s starting

    // element(i.e., a[i]-i*d)

    // is not in map then its value

    // is 1 else there already

    // exists a starting element of

    // an AP of which a[i] can be

    // a part.

    for (int i = 0; i < n; i++) 

    {

        if(m.containsKey(a[i] - i * d))

        {

            int freq = m.get(a[i] - i * d);

            freq++;

            m.put(a[i] - i * d, freq);

        }

        else

        {

            m.put(a[i] - i * d, 1);

        }

    }

  

    // auto operator stores the key,

    // value pair type from the map.

    for(Entry<Integer, Integer> val: m.entrySet())

    {

        if (maxt < val.getValue())

            maxt = val.getValue();

    }

    return maxt;

}