𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Fridayyyyy ✌🏻

❤7👍2🤩1🤮1

1.07K views07:00

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

693 views08:59

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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/

624 views19:37

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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

535 views19:37

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Awign is hiring for Product Intern

10 k per month stipend

Send resume to : anup.pohaney@awign.com

410 views02:03

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

🚀 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

459 views02:04

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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

INDmoney hiring Product Management Intern in Gurugram, Haryana, India | LinkedIn

Posted 9:44:16 AM. Duration: 6 months

Key ResponsibilitiesAssist with Product Research: Support market research and…See this and similar jobs on LinkedIn.

418 views02:06

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Mouser Electronics is hiring for Web Developer I (0-4 years)
Expected Salary: 10-20 LPA
Apply here:
https://phf.tbe.taleo.net/phf03/ats/careers/v2/viewRequisition?org=MOUSER&cws=40&rid=17859

phf.tbe.taleo.net

Hiring Web Developer I, Internet MP0600 - BANGALORE INDIA

View job details and apply now

382 views02:09

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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

357 views02:10

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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 ✅

474 views02:15

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

#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;
}

👍1

554 views02:16

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

PhonePe ✅

565 viewsedited 02:16

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

589 views02:20

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Photo

#include <bits/stdc++.h>
#define ll long long  
using namespace std; 
vector<ll> solve(ll n,ll m,vector<ll>&txt,vector<ll>& pat) 
{
    vector<ll>mask(UCHAR_MAX+1,~0);
    for (ll i=0;i<m;i++) 
    {
        mask[pat[i]]&=~(1U<<i);
    }
    vector<ll>result;
    ll R=~1;
    vector<ll>Rm(2,~1);
    for (ll i=0;i<n;i++) 
    {
        ll old=R;
        R|=mask[txt[i]];
        R<<=1;
        ll tmp=Rm[1];
        Rm[1]=(old&(Rm[1]|mask[txt[i]]))<<1;
        old=tmp;
        if((Rm[1]&(1U<<m))==0) 
        {
            result.push_back(i-m+2);
        }
    }
    return result;
}
signed main() 
{
    ll n,m; cin>>n>>m;
    vector<ll>txt(n),pat(m);
    for(ll i=0;i<n;i++) cin>>txt[i];
    for(ll i=0;i<m;i++) cin>>pat[i];
    auto ans=solve(n,m,txt,pat);
    cout<<ans.size()<<endl;
    for(auto it:ans) cout<<it<<" ";
    return 0;
}

Phonepe ✅
Find my file

582 viewsedited 02:20

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

#include <iostream>
#include <vector>
#include <unordered_set>
#include <string>
using namespace std;

bool containsDislikedDigits(int number, const unordered_set<int>& dislikedDigits) {
    while (number > 0) {
        if (dislikedDigits.find(number % 10) != dislikedDigits.end()) {
            return true;
        }
        number /= 10;
    }
    return false;
}

int solve(int N, int k, vector<int>& d) {
    unordered_set<int> dislikedDigits(d.begin(), d.end());

    while (containsDislikedDigits(N, dislikedDigits)) {
        ++N;
    }

    return N;
}

int main() {
    int N, k;
    cin >> N >> k;

    vector<int> d(k);
    for (int i = 0; i < k; ++i) {
        cin >> d[i];
    }

    int result = solve(N, k, d);
    cout << result << endl;

    return 0;
}

//minimum amount
Increff✅

586 views02:26

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Smallest number
Increff ✅

541 views02:29

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

def maxShared(friends_nodes, friends_from, friends_to, friends_weight):
    interests = {}

    for i in range(len(friends_from)):
        pair = tuple(sorted([friends_from[i], friends_to[i]]))
        if pair not in interests:
            interests[pair] = set()
        interests[pair].add(friends_weight[i])

    max_shared = max(len(interests[pair]) for pair in interests)
    max_pairs = [pair for pair in interests if len(interests[pair]) == max_shared]

    max_product = max(pair[0] * pair[1] for pair in max_pairs)
    
    return max_product

561 views02:30

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

def canAchieve(min_attention, attention, m, k):
    n = len(attention)
    diff = [0] * (n + 1)
    current_add = 0
    workshops_used = 0

    for i in range(n):
        current_add += diff[i]
        if attention[i] + current_add < min_attention:
            increment = min_attention - (attention[i] + current_add)
            workshops_used += increment
            if workshops_used > m:
                return False
            if i + k < n:
                diff[i + k] -= increment
            current_add += increment

    return workshops_used <= m

def maximizeMinAttention(attention, m, k):
    left = min(attention)
    right = max(attention) + m

    while left < right:
        mid = (left + right + 1) // 2
        if canAchieve(mid, attention, m, k):
            left = mid
        else:
            right = mid - 1

    return left

❤1

522 views02:31

About

Blog

Apps

Platform