6 Months Internship at Siemens Bangalore starting July 2024.

Details :

https://www.linkedin.com/posts/deepika-kanade_siemens-internships-deeplearning-activity-7211287958329430017-Ss60

Company Name : Amazon
Role ; Business Analyst Internship


Link : https://www.amazon.jobs/en/jobs/2662463/business-analyst-intern-row-sharp-team

Company Name: Baker Hughes

🛄 Job Title: Software Engineer
✍🏻 YOE: 2022, 2023 and 2024 grads

➡️ Apply: https://careers.bakerhughes.com/global/en/job/BAHUGLOBALR119761/Software-Engineer

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

am looking for Data Science Interns with Work From Home opportunity at Meritshot. Anybody who wants to grab this opportunity to work as a Data Science Intern can apply by sharing their resume at career@meritshot.com

You can apply even if you have zero experience in Data Science. You just need to have a willingness to learn and explore Data Science and Machine Learning.

Company: snoodify
Location: N/A
Role: Backend Engineer
For Graduates: 2024, 2023

https://www.linkedin.com/posts/dheekshithkumar_backend-developer-hiring-post-ugcPost-7211374996999262208-km92

Hackathon : Peak Himalaya Hackathon
Dates : 16th-19th July
Location : Dharamshala, Himachal Pradesh

Prizes worth $100k and much more 🙌🏻

Link to register : https://bit.ly/HimalayaHacks

Company – Unified Mentor
Role – Data Analyst Intern
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3959331210

Company – Novartis
Role – Intern - Data Science
Exp. – 0-2 yrs
Apply Here – https://www.linkedin.com/jobs/view/3958914452

Axis Bank is hiring Fresher

Apply link 👇

https://ams.hirepro.in/registration/axisbankarise/ax2lg/apply/?event=69341&job=90467

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

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

    vector<int> d(N);
    for (int i = 0; i < N; ++i) {
        cin >> d[i];
    }
   
    cin >> K;
   
    int t = 0, r = 0;
    for (int i = 0; i < N; ++i) {
        if (d[i] == 1) {
            ++t;
        } else {
            ++r;
        }
    }

    if (r == 0) {
        cout << "0\n";
        return 0;
    }

    if (r < K) {
        cout << "-1\n";
        return 0;
    }

    int it = 0;
    while (r > 0) {
        r -= K;
        ++it;
    }

    cout << it << "\n";
    return 0;
}

//telecom company gwc

int solve(vector<int>& arr, int n) {
    int max_range = 0;
    int min_val, max_val;

    for (int i = 0; i < n && n - i > max_range; i++) {
        min_val = max_val = arr[i];

        for (int j = i; j < n; j++) {
            min_val = min(min_val, arr[j]);
            max_val = max(max_val, arr[j]);

            if (2 * min_val <= max_val) {
                break;
            }

            max_range = max(max_range, j - i + 1);
        }
    }

    return n - max_range;
}. 
//chat application flipkart

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

struct Node {
    int v;
    int s;
    int i;
   
    Node(int val, int shelf, int index) : v(val), s(shelf), i(index) {}
};

struct Comp {
    bool operator()(const Node& n1, const Node& n2) {
        return n1.v > n2.v;
    }
};

pair<int, int> solve(const vector<vector<int>>& shelves) {
    int M = shelves.size();
    priority_queue<Node, vector<Node>, Comp> pq;
   
    int maxV = INT_MIN;
   
 
    for (int j = 0; j < M; ++j) {
        pq.push(Node(shelves[j][0], j, 0));
        maxV = max(maxV, shelves[j][0]);
    }
   
    int start = -1, end = -1;
    int minR = INT_MAX;
   
    while (true) {
        Node curr = pq.top();
        pq.pop();
       
        int mini = curr.v;
        int maxi = maxV;
       
        if (maxi - mini < minR) {
            minR = maxi- mini;
            start = mini;
            end = maxi;
        }
       
        int nextIdx = curr.i + 1;
        if (nextIdx >= shelves[curr.s].size()) {
            break;
        }
       
        int nextVal = shelves[curr.s][nextIdx];
        pq.push(Node(nextVal, curr.s, nextIdx));
        maxV = max(maxV, nextVal);
    }
   
    return {start, end};
}

int main() {
    int M, N;
   
    cin >> M>> N;
   
    vector<vector<int>> shelves(M, vector<int>(N));
   
    for (int i = 0; i < M; ++i) {
        for (int j = 0; j < N; ++j) {
            cin >> shelves[i][j];
        }
    }
   
    pair<int, int> ans = solve(shelves);
    cout << ans.first << " " << ans.second << endl;
   
    return 0;
}
//ecommerce-company

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

vector<int> ans;

