from bisect import bisect_left, bisect_right

class Solution:
    def minTime(self, start, end, q_start, q_end, k):
        events = [(s, 1) for s in start] + [(e + 1, -1) for e in end]
        events.sort()

        intervals, cnt, prev = [], 0, None
        for t, typ in events:
            if prev is not None and cnt >= k:
                intervals.append((prev, t))
            cnt += typ
            prev = t

        starts = [s for s, _ in intervals]
        ends = [e for _, e in intervals]
        pre = [0] * len(ends)
        total = 0
        for i in range(len(intervals)):
            total += ends[i] - starts[i]
            pre[i] = total

        res = []
        for qs, qe in zip(q_start, q_end):
            l = bisect_left(ends, qs)
            r = bisect_right(starts, qe) - 1
            if l > r:
                res.append(0)
                continue

            overlap = pre[r] - (pre[l - 1] if l > 0 else 0)
            if starts[l] < qs:
                overlap -= qs - starts[l]
            if ends[r] > qe:
                overlap -= ends[r] - qe
            res.append(overlap)
        
        return res

Optymzr ✅

🚀 Exciting Opportunity at Games24x7! 🚀

We are hiring for the role of Data Engineer (SDE-1) at our Bangalore location! If you have a passion for data and a strong background in Spark, Python, data pipelines, and real-time data streaming, MLOps we want to hear from you!

🗓️ Scheduled Drive: October 24th & 25th
📍 Location: Bangalore
🔍 Interview Format: Two rounds of technical interviews (virtual) on the same day.

We're looking for candidates who can join us within a month and are eager to work with the latest data engineering tech stack.

If you're interested, please send your resume to tarun.kumavat@games24x7.com

Kaptan hiring for Software Engineer Apprentice roles

6 months apprentice
| 15 k per month stipend
| 6 LPA after PPO | Kolkata Location

Apply Here :
https://cloudkaptan.keka.com/careers/jobdetails/56146

Company Name: GE Aerospace
Batch eligible: 2025 and 2026 grads

1) Data Science Intern:
Apply: https://jobs.gecareers.com/aviation/global/en/job/GE11GLOBALR3786315EXTERNALENGLOBAL/Data-Science-Intern

2) Digital Technology Intern
Apply: https://jobs.gecareers.com/aviation/global/en/job/GE11GLOBALR3785953EXTERNALENGLOBAL/DT-Intern

Company Name: Siemens Healthineers
Role: Machine Learning Intern
Batch eligible: 2025 and 2026 grads

Apply: https://jobs.siemens-healthineers.com/careers/job/563156121429555

#include <iostream>
#include <vector>
#include <unordered_map>
#include <string>

using namespace std;

class HMap {
private:
    unordered_map<long long, long long> m;
    long long a;
    long long b;

public:
    HMap() : a(0), b(0) {}

    void insert(long long x, long long y) {
        m[x - a] = y - b;
    }

    long long get(long long x) {
        long long k = x - a;
        if (m.find(k) != m.end()) {
            return m[k] + b;
        }
        return 0;
    }

    void addToKey(long long x) {
        a += x;
    }

    void addToValue(long long y) {
        b += y;
    }
};

long long solution(vector<string> qType, vector<vector<int>> q) {
    HMap h;
    long long s = 0;

    for (size_t i = 0; i < qType.size(); i++) {
        if (qType[i] == "insert") {
            h.insert(q[i][0], q[i][1]);
        } else if (qType[i] == "get") {
            s += h.get(q[i][0]);
        } else if (qType[i] == "addToKey") {
            h.addToKey(q[i][0]);
        } else if (qType[i] == "addToValue") {
            h.addToValue(q[i][0]);
        }
    }

    return s;
}

Motive OA ✅

Truefan is hiring Devops Engineer

For 2023, 2024 grads
Location: Gurugram

https://www.linkedin.com/jobs/view/4055350088

For all the opportunities, check the job description and see if you are eligible, you are fulfilling 50-60% of job description, update your resume with all the keywords and Apply!!

Best of luck guys 😇❤️

Company Name : Coinbase
Role : SDE Internship
Batch : 2026 passouts

Link : https://www.coinbase.com/en-gb/careers/positions/6266456?gh_jid=6266456&gh_src=20687b321us

Cuti group Hiring !!
Role - Apps Programmer analyst
Exp - 0 to 2 year

Link - https://jobs.citi.com/job/-/-/287/71615296816

Hiring Software Trainees - WALK IN DRIVE 2024
https://forms.office.com/pages/responsepage.aspx?id=fretDtxC-Ee74-wjleBxLIgr3q69FJpOkbdJifu1Fl5UMlpIU0kwV1k0SU9TSE1UVk9ON1VGUTgwVy4u&origin=QRCode&route=shorturl

#include <bits/stdc++.h>
using namespace std;
int overlap(string a, string b) {
    int m = a.length(), n = b.length();
    int v = 0;
        for (int i = 1; i <= min(m, n); i++) {
        if (a.substr(m - i) == b.substr(0, i)) {
            v = i;
        }
    }
    return v;
}

int maxScore(int N, vector<string>& LIST, vector<int>& POINTS, int limit) {
    vector<int> dp(limit + 1, 0); 
    for (int i = 0; i < N; i++) {
        int len = LIST[i].length();
        int points = POINTS[i];
        for (int j = len; j <= limit; j++) {
            dp[j] = max(dp[j], dp[j - len] + points);
        }
        for (int k = 0; k < N; k++) {
            if (i == k) continue; 
            int ov = overlap(LIST[i], LIST[k]);
            int new_len = len + LIST[k].length() - ov;
            int new_points = points + POINTS[k];
            for (int j = new_len; j <= limit; j++) {
                dp[j] = max(dp[j], dp[j - new_len] + new_points);
            }
        }
    }
    return dp[limit];
}

Construct Best String ✅
Stonewain

Looking for talented freshers who are willing to build their career as a Data Analyst / Data Engineer.

📝Mandatory Skills:
✨SQL
✨Python
✨PoweBI
✨Tableau

💌 Interested candidates share your resume via email to beula.nadar@hansacequity.com

If useful show 👍🏻

#include <bits/stdc++.h>
using namespace std;
int minCostToCleanDataset(string dataset, int ox, int oy) {
    unordered_map<char, int> freq;
    for (char c : dataset) {
        freq[c]++;
    }
    int r = 0;
    int t = 0;
    for (auto &entry : freq) {
        int count = entry.second;
        t += (count / 2) * ox;
        if (count % 2 != 0) {
            r++;
        }
    }
    t += (r / 2) * oy;
    return t;
}

Amazon ✅

vector<int> solve(int n, vector<vector<int>> m) {
    vector<int> t(n, 0);
    vector<int> w(n, 0);

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            if(m[i][j] == 1) {
                t[i]++;
            }
        }
    }

    int maxi = *max_element(t.begin(), t.end());

    for(int i = 0; i < n; i++) {
        if(t[i] + count(m[i].begin(), m[i].end(), 2) >= maxi) {
            w[i] = 1;
        }
    }

    return w;
}

Stonewain ✅