public static String solution(String[] paths) {
        String[] simplified = new String[paths.length];
        for (int i = 0; i < paths.length; i++) {
            simplified[i] = simplify(paths[i]);
        }
        String result = "";
        for (int i = 0; i < simplified.length; i++) {
            if (i == 0) {
                result = simplified[i];
            } else {
                result = commonSuffix(result, simplified[i]);
            }
        }
        return result;
    }

    public static String simplify(String path) {
        String[] parts = path.split("/");
        Stack<String> stack = new Stack<>();
        for (String part : parts) {
            if (part.equals("..")) {
                if (!stack.isEmpty()) {
                    stack.pop();
                }
            } else if (!part.equals(".")) {
                stack.push(part);
            }
        }
        StringBuilder sb = new StringBuilder();
        for (String part : stack) {
            sb.append("/");
            sb.append(part);
        }
        return sb.toString();
    }

    public static String commonSuffix(String path1, String path2) {
        String[] parts1 = path1.split("/");
        String[] parts2 = path2.split("/");
        int i = parts1.length - 1;
        int j = parts2.length - 1;
        while (i >= 0 && j >= 0 && parts1[i].equals(parts2[j])) {
            i--;
            j--;
        }
        StringBuilder sb = new StringBuilder();
        for (int k = i + 1; k < parts1.length; k++) {
            sb.append("/");
            sb.append(parts1[k]);
        }
        return sb.toString();

Company : Terabyte Innovations

Position : SDE Intern - 6 Months

Work Location : Remote

https://www.linkedin.com/posts/terabyte-innovations_softwaredeveloper-internshipopportunity-terabyteinnovations-activity-7139517802079576064-RyGk?utm_source=share&utm_medium=member_desktop

int solve(vector<int>& points) {
    sort(points.begin(), points.end(), greater<int>());
    int p1 = 0, p2 = 0;
    for(int i = 0; i < points.size(); i++) {
        if(i % 2 == 0) {
            p1 += points[i];
        } else {
            p2 += points[i];
        }
    }
    return p1 - p2;
}

Amazon ✅

Company Name: MakerSharks

Role: Software Development Intern

Batch eligible: 2024 and 2025 passouts

Apply: https://www.makersharks.com/software-development-intern-application

Microsoft Hiring Software Engineer Intern

Batch - 2025

Link 🔗
https://jobs.careers.microsoft.com/global/en/job/1577325/Software-Engineering---Internship-Opportunities

sort(A.begin(), A.end());
    sort(B.begin(), B.end());

    int cool = 0, j = 0;
    for(int i=0; i<N; i++) {
        while(j < M && B[j] < A[i] - d) j++;
        if(j == M || B[j] > A[i] + d) cool++;
        else j++;
    }

    return cool;

Coolness Factor ✅

Wood Consulting Hiring Graduate Engineer trainee

Batch: 2023, 2022, 2021 passout batch

Salary : 6lpa- 8 lpa per month

Application link  : https://ehif.fa.em2.oraclecloud.com/hcmUI/CandidateExperience/en/job/1342/

Corede Hiring Engineer Trainee
Duration

Batch :2023, 2022,and before batch

Application link  : https://coredge.io/careers/graduate-engineer-trainee/

Seagate Hiring AI Machine learning Intern

Batch: 2023, 2024 passout batch

Application link  : https://seagatecareers.com/job/Pune-Intern-AI-Machine-learning/1105359500/

Company Name: TravelXp

Role: Junior Software Developer

Batch eligible: 2022 and 2023 passouts

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

Company Name: GeeksForGeeks

Role: Teaching Assistant - DSA

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

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define endl "\n"
#define MOD 1000000007
#define MOD2 998244353
#define vll vector<ll>

struct SegmentTree {
    ll N;
    vll tree;
    ll neutral = 0;

    ll combine(ll a, ll b) {
        return a + b;
    }

    void build(ll u, ll L, ll R, vll &v) {
        if(L == R) {
            tree[u] = v[L];
        } else {
            ll M = (L + R) / 2;
            build(u * 2, L, M, v);
            build(u * 2 + 1, M + 1, R, v);
            tree[u] = combine(tree[u * 2], tree[u * 2 + 1]);
        }
    }

    SegmentTree(vll v) {
        N = v.size() - 1;
        tree.assign(4 * N + 1, 0);
        build(1, 1, N, v);
    }

    ll query(ll lq, ll rq, ll u, ll L, ll R) {
        if(L > rq || R < lq) {
            return neutral;
        } else if(L >= lq && R <= rq) {
            return tree[u];
        } else {
            ll M = (L + R) / 2;
            return combine(query(lq, rq, u * 2, L, M), query(lq, rq, u * 2 + 1, M + 1, R));
        }
    }

    void update(ll idx, ll val, ll u, ll L, ll R) {
        if(L > idx || R < idx) {
            return;
        } else if(L == R) {
            tree[u] = val;
            return;
        } else {
            ll M = (L + R) / 2;
            update(idx, val, u * 2, L, M);
            update(idx, val, u * 2 + 1, M + 1, R);
            tree[u] = combine(tree[u * 2], tree[u * 2 + 1]);
        }
    }
};

const int MAXN = 1e6 + 1;
vector<int> spf(MAXN);

void sieve() {
    spf[1] = 1;
    for (int i = 2; i < MAXN; i++)
        spf[i] = i;
    for (int i = 4; i < MAXN; i += 2)
        spf[i] = 2;
    for (int i = 3; i * i < MAXN; i++) {
        if (spf[i] == i) {
            for (int j = i * i; j < MAXN; j += i)
                if (spf[j] == j)
                    spf[j] = i;
        }
    }
}

int32_t main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    sieve();
    int n, q; cin >> n >> q;
    vll arr(n + 1);
    for(int i = 1; i <= n; i++) cin >> arr[i];
    SegmentTree sgt(arr);
    set<int> s;
    for(int i = 1; i <= n; i++)
        s.insert(i);

    while(q--) {
        int type; cin >> type;
        int a, b; cin >> a >> b;
        if(type == 3) {
            sgt.update(a, b, 1, 1, n);
            int temp = a;
            auto it = s.lower_bound(temp);
            if(it != s.end() and s.size() != 0 and *it == a) {
                s.erase(temp);
                s.insert(a);
            } else {
                s.insert(a);
            }
            arr[a] = b;
        } else if (type == 2) {
            cout << sgt.query(a, b, 1, 1, n) << endl;
        } else {
            while(a <= b) {
                int temp = a;
                auto it = s.lower_bound(temp);
                if(it == s.end()) break;
                if(*it > b) break;
                int c = *it + 1;
                sgt.update(a, arr[a] / spf[arr[a]], 1, 1, n);
                if(spf[a] == 1) {
                    s.erase(temp);
                }
                arr[a] = spf[a];
                a = c;
            }
        }
    }
    return 0;
}

Divisior queries ✅
BNY Mellon
Source : Hola

Array and queries
BNY Mellon ✅