minimum-number-of-operations-to-make-array-empty.cpp

// Time:  O(n)
// Space: O(n)

// freq table, greedy
class Solution {
public:
    int minOperations(vector<int>& nums) {
        const auto& ceil_divide = [](int a, int b) {
            return (a + b - 1) / b;
        };

        unordered_map<int, int> cnt;
        for (const auto& x : nums) {
            ++cnt[x];
        }
        return all_of(cbegin(cnt), cend(cnt), [](const auto& x) {
            return x.second >= 2;
        }) ? accumulate(cbegin(cnt), cend(cnt), 0, [&](const auto& accu, const auto& x) {
            return accu + ceil_divide(x.second, 3);
        }) : -1;
    }
};