Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Longest Stable Window

Longest Stable Window

Difficulty: 1800 5000 ms 128 MB

sliding-window deque

Find the longest contiguous subarray in which the difference between the maximum and minimum element is at most K.

Input: the first line has N and K; the second line has N integers.

Output: the length of the longest such subarray.

Constraints:

  • 1 ≤ N ≤ 105
  • 0 ≤ K ≤ 109
  • |ai| ≤ 109

Sample Tests

Input 1
5 2
1 3 2 4 5
Output 1
3
Input 2
3 0
5 5 5
Output 2
3

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen