#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
vector<int> ttl_cache(int n, vector<vector<int>> entries, vector<int> queries){
    int q = queries.size();

    vector<pair<int,int>> arr;
    for(int i=0;i<q;i++){
        arr.push_back({queries[i],i});
    }
    sort(arr.begin(),arr.end());

    vector<int> res(q);
    pbds st;

    int i=0;
    int x = arr[i].first;
    sort(entries.begin(), entries.end());
    for(auto &v:entries){
        while(v[0]>x){
            res[arr[i].second] = st.size() - st.order_of_key(x);
            i++;
            if(i==q) return res;
            x = arr[i].first;
        }
        st.insert(v[0]+v[1]);
    }

    for(;i<q;i++){
        x = arr[i].first;
        res[arr[i].second] = st.size() - st.order_of_key(x);
    }
    return res;
}

TTL Cache ✅

int countBits(int v) { 
    int count = 0; 
    while (v > 0) { 
        count += v & 1; 
        v >>= 1; 
    } 
    return count; 
} 

string palindromeChecker(string s, vector<int> startIndex, vector<int> endIndex, vector<int> subs) { 
    int bp = 0; 
    string myString = ""; 
    vector<int> L; 
    L.push_back(bp); 

    for (char i : s) { 
        int ci = i - 'a'; 
        bp = bp ^ (1 << ci); 
        L.push_back(bp); 
    } 

    int q = startIndex.size(); 
    int c1 = L[startIndex[0]]; 
    int c2 = L[endIndex[0] + 1]; 
    int di = c1 ^ c2; 
    int ooc = countBits(di); 
    bool r = (ooc - subs[0] * 2) <= 1; 

    if (r) { 
        myString = "1"; 
    } else { 
        myString = "0"; 
    } 

    return myString; 
}

Can you make a palindrome
BNY Mellon ✅

Tech Mahindra is hiring for SERVICE DESK AGENTS

Job Location : Noida (nsez)

-- Should have good and working knowledge on windows/mac os, AD, multifactor authentication, access request of applications.
-- Experience on ITSM TOOLS, remote tools and troubleshooting.
-- Understanding of priority and escalation matrix.
--
Troubleshooting on Application support, printers, mfd's, von software,
collaboration tools, password reset tools, ms windows & office,
desktops, laptops, ipad peripherals & networking etc
-- aware of kpi's and sla's

5 days working
both side cab facility (under 30km of radius from ofc campus)

FRESHERS WITH GOOD COMMUNICATION SKILLS & BASIC TECHNICAL KNOWLEDGE CAN ALSO APPLY.

GRADUATION IS MANDATORY.

ONLY IMMEDIATE JOINERS CAN APPLY.

Call or share your resume @ 8527249359 / ns00834085@techmahindra.com

TTL Cache ✅

Exciting Internship Opportunity!🔔

The Man Company is hiring a Data Analyst Intern!

We are looking for a Data Analyst Intern to join our Operations team. If you have a passion for supply chain management and data analysis, this is the perfect opportunity for you!

📍 Location: Gurgaon (Work from office)

Send CVs at aayushi@themancompany.com

Fridayyyyy ✌🏻

Company Name: Kelly (Park+ Startup)
Role: Software Engineer Intern

Batch eligible: 2025 and 2026 grads

Apply: https://docs.google.com/forms/d/e/1FAIpQLSfp9aPne4OyUY3cg7fPsFTdY11NTd1eS_PBDNGn5CiyKaI3kA/viewform

Company Name: Caterpillar
Role: Associate Software Engineer

Batch eligible: 2023 and 2024 grads

Apply: https://careers.caterpillar.com/en/jobs/job/r0000257330-associate-software-engineer/

Company Name: NI
Role: Software Engineer

Batch eligible: 2023 and 2024 grads

Apply: https://pef.fa.us1.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1/job/9331

Awign is hiring for Product Intern

10 k per month stipend

Send resume to : anup.pohaney@awign.com

🚀 Join Our FinTech Team : Founding Mobile Developer

Location: Gurugram
Type: Full-time position at Gurugram Office
Experience: 0-2 yrs of Experience (Freshers/Recent Graduates can also apply) (Flutter Experience Preferred but any mobile development experience will be good enough)
Qualifications: B.Tech CSE Preferred but if you have worked in FinTech earlier, that would be a bigger plus. (Btw Open to all)
Perks: Competitive compensation and ESOPs ; and an exposure to Trading & FinTech Industry like never before.

Apply Here : https://forms.gle/cW1KK2n4hsqzRvdS7

Check out this job at INDmoney: https://www.linkedin.com/jobs/view/3979166118

Scalong AI is hiring for Postgres DBA role

2024/ 2023 batch passouts eligible

Noida location

Send resume at : kajalm@ibosstech-us.com
yashikas@ibosstech-us.com

int mincost(vector<int> &pods,vector<int> &cost){
  map<int,multiset<int>> mp;
  for(int i=0;i<pods.size();i++){
    mp[pods[i]].insert(cost[i]);
  }
  int ans = 0;
  int curr = (*mp.begin()).first,sm = 0;
  multiset<int> se;
  while(1){
    if(se.size()==0){
      if(mp.lower_bound(curr) == mp.end()) break;
      curr = (*mp.lower_bound(curr)).first;
    }

    if(mp.find(curr) != mp.end())
    for(auto &x:mp[curr]){
        se.insert(x);
        sm += x;
    }

    auto it = se.end();
    it--;
    sm -= *it;
    ans += sm;
    se.erase(it);
    curr++;
  }

  return ans;
}

Weird Pod Count ✅

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

bool canCoverAllHouses(const vector<int>& houses, int N, int K, int P) {
    int count = 0;
    int i = 0;
    while (i < N && count < K) {
        int location = houses[i] + P;
        count++;
        while (i < N && houses[i] <= location + P) {
            i++;
        }
    }
    return i == N;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
   
    int N, K;
    cin >> N >> K;
   
    vector<int> houses(N);
    for (int i = 0; i < N; ++i) {
        cin >> houses[i];
    }
   
    sort(houses.begin(), houses.end());
   
    int left = 0;
    int right = houses[N-1] - houses[0];
    int result = right;
   
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (canCoverAllHouses(houses, N, K, mid)) {
            result = mid;
            right = mid - 1;
        } else {
            left = mid + 1;
        }
    }
   
    cout << result << '\n';
   
    return 0;
}

PhonePe ✅