Javascript Program to Maximize count of corresponding same elements in given Arrays by Rotation

<script>

// JavaScript program of the above approach

// Function that prints maximum
// equal elements
function maximumEqual(a, b, n)
{
  
    // Vector to store the index
    // of elements of array b
    let store = Array.from({length: 1e5}, (_, i) => 0);  
  
    // Storing the positions of
    // array B
    for (let i = 0; i < n; i++) 
    {
        store[b[i]] = i + 1;
    }
  
    // frequency array to keep count
    // of elements with similar
    // difference in distances
    let ans = Array.from({length: 1e5}, (_, i) => 0);  
  
    // Iterate through all element in arr1[]
    for (let i = 0; i < n; i++)
    {
  
        // Calculate number of
        // shift required to
        // make current element
        // equal
        let d = Math.abs(store[a[i]] - (i + 1));
  
        // If d is less than 0
        if (store[a[i]] < i + 1) 
        {
            d = n - d;
        }
  
        // Store the frequency
        // of current diff
        ans[d]++;
    }
  
    let finalans = 0;
  
    // Compute the maximum frequency
    // stored
    for (let i = 0; i < 1e5; i++)
        finalans = Math.max(finalans,
                            ans[i]);
  
    // Printing the maximum number
    // of equal elements
    document.write(finalans + "
");
}

// Driver Code

    // Given two arrays
    let A = [ 6, 7, 3, 9, 5 ];
    let B = [ 7, 3, 9, 5, 6 ];
  
    let size = A.length;
  
    // Function Call
    maximumEqual(A, B, size);
          
</script>