Longest Equivalent Sublist After K Increments - Google Top Interview Questions
Problem Statement :
You are given a list of integers nums and an integer k. Consider an operation where you increment any one element once. Given that you can perform this at most k times, return the length of the longest sublist containing equal elements. Constraints n ≤ 100,000 where n is the length of nums k < 2 ** 31 Example 1 Input nums = [2, 4, 8, 5, 9, 6] k = 6 Output 3 Explanation We can increment 8 once and 5 four times to get a sublist of [9, 9, 9].
Solution :
Solution in C++ :
int solve(vector<int>& nums, int k) {
int ans = 0;
multiset<int> m;
for (int i = 0, j = 0, sum = 0; j < nums.size(); j++) {
sum += nums[j];
m.insert(nums[j]);
for (; !m.empty() && *m.rbegin() * (j - i + 1) - sum > k; i++) {
m.erase(m.find(nums[i]));
sum -= nums[i];
}
ans = max(ans, j - i + 1);
}
return ans;
}
Solution in Java :
import java.util.*;
class Solution {
public int solve(int[] nums, int k) {
MultiSet ms = new MultiSet();
int l = 0;
int r = 0;
int cur_increments = 0;
int ret = 0;
// move r until necessary increments exceeds k
// anchor l until it's valid again
while (r < nums.length) {
// process r
Integer maxy = ms.last();
int x = nums[r];
if (maxy == null || x > maxy) {
if (maxy != null) {
cur_increments += (x - maxy) * ms.size();
}
} else {
cur_increments += (maxy - x);
}
ms.add(x);
// process l
while (cur_increments > k) {
x = nums[l];
ms.remove(x);
int lmaxy = ms.last();
if (lmaxy == x) {
} else if (lmaxy < x) {
cur_increments -= ms.size() * (x - lmaxy);
} else {
cur_increments -= lmaxy - x;
}
l++;
}
ret = Math.max(ret, r - l + 1);
r++;
}
return ret;
}
}
class MultiSet {
TreeMap<Integer, Integer> map = new TreeMap<>();
private int size = 0;
public MultiSet() {
}
public void add(int val) {
map.put(val, map.getOrDefault(val, 0) + 1);
size++;
}
public void remove(int val) {
map.put(val, map.get(val) - 1);
if (map.get(val) == 0) {
map.remove(val);
}
size--;
}
public int size() {
return size;
}
public Integer higher(int val) {
return map.higherKey(val);
}
public Integer lower(int val) {
return map.lowerKey(val);
}
public Integer ceiling(int val) {
return map.ceilingKey(val);
}
public Integer floor(int val) {
return map.floorKey(val);
}
public Integer first() {
if (map.isEmpty())
return null;
return map.firstKey();
}
public Integer last() {
if (map.isEmpty())
return null;
return map.lastKey();
}
public boolean isEmpty() {
return map.isEmpty();
}
@Override
public String toString() {
return map.toString();
}
}
Solution in Python :
class Solution:
def solve(self, nums, k):
ans = left = total = 0
q = deque()
for right, a in enumerate(nums):
total += a
while q and nums[q[-1]] <= a:
q.pop()
q.append(right)
while q and k < (right - left + 1) * nums[q[0]] - total:
total -= nums[left]
if q and left == q[0]:
q.popleft()
left += 1
ans = max(ans, right - left + 1)
return ans
View More Similar Problems
Array-DS
An array is a type of data structure that stores elements of the same type in a contiguous block of memory. In an array, A, of size N, each memory location has some unique index, i (where 0<=i<N), that can be referenced as A[i] or Ai. Reverse an array of integers. Note: If you've already solved our C++ domain's Arrays Introduction challenge, you may want to skip this. Example: A=[1,2,3
View Solution →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 →