Skip to content

problem18.md

Latest commit

 

History

History
12 lines (9 loc) · 499 Bytes

problem18.md

File metadata and controls

12 lines (9 loc) · 499 Bytes

Problem 18: Crest Tracking

Problem Statement

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 Format

  • An array of integers nums.
  • An integer k.

Example

Input: nums = [1, 3, -1, -3, 5, 3, 6, 7], k = 3
Output: [3, 3, 5, 5, 6, 7]