Commit 3ad4c45

committed

Sliding Window Maximum

1 parent 3d5464d commit 3ad4c45Copy full SHA for 3ad4c45

File tree

-1

lines changed

-1

lines changed

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,8 @@`
`1`	`1`	`// Ques 4 : Sliding Window Maximum`
`2`	`2`	`// You are given an array of integers nums, there is a sliding window of size k which is`
`3`	`3`	`// moving from the very left of the array to the very right.You can only see the k numbers`
`4`		`-// in the window. Each time the sliding window moves right by one position.`
	`4`	`+// in the window. Each time the sliding window moves right by one position. For each window,`
	`5`	`+// take the maximum element and add them to a final result array.`
`5`	`6`
`6`	`7`	`// Input: nums = [1, 3, -1, -3, 5, 3, 6, 7], k = 3`
`7`	`8`	`// Output: [3, 3, 5, 5, 6, 7]`

Comments

(0)