๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.52K subscribers
5.55K photos
3 videos
95 files
9.64K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
Saks subarray productโœ…

long long solve(vector<int>& nums, int k) {
    if (k <= 1) return 0;
    int n = nums.size();
    long long p = 1;
    int i = 0, j = 0;
    long long ans = 0;
    while (j < n) {
        p *= nums[j];
        while (i <= j && p > k) {
            p /= nums[i];
            i++;
        }
        ans += j - i + 1;
        j++;
    }
    return ans;
}
int solve(int N, int M, vector<int>& plates) {
    sort(plates.begin(), plates.end());
    int left = 0, right = 1e9+7;
    while (left < right) {
        int mid = left + (right - left + 1) / 2;
        int sum = 0;
        for (int i = N - 1; i >= 0 && plates[i] >= mid; i--) {
            sum += plates[i] - mid;
            if (sum >= M) break;
        }
        if (sum >= M) left = mid;
        else right = mid - 1;
    }
    return left;
}

Thanksgiving โœ…
๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
Photo
vector<int> solve(vector<int>& mem, vector<vector<int>>& queries) {
    map<int, pair<int, int>> alloc;
    int id = 1;
    vector<int> res;
    for (auto& q : queries) {
        if (q[0] == 0) {
            int x = q[1];
            int start = -1;
            int count = 0;
            for (int i = 0; i < mem.size(); ++i) {
                if (mem[i] == 0) {
                    if (start == -1 && i % 8 == 0) {
                        start = i;
                    }
                    if (start != -1) {
                        ++count;
                    }
                    if (count == x) {
                        break;
                    }
                } else {
                    start = -1;
                    count = 0;
                }
            }
            if (count == x) {
                fill(mem.begin() + start, mem.begin() + start + x, 1);
                alloc[start] = {id, x};
                res.push_back(start);
                ++id;
            } else {
                res.push_back(-1);
            }
        } else {
            int eraseId = q[1];
            int length = -1;
            for(auto it = alloc.begin(); it != alloc.end(); ++it) {
                if(it->second.first == eraseId) {
                    fill(mem.begin() + it->first, mem.begin() + it->first + it->second.second, 0);
                    length = it->second.second;
                    alloc.erase(it);
                    break;
                }
            }
            res.push_back(length);
        }
    }
    return res;
}

Tradedsk โœ