Sliding Window Maximum at Citadel
Hard48.4% acceptance
This problem has 100.0% frequency at Citadel.
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_.
Read full problem and hintsTopics
Also asked at 47 companies
More Citadel Questions
Best Time to Buy and Sell StockEasyFind Median from Data StreamHardMaximum Total Damage With Spell CastingMediumBest Position for a Service CentreHardFirst Completely Painted Row or ColumnMedium
View all Citadel questions