void dfs(vector<vector<int>>& arr, int u, int p, vector<int>& dp) {
    int cnt = 0;
    for (int it : arr[u]) {
        if (it != p) {
            dfs(arr, it, u, dp);
            if (dp[it] == 1) cnt++;
        }
    }
    if (cnt == 0) {
        ans.push_back(u);
        dp[u] = 0;
    }
}

int main() {
    int tes;
    cin >> tes;
    while (tes--) {
        ans.clear();
        int n, i, min = INT_MAX, idx = -1;
        cin >> n;
        vector<int> dp(n + 1, 1);
        for (i = 1; i <= n; i++) {
            int x;
            cin >> x;
            if (min > x) {
                min = x;
                idx = i;
            }
        }
        vector<vector<int>> arr(n + 1);
        for (i = 0; i < n - 1; i++) {
            int x, y;
            cin >> x >> y;
            arr[x].push_back(y);
            arr[y].push_back(x);
        }
        dfs(arr, idx, 0, dp);
        cout << ans.size() - 1 << endl;
        for (i = 0; i < ans.size() - 1; i++) cout << ans[i] << " ";
        cout << endl;
    }
    return 0;
}

Tree Removal ✅

t = int(input())
    for _ in range(t):
        n = int(input())
        if n == 3:
            print("1 2 3")
        elif n % 2 == 0:
            for i in range(1, n // 2 + 1):
                print(f"{i} {n + 1 - i}", end=" ")
            print()
        else:
            for i in range(1, n // 2 + 1):
                print(f"{i} {n - i}", end=" ")
            print(n)

Split permutation ✅

import sys
    input = sys.stdin.read
    data = input().split()
    
    index = 0
    t = int(data[index])
    index += 1
    
    results = []
    
    for _ in range(t):
        n = int(data[index])
        m = int(data[index + 1])
        index += 2
        
        a = list(map(int, data[index:index + n]))
        index += n
        b = list(map(int, data[index:index + n]))
        index += n
        
        cnt = {}
        for x in a:
            rem = x % m
            if rem in cnt:
                cnt[rem] += 1
            else:
                cnt[rem] = 1
        
        tot = 0
        for x in b:
            rem = (m - (x % m)) % m
            if rem in cnt:
                tot += cnt[rem]
        
        results.append(tot)
    
    for result in results:
        print(result)

if __name__ == "__main__":
    main()

Trick or treat ✅

FresherOpportunityAlert

Yash Technologies is hiring Fresher - Trainee Consultant -SAP - ABAP for Hyderabad

Experience: 0-1 Years

Job Description
Perform as an individual contributor with fair degree of accountability with minimum assistance.
Execute unit testing to ensure the accuracy of his/her developments.

Link to apply: https://careers.yash.com/job/Hyderabad-Trainee-Consultant-SAP-ABAP-Job/1052844966/?

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

using namespace std;

const long long PRIME = 53;
const long long MOD = 1e9 + 7;

void solve() {
    string s;
    cin >> s;

    long long n = s.size();
    vector<long long> pow(n);
    vector<long long> dp(n + 1);

    pow[0] = 1;
    for (long long i = 1; i < n; i++) {
        pow[i] = (pow[i - 1] * PRIME) % MOD;
    }

    dp[0] = 0;
    for (long long i = 0; i < n; i++) {
        dp[i + 1] = (dp[i] + (s[i] - 'a' + 1) * pow[i]) % MOD;
    }

    auto calc = [&](int l, int r) -> long long {
        long long hash_value = (dp[r] - dp[l] + MOD) % MOD;
        hash_value = (hash_value * pow[n - 1 - l]) % MOD;
        return hash_value;
    };

    long long count = 0;

    for (long long i = 0; i < n; i++) {
        long long remaining_length = n - 2 * i;
        if (remaining_length % 2 == 1) continue;

        if (calc(0, i) == calc(i, 2 * i)) {
            long long half_remaining_length = remaining_length / 2;
            if (calc(2 * i, 2 * i + half_remaining_length) == calc(2 * i + half_remaining_length, n)) {
                count++;
            }
        }
    }

    cout << count << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;
   
    while(t--) solve();

    return 0;
}

Break the string ✅

import collections

def bioHazard(n, allergic, poisonous):
    d = collections.defaultdict(lambda: -1)
   
    for a, b in zip(allergic, poisonous):
        a, b = sorted([a, b])
        d[b] = max(d[b], a)

    for i in range(1, n + 1):
        d[i] = max(d[i], d[i - 1])

    res = 0
    for i in range(1, n + 1):
        if d[i] == -1:
            res += i
        else:
            res += i - d[i]
   
    return res

Biological Hazards ✅
MSCI