cpp-codes/Array_MaxSubarrayDiffremtInteger_k.cpp at master · abhinavkumaryadav1/cpp-codes · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<iostream>
#include<vector>
#include <bits/stdc++.h>

using namespace std;

int maxSubArray(vector<int> &arr,int k)
{
    int l=0;
    int r=0;
    int cnt=0;
    int n=arr.size();
    map <int,int> hash_arr;
    while (r<n)
    {
        hash_arr[arr[r]]++;

        while (hash_arr.size()>k)
        {
            hash_arr[arr[l]]--;
            if (hash_arr[arr[l]]==0)
            {
                hash_arr.erase(arr[l]);
            }

            l++;
        }

        cnt=cnt+(r-l+1);
        r++;
    }
    int klessthanone(vector<int> &arr, int k);
    int klessone= klessthanone(arr,k-1);
    return (cnt-klessone);
}

int klessthanone(vector<int> &arr,int k)
{
   int l=0;
    int r=0;
    int cnt=0;
    int n=arr.size();
    map <int,int> hash_arr;
    while (r<n)
    {
       hash_arr[arr[r]]++;

        while (hash_arr.size()>k)
        {
            hash_arr[arr[l]]--;
            if (hash_arr[arr[l]]==0)
            {
                hash_arr.erase(arr[l]);
            }

            l++;
        }

        cnt=cnt+(r-l+1);
        r++;
    }
    return cnt;
}

int main()
 {

    vector<int> arr={1,2,1,2,3};
    int k=2;

    cout<<"result:- "<<maxSubArray(arr,k);

return 0;
}