Day 52 - arraySubsetOfAnotherArray.cpp

// Check whether A2 is a subset of A1 or not
// Day 52/100

#include <bits/stdc++.h>
using namespace std;

string isSubset(int a1[], int a2[], int n, int m);

int main()
{
    int t;
    cin >> t;

    while (t--)
    {
        int n, m;
        cin >> n >> m;
        int a1[n], a2[m];

        for (int i = 0; i < n; i++)
        {
            cin >> a1[i];
        }
        for (int i = 0; i < m; i++)
        {
            cin >> a2[i];
        }

        cout << isSubset(a1, a2, n, m) << endl;
    }
    return 0;
}

string isSubset(int a1[], int a2[], int n, int m)
{

    unordered_map<int, int> mp;
    for (int i = 0; i < n; i++)
    {
        mp[a1[i]] += 1;
    }
    int flag = 0;
    for (int i = 0; i < m; i++)
    {
        if (mp[a2[i]] > 0)
        {
            mp[a2[i]] -= 1;
        }
        else
        {
            flag = -1;
            break;
        }
    }

    if (flag == -1)
    {
        return "No";
    }
    else
    {
        return "Yes";
    }
}