arrow_back Back to Challenges

#239 Sliding Window Maximum

Hard Acceptance 0%
description

Problem Description

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.

checklist Constraints

See problem description for detailed constraints.

science Examples

Case #1

In: # See problem description for input format
Out: # Expected output

Mastery Tags

Arrays Heap Queue Sliding Window

Hiring Companies

Apple Uber
code

Integrated IDE

code_blocks
Coding
psychology
Aptitude