- Related Questions & Answers
- Program to find string after deleting k consecutive duplicate characters in python
- Program to find maximum additive score by deleting numbers in Python
- Find all possible substrings after deleting k characters in Python
- Program to find minimum possible maximum value after k operations in python
- Program to find number of sublists containing maximum and minimum after deleting only one element in Python
- Program to find maximum adjacent absolute value sum after single reversal in C++
- Maximum possible middle element of the array after deleting exactly k elements in C++
- Program to find maximum sum by removing K numbers from ends in python
- Python program to find the maximum of three numbers
- Program to find minimum possible difference of indices of adjacent elements in Python
- Program to find maximum sum of non-adjacent nodes of a tree in Python
- Program to find maximum profit we can make after k Buy and Sell in python
- Program to find shortest string after removing different adjacent bits in Python
- Program to find state of prison cells after k days in python
- Program to find max values of sublists of size k in Python

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Suppose we have a list of numbers called nums and they are sorted in ascending order, we have to delete k values from the list such that the maximum difference between any two adjacent values is as minimum as possible, and finally find the difference.

So, if the input is like nums = [15, 20, 30, 400, 1500] k = 2, then the output will be 10, as if we remove [400, 1500] to get the difference of 20 and 30.

To solve this, we will follow these steps −

- abs_diff := a list of differences of every consecutive elements in nums
- Define a function dp() . This will take i, j, cnt
- if cnt is same as 0, then
- m := 0
- for k in range i to j, do
- m := maximum of m and abs_diff[k]

- return m

- return minimum of dp(i + 1, j, cnt - 1) and dp(i, j - 1, cnt - 1)
- From the main method do the following:
- return dp(0, size of abs_diff - 1, k)

Let us see the following implementation to get better understanding −

class Solution: def solve(self, nums, k): abs_diff = [nums[i] - nums[i - 1] for i in range(1, len(nums))] def dp(i, j, cnt): if cnt == 0: m = 0 for k in range(i, j + 1): m = max(m, abs_diff[k]) return m return min(dp(i + 1, j, cnt - 1), dp(i, j - 1, cnt - 1)) return dp(0, len(abs_diff) - 1, k) ob = Solution() nums = [15, 20, 30, 400, 1500] k = 2 print(ob.solve(nums, k))

[15, 20, 30, 400, 1500], 2

10

Advertisements