Sliding Window Maximum

[saakshii12]

Write code in the preferred language and attach output with it.

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.

Return the max sliding window.

Example 1:

Input: nums = [1,3,-1,-3,5,3,6,7], k = 3 Output: [3,3,5,5,6,7] Explanation: Window position Max

[1 3 -1] -3 5 3 6 7 3 1 [3 -1 -3] 5 3 6 7 3 1 3 [-1 -3 5] 3 6 7 5 1 3 -1 [-3 5 3] 6 7 5 1 3 -1 -3 [5 3 6] 7 6 1 3 -1 -3 5 [3 6 7] 7

Example 2:

Input: nums = [1], k = 1 Output: [1]

[Swetathakare]

Hey @saakshii12 , I wish to work on this issue .Could you please assign it to me ? Name : Sweta Thakare Department : Computer (2nd year) Roll no :UCE2022654

[vrishitagharte]

Vrishita Gharte UEC2021128 vrishitagharte1@gmail.com TY ENTC can i please work on this issue?

[Lavanyawaghulde]

@saakshii12 Could you assign this issue to me ? Name : Lavanya Waghulde Roll no :UCE2022362 e.mail : lavanya.waghulde@cumminscollege.in