Minimize Amplitude After K Removals - Google Top Interview Questions
Problem Statement :
You are given a list of integers nums, and an integer k. Given that you must remove k elements in nums, return the minimum max(nums) - min(nums) value we can achieve. Constraints 1 ≤ n ≤ 100,000 where n is the length of nums k < n Example 1 Input nums = [2, 10, 14, 12, 30] k = 2 Output 4 Explanation If we remove 2 and 30 then we'd get [10, 14, 12] and 14 - 10 = 4.
Solution :
Solution in C++ :
int solve(vector<int>& nums, int k) {
int n = nums.size();
sort(nums.begin(), nums.end()); // O(nlogn)
int min = nums.back() - nums[0];
if (k == 0) return min;
for (int i = 0; i + n - k - 1 < nums.size(); ++i) { // O(n)
if (nums[i + n - k - 1] - nums[i] < min) min = nums[i + n - k - 1] - nums[i];
}
return min;
}
Solution in Java :
import java.util.*;
class Solution {
public int solve(int[] nums, int k) {
Arrays.sort(nums);
int n = nums.length;
if (k >= n - 1)
return 0;
int res = Integer.MAX_VALUE;
for (int i = 0; i <= k; i++) {
int remove_other = k - i;
// remove i from left
res = Math.min(res, nums[n - 1 - remove_other] - nums[i]);
// remove i from right
res = Math.min(res, nums[n - 1 - i] - nums[remove_other]);
}
return res;
}
}
Solution in Python :
class Solution:
def solve(self, nums, k):
keep = len(nums) - k
nums.sort()
return min(nums[i + keep - 1] - nums[i] for i in range(len(nums) - keep + 1))
View More Similar Problems
2D Array-DS
Given a 6*6 2D Array, arr: 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 An hourglass in A is a subset of values with indices falling in this pattern in arr's graphical representation: a b c d e f g There are 16 hourglasses in arr. An hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every hourglass in arr, then print t
View Solution →Dynamic Array
Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.
View Solution →Left Rotation
A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d
View Solution →Sparse Arrays
There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun
View Solution →Array Manipulation
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu
View Solution →Print the Elements of a Linked List
This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode
View Solution →