Skip to content

3046. Split the Array 👍

  • Time: $O(n)$
  • Space: $O(100) = O(1)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
class Solution {
 public:
  bool isPossibleToSplit(vector<int>& nums) {
    constexpr int kMax = 100;
    vector<int> count(kMax + 1);

    for (const int num : nums)
      ++count[num];

    return ranges::all_of(count, [](int freq) { return freq <= 2; });
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
class Solution {
  public boolean isPossibleToSplit(int[] nums) {
    final int MAX = 100;
    int[] count = new int[MAX + 1];

    for (final int num : nums)
      ++count[num];

    return Arrays.stream(count).allMatch(freq -> freq <= 2);
  }
}

1
2
3
class Solution:
  def isPossibleToSplit(self, nums: list[int]) -> bool:
    return all(freq <= 2 for freq in collections.Counter(nums).values())