
Asked in Urban Company
Minimize Maximum Difference Between Adjacent Elements
You are provided with a non-decreasing array and an integer K. Your task is to remove exactly K elements from this array so that the maximum difference between any two adjacent elements in the remaining array is minimized.
Example:
Input:
array = [2, 6, 7, 7, 10], K = 2
Output:
1
Explanation:
By removing elements 2 and 10, the resulting array [6, 7, 7] has differences {1, 0}. The maximum difference is 1, which is the minimum possible in this scenario.
Constraints:
1 ≤ T ≤ 100
3 ≤ N ≤ 1000
1 ≤ A[i] ≤ 10^6
0 ≤ K ≤ N - 2
- Time Limit: 1 second

AnswerBot
4mo
Remove K elements from a non-decreasing array to minimize the maximum difference between adjacent elements.
Sort the array in non-decreasing order.
Iterate through the array and calculate the difference...read more
Help your peers!
Add answer anonymously...
Top Software Developer Interview Questions Asked at Urban Company
Q. What is a thread?
Q. Describe your approach to designing a society security system, including the des...read more
Q. You are given an array of prices where prices[i] is the price of a given stock o...read more
Interview Questions Asked to Software Developer at Other Companies
Top Skill-Based Questions for Urban Company Software Developer
Algorithms Interview Questions and Answers
250 Questions
Data Structures Interview Questions and Answers
250 Questions
Web Development Interview Questions and Answers
250 Questions
Java Interview Questions and Answers
250 Questions
SQL Interview Questions and Answers
250 Questions
Software Development Interview Questions and Answers
250 Questions
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

