Company Name: Meesho

Role: SDE Intern

Batch eligible: 2023 and 2024 passouts

Apply: https://www.meesho.io/jobs/open-recruitment

🚨JOB OPENING UPDATE🚨

Company – Tree Top Staffing LLC
Role – Data Analyst
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3800053561

Company – MachineHack Generative AI
Role – Generative AI Engineer
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3801085938

Company – Hexaware Technologies
Role – Analytics Data science and IOT Engineer
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3800858321

Company – Altrata India Private Ltd
Role – Data Engineer
Exp. – 0-2 yr
Apply Here – https://www.naukri.com/job-listings-data-engineer-altrata-india-private-ltd-chennai-tamil-nadu-0-to-2-years-070124001912?src=sortby&sid=1704692157253739_1&xp=5&px=1&nignbevent_src=jobsearchDeskGNB

Company – SAZ India
Role – Data Analytics Intern
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3800760641

Company – Radio City
Role – Data Analytics intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/data-analytics-internship-in-mumbai-at-radio-city1704438545

Company – AIqwip
Role – Data Science intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/data-science-internship-in-bangalore-at-aiqwip1704547841

Company – Across The Globe (ATG)
Role – Deep Learning
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/deep-learning-work-from-home-job-internship-at-across-the-globe-atg1703825932

Company – Blackcoffer
Role – Data Science
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/data-science-work-from-home-job-internship-at-blackcoffer1704450041

ALL THE BEST💙

SELECT
    YEAR(o.order_date) AS year,
    MONTH(o.order_date) AS month,
    SUM(oi.quantity * oi.price) AS total_revenue
FROM
    orders o
JOIN
    order_items oi ON o.order_id = oi.order_id
GROUP BY
    YEAR(o.order_date),
    MONTH(o.order_date)
ORDER BY
    YEAR(o.order_date),
    MONTH(o.order_date);

SQL ✅

def count_numbers_in_range(L, R, n, arr):
    count = 0

    for num in arr:
        if L <= num <= R:
            count += 1

    return count

L = int(input())
R = int(input())
n = int(input())
arr = [int(input()) for _ in range(n)]

result = count_numbers_in_range(L, R, n, arr)
print(result)

Company Name : Headout
Role : Software Engineer Internship

Batch : 2024/2025 passouts

Link : https://boards.greenhouse.io/headoutreferrals/jobs/4318904006

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

vector<int> rankSongs(vector<vector<int>> pref) {
    int n = pref.size();
    int m = pref[0].size();

    vector<vector<int>> b(m, vector<int>(m, 0));
    vector<int> w(m, 0), r(m);
    iota(r.begin(), r.end(), 0);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            for (int k = j + 1; k < m; k++) {
                b[pref[i][j]][pref[i][k]]++;
            }
        }
    }

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            if (i != j && (b[i][j] > b[j][i] || (b[i][j] == b[j][i] && i < j))) {
                w[i]++;
            }
        }
    }

    sort(r.begin(), r.end(), [&](int i, int j) {
        return w[i] > w[j] || (w[i] == w[j] && i < j);
    });

    return r;
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> p(n, vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> p[i][j];
        }
    }
    vector<int> r = rankSongs(p);
    for (int i = 0; i < m; i++) {
        cout << r[i] << endl;
    }
    cout << endl;
    return 0;
}

Songs Popularity Code
PayPal ✅

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

vector<int> solve(int N, vector<int> a, int q, vector<vector<int>> queries) {
    vector<int> res;
    for(int i=0; i<q; i++) {
        int T = queries[i][0];
        int l = queries[i][1];
        int r = queries[i][2];
        int x = queries[i][3];
        if(T == 1) {
            int ans = a[l-1];
            for(int j=l; j<r; j++) {
                ans |= a[j];
            }
            res.push_back(ans);
        } else {
            for(int j=l-1; j<r; j++) {
                a[j] ^= x;
            }
        }
    }
    return res;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N;
    cin>>N;
    vector<int> a(N);
    for(int i=0; i<N; i++) {
        cin>>a[i];
    }
    int q;
    cin>>q;
    vector<vector<int>> queries(q, vector<int>(4));
    for(int i=0; i<q; i++) {
        for(int j=0; j<4; j++) {
            cin>>queries[i][j];
        }
    }
    vector<int> res = solve(N, a, q, queries);
    for(int i=0; i<res.size(); i++) {
        cout<<res[i]<<" ";
    }
    cout<<endl;
    return 0;
}

Array bitwise operations✅

Company Name: Alakmalak Technologies

Role: Software Developer

Batch eligible: 2023 and 2024 passouts

Apply: https://bit.ly/3H8Dxf8

Company Name: Coinbase

Role: Software Engineer

Batch eligible: 2022 and 2023 passouts

Apply: https://www.coinbase.com/en-gb/careers/positions/5598961?gh_jid=5598961&gh_src=20687b321us%E2%80%A6

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 ✅

Company - HITACHI

Role - R&D Engineer

Batch - 2023 , 2024

Exp CTC - 15 lpa

Location - Bengaluru

Link - https://www.hitachienergy.com/careers/open-jobs/details/JID3-60485