DropBox SDE Interview Question 2022 March | Priority Queues & Deques | On-campus

Question 1: Sliding Window Maximum 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 maximum element of each sliding window. Constraints 1 <= nums.length <= 105 -104 <= nums[i] <= 104 1 <= k <= ...