#include <vector>
#include <unordered_map>
#include <algorithm>

using namespace std;

class Solution {
public:
    int cardboards(vector<int>& arr) {
        unordered_map<int, int> count;
        for (int num : arr) {
            count[num]++;
        }

        int squares = 0;
        for (auto& pair : count) {
            squares += pair.second / 4;
            pair.second %= 4;
        }

        int rectangles = 0;
        int pairs = 0;
        for (auto& pair : count) {
            pairs += pair.second / 2;
        }
        rectangles = pairs / 2;

        return abs(squares - rectangles);
    }
};

Gfg - Maximissing cardboards

Graduate Virtual Career Fair - Phase 2 - Multiple Roles

https://app.joinsuperset.com/join/#/signup/student/jobprofiles/15c80b8e-1e1f-4ecd-b13c-0839d9d59109

Deadline: 22 Feb 2025

Cognizant is hiring now ❤️

Cognizant Off-Campus hiring for 2024 Engineering graduates for GenC Next, GenC Pro & GenC (Feb-March)

Deadline: 7 March 2025

https://app.joinsuperset.com/join/#/signup/student/jobprofiles/80927bc8-841c-4055-a89d-e207fdb67bd9

Apply asap & check your eligibility


Share with your friends too

Stay tuned

Telegram: https://t.me/code_alphix

Job updates:
https://shorturl.at/zk7DH

All placement help available

DM : https://t.me/mrtrueliving_ix

def solve(N, D, P, S):
    ants = sorted(zip(P, S))
    colonies = 0
    slowest_time = float('-inf')
@Mrtrueliving_ix 
    for pos, speed in reversed(ants):
        time_to_reach = (D - pos) / speed
        if time_to_reach > slowest_time:
            colonies += 1
            slowest_time = time_to_reach
@Mrtrueliving_ix 
    return colonies

Little ants || Bny