sir ishme bhi toh o(n^2) jaa raha hai
Maximum element in every window of k size
hello @YASHMATHURIA123
nahi time complexity O(n) hi hogi.
kyunki agar tum dhyan se observe karoge to dono loop kabhi bhi 2*n se jayda operation nahi karenge.
hum har element ko dq me daal rahe hai aur phir pop kar rahe hai. har element pe bus yahi operation ho raha hai right?
to total n elemnts hai ,aur sabhi pe maximum 2 operation ho rahe hai (dq mein daalna , dq se nikalna) to worst case mein 2*n operation hi hoga
isiliye time complexity O(n) hai