Available question text
Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Related questions
Continue with questions that share topics or the same question type.
- You are given an array of length n and variable k(size of window), return the index of the window with the max diff (max-min).
Coding
- Given an array of integers and a target value, return the indices of two numbers that add up to the target
Coding
- Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the k closest points to the origin (0, 0). Discuss expected vs. worst-case time complexity.
Coding
- Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Glassdoor · 1 record
NVIDIA
Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Reported date not specified · 1 source report
Software Engineer
Source snapshot: Nov 12, 2026
View source