Question

Atlassian | OA | SDE1 | Coding Questions and Solutions | 2022 | Set-6

Answer 1

int findIndicator1(vector<pair<int, pair<int, int>>> &arr)
{
    int n = arr.size();
    int ans = 0;
    for (int i = 0; i < n; ++i)
    {
        ans += (arr[i].second.second == arr[i].first);
    }
    return ans;
}

int findIndicator2(vector<pair<int, pair<int, int>>> &arr)
{
    int n = arr.size();
    int ans = 0;
    for (int i = 0; i < n; ++i)
    {
        ans += (arr[i].second.second == arr[i].first and arr[i].first == arr[i].second.first);
    }
    return ans;
}

auto solve = []()
{
    int n;
    cin >> n;
    vector<pair<int, pair<int, int>>> arr;
    for (int i = 0; i < n; ++i)
    {
        int x;
        cin >> x;
        if (arr.size() and arr.back().first == x)
        {
            ++arr[arr.size() - 1].second.second;
        }
        else
        {
            arr.push_back({x, {i + 1, 1}});
        }
    }
    cout << abs(findIndicator1(arr) - findIndicator2(arr)) << endl;
};

Answer 2

images of ques