Find the Prefix Common Array of Two Arrays

You are given two 0-indexed integer permutations A and B of length n.

A prefix common array of A and B is an array C such that C[i] is equal to the count of numbers that are present at or before the index i in both A and B.

Return the prefix common array of A and B.

A sequence of n integers is called a permutation if it contains all integers from 1 to n exactly once.

LeetCode Problem - 2657

class Solution {
    // Method to find the prefix common array between two arrays
    public int[] findThePrefixCommonArray(int[] A, int[] B) {
        // Initialize a result array to store the counts of common elements
        int[] result = new int[A.length];

        // Loop through elements of array A
        int i = 0;
        while (i < A.length) {
            // Initialize a counter to track the number of common elements
            int count = 0;

            // Nested loop to compare each element of A with elements of B
            for (int j = 0; j <= i; j++) {
                for (int k = 0; k <= i; k++) {
                    // If there is a match, increment the count and break out of the loop
                    if (A[j] == B[k]) {
                        count++;
                        break;
                    }
                }
            }

            // Store the count of common elements at the current index in the result array
            result[i] = count;
            // Move to the next index of the result array
            i++;
        }

        // Return the result array containing counts of common elements
        return result;
    }
}