# Minimize Amplitude After Deleting K-Length Sublist ๐

You are given a list of integers `nums`

and an integer `k`

. Given that you must first remove a sublist of length `k`

, return the minimum resulting `max(nums) - min(nums)`

.

**Constraints**

`0 โค k < n โค 100,000`

where`n`

is the length of`nums`

https://binarysearch.com/problems/Minimize-Amplitude-After-Deleting-K-Length-Sublist

## Examples

### Example 1

**Input**

- nums =
`[1, 2, 9, 8, 7, 3]`

- k =
`3`

**Output**

- answer =
`2`

**Explanation**

We can remove `[9, 8, 7]`

to get `[1, 2, 3]`

and `3 - 1 = 2`

### Example 2

**Input**

- nums =
`[5, 1, 2]`

- k =
`0`

**Output**

- answer =
`4`

**Explanation**

We canโt remove a sublist since `k = 0`

, so we just return the current amplitude which is `5 - 1`

.

### Example 3

**Input**

- nums =
`[2, 1, 4, 7, 8]`

- k =
`2`

**Output**

- answer =
`3`

**Explanation**

We can remove `[7, 8]`

to get `[2, 1, 4]`

and `4 - 1 = 3`

## Leave a comment