Queue

Question 1

First negative integer in every window of size k ,

time: O(n) , Space : O(k) using deque

Answer 1

define ll long long

#include 
using namespace std;

int main() {
	ll t;
	cin>>t;
	while(t--)
	{
	    ll n,k,i,j;
	    cin>>n;
	    ll a[n];
	    deque d;
	    for(i=0;i>a[i];
	    }
	    cin>>k;
	    for(i=0;i

Question 2

Maximum of all subarrays of size k,
time : O(n)
space : O(k)

Answer 2

define ll long long

#include 
using namespace std;

ll findmax(ll a[],ll n,ll j)
{
    ll maxm = INT_MIN;
    for(ll i=j;i>t;
	while(t--)
	{
	    ll n,k,i;
	    cin>>n>>k;
	    ll a[n];
	    for(i=0;i>a[i];
	    }
	    queue q;
	    ll maxm = INT_MIN;
	    for(i=0;i