Sliding Window Problem about hactoberfest2022 HOT 3 OPEN

I would like to work on this please assign this issue to me.

from hactoberfest2022.

I would like to contribute with my code to the problem Maximum of all subarrays of size k using sliding window.
Please assign me this issue under the tag of hactoberfest 2022.
I ahve added my code below.
Thank you.

from hactoberfest2022.

vector max_of_subarrays(int *arr, int n, int k)
{
deque dq;
vector v;
int i=0;int j=0;
while(j<n){
while(dq.size()>0 && dq.back()<arr[j])
{
dq.pop_back();
}
dq.push_back(arr[j]);
if(j-i+1<k) j++;
else if(j-i+1==k)
{
v.push_back(dq.front());
if(dq.front()==arr[i])
dq.pop_front();
i++;j++;
}
}
return v;

from hactoberfest2022.