**List Consecutive Split - Google Top Interview Questions**

### Problem Statement :

Given a list of integers nums, and an integer k, return whether the list can be split into lists where each list contains k integers and is consecutively increasing. Constraints n ≤ 100,000 where n is the length of nums. Example 1 Input nums = [3, 2, 3, 4, 5, 1] k = 3 Output True Explanation We can split the list into [1, 2, 3] and [3, 4, 5]

### Solution :

` ````
Solution in C++ :
bool solve(vector<int>& nums, int k) {
map<int, int> m;
for (int n : nums) m[n]++;
while (m.size()) {
auto [x, y] = *m.begin();
if (y == 0) {
m.erase(x);
continue;
}
for (int i = x; i < x + k; i++) {
if (m[i] < y) {
return false;
}
m[i] -= y;
}
}
return m.size() == 0;
}
```

` ````
Solution in Java :
import java.util.*;
class Solution {
public boolean solve(int[] nums, int k) {
if (nums == null || nums.length == 0 || k > nums.length)
return false;
Map<Integer, Integer> freqMap = new HashMap();
for (int num : nums) freqMap.put(num, freqMap.getOrDefault(num, 0) + 1);
PriorityQueue<Integer> pq = new PriorityQueue<>();
for (int key : freqMap.keySet()) pq.offer(key);
while (!pq.isEmpty() && pq.size() >= k) {
int curr = -1;
List<Integer> temp = new ArrayList();
for (int i = 1; i <= k; i++) {
int num = pq.poll();
temp.add(num);
if (freqMap.get(num) == 1)
freqMap.remove(num);
else
freqMap.put(num, freqMap.get(num) - 1);
if (curr == -1) {
curr = num;
} else {
if (num != curr + 1)
return false;
curr = num;
}
}
for (int i = 0; i < temp.size(); i++) {
if (freqMap.containsKey(temp.get(i)))
pq.offer(temp.get(i));
}
}
return pq.isEmpty();
}
}
```

` ````
Solution in Python :
class Solution:
def solve(self, nums, k):
fre = Counter(nums)
# greedy solution, take the smallest then try
vals = list(fre.keys())
heapq.heapify(vals)
# every iteration i make a new list
while len(vals):
# let us start with the minimum element
start = vals[0]
# now create a list starting with 'start'
for i in range(k):
if fre[start + i]:
fre[start + i] -= 1
else:
return False
# pop any elements which are not remaining
while len(vals) and fre[vals[0]] == 0:
heapq.heappop(vals)
return True
```

## 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 →