TATA Teliport!!

Link - https://unstop.com/hackathons/tata-elxsi-teliport-tata-elxsi-limited-768116?lb=lo3iZQv&utm_medium=Share&utm_source=shortUrl


Must register !!
- Top performers will get chance of PPIs and PPOs !!                                                                                   
- winner cash prizes and many other offers .

Problem Setter at Hackerearth!

If you are good at DSA/CP, you should try :)

https://hackerearthjobs.hire.trakstar.com/jobs/fk0xbei/

Last Stone Weight (Nvidia)✅

Regex Checker C++ (Nvidia)✅

Physics wallah is hiring Product Interns

For 2024/2025 Grads

Duration: 6 months

https://www.linkedin.com/posts/meghna-mitra-0a611a147_google-forms-sign-in-activity-7112420099239649280-CyBH?utm_source=share&utm_medium=member_android


Repeek is hiring SDE

For 2023/2022/2021 Grads

Expected CTC: 7 LPA

https://www.linkedin.com/posts/rohina-nayak_google-forms-sign-in-activity-7112435964907589632-Upni?utm_source=share&utm_medium=member_android

Bit Profit ✅

Hashed Ports ✅

Optiver is hiring

Graduate SWE - https://optiver.reallinks.io/r/59EdhqDY

Internship (2024) -https://optiver.reallinks.io/r/dKWlU3ar

Location : Amsterdam, Netherlands

PS : Get Assessment Link Instantly

Python 3✅

Openings For Fullstack Developer, Trainee Fresher Role: Trainee

Qualification: BE (any stream) MCA, BCA, BCCA, BSC, MSC.

Skills Required: HTML, CSS

Interested candidates can apply along their resume and contact us Email Id: percept.swatib@gmail.com

Delhivery is urgently hiring for Associate/ Senior Associate - Inside Sales role based in Goa. Interested candidates, please share your resume to sanjana.suresh@delhivery.com ASAP.

Mention subject line as : Resume for Inside Sales role - Goa.

Requisites:
- Min 0 to 5yrs of exp in Inside sales
- Excellent communication skills
- Good with sales pitch, negotiations and cold calling

Note: we will get in touch only with the shortlisted profiles.

#include<bits/stdc++.h>
using namespace std;

int main(){
    int n;
    cin>>n;
    vector<int> tmp(n);
    for(int i=0; i<n; i++)
    {
        cin>>tmp[i];
    }
    int k;
    cin>>k;
    vector<int> prefMax(n), suffMin(n);
    int mx = 0;
    for(int i=0; i<n; i++)
    {
        mx = max(tmp[i], mx);
        prefMax[i] = mx;
    }
    int mn = INT_MAX;
    for(int i=n-1; i>=0; i--)
    {
        mn = min(mn, tmp[i]);
        suffMin[i] = mn;
    }
    int res = 0;
    for(int i=0; i<n-1; i++)
    {
        if(prefMax[i] + suffMin[i+1] >= k)
            res++;
    }
    cout<<res<<endl;
    return 0;
}

Organisation Flipkart OA✅

#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
    int n, m;
    cin >> n >> m;
    vector<vector<int>> v(n, vector<int>(m));
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            cin >> v[i][j];
        }
    }
    map<int, int> mp;
    for (int j = 0; j < m; j++)
    {
        int mx = 0;
        for (int i = 0; i < n; i++)
        {
            mx = max(mx, v[i][j]);
        }
        for (int i = 0; i < n; i++)
        {
            if (v[i][j] == mx)
                mp[i]++;
        }
    }
    vector<vector<int>> dp;
    for (auto it : mp)
    {
        dp.push_back({it.second, it.first});
    }
    sort(dp.rbegin(), dp.rend());
    double ans = 0;
    int id = -1, count = 0;
    for (int i = 0; i < dp.size(); i++)
    {
        if (dp[i][0] == dp[0][0])
        {
            double sum = 0.0;
            int ind = dp[i][1];
            for (int j = 0; j < m; j++)
            {
                sum += v[ind][j];
            }
            double avg = sum / m;

            if (ans < avg)
            {
                ans = avg;
                id = ind, count = dp[i][0];
            }
        }
        else
        {
            break;
        }
    }
    cout << id << " " << count << endl;
}




Network code flipkart ✅