leetcode-algorithms/src/SplitTheArray.java at master · anishLearnsToCode/leetcode-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
// https://leetcode.com/problems/split-the-array
// T: O(N)
// S: O(N)

import java.util.HashMap;
import java.util.Map;

public class SplitTheArray {
    public boolean isPossibleToSplit(int[] array) {
        final Map<Integer, Integer> frequencies = new HashMap<>();
        for (int element : array) {
            if (frequencies.getOrDefault(element, 0) == 2) {
                return false;
            }
            frequencies.put(element, frequencies.getOrDefault(element, 0) + 1);
        }
        return true;
    }
}