Simple C Solution || 100% beats 😤
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```c []
/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* findIntersectionValues(int* nums1, int size1, int* nums2, int size2, int* returnSize) {
    int arr1[101] = {0};
    int arr2[101] = {0};

    for(int i=0;i<size1;i++) arr1[nums1[i]]++;
    for(int i=0;i<size2;i++) arr2[nums2[i]]++;

    int ans1 =0,ans2=0;

    for(int i=0;i<size1;i++)
    {
        if(arr2[nums1[i]]>0) ans1++;              
    }

    for(int i=0;i<size2;i++)
    {
        if(arr1[nums2[i]]>0) ans2++;              
    }

    int *res = malloc(8);
    res[0] = ans1;
    res[1] = ans2;

    *returnSize = 2;

    return res;
}
```
['C']