Jane Street SWE Interview Question 2024 March | Monotonic Deque | on-campus

Question 1: Sliding Window Maximum Problem Statement You are given an integer array nums and an integer k. 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 value in each window position. Constraints 1 <= nums.length <= 105 -104 <= nums[i] <= 104 1 ...