239. Sliding Window Maximum

[Samridhi-98]

239. Sliding Window Maximum

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.

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

[Samridhi-98]

@piyushsharma220699 I want to solve this in C++, Kindly assign this issue to me as a part of hacktoberfest-2021

[piyushsharma220699]

@Samridhi-98 Assigned in C++

[anupamdey2001]

@piyushsharma220699 I want to solve this in Java please assign me this issue

[piyushsharma220699]

@anupamdey2001 I'll assign this to you in Java, but now this repo has been excluded from Hacktoberfest 2021, please read the pinned issue of this repo to know more :')

[snehashukkla]

@piyushsharma220699 please assign this to me in C++