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

const int MOD = 1e9 + 7;

class SegmentTree {
    int n;
    vector<long long> t;
    bool isSum;

public:
    SegmentTree(const vector<int>& v, bool sum) : n(v.size()), isSum(sum) {
        t.resize(2 * n, sum ? 0 : 1);
        for (int i = 0; i < n; ++i) {
            t[i + n] = v[i];
        }
        for (int i = n - 1; i > 0; --i) {
            t[i] = isSum ? (t[2 * i] + t[2 * i + 1]) % MOD : (t[2 * i] * t[2 * i + 1]) % MOD;
        }
    }

    long long query(int l, int r) {
        long long res = isSum ? 0 : 1;
        l += n;
        r += n;
        while (l < r) {
            if (l & 1) {
                res = isSum ? (res + t[l]) % MOD : (res * t[l]) % MOD;
                ++l;
            }
            if (r & 1) {
                --r;
                res = isSum ? (res + t[r]) % MOD : (res * t[r]) % MOD;
            }
            l /= 2;
            r /= 2;
        }
        return res;
    }
};

vector<long long> HardQueries(int n, const vector<int>& v, int q, const vector<vector<int>>& queries) {
    vector<long long> ans;
    SegmentTree sumTree(v, true);
    SegmentTree prodTree(v, false);

    for (const auto& x : queries) {
        int type = x[0], a = x[1] - 1, b = x[2];
        vector<int> indices;
        for (int i = a; i < n; i += b) {
            indices.push_back(i);
        }

        if (type == 0) {
            long long res = 0;
            for (int idx : indices) {
                res = (res + sumTree.query(idx, idx + 1)) % MOD;
            }
            ans.push_back(res);
        } else if (type == 1) {
            long long res = 1;
            for (int idx : indices) {
                res = (res * prodTree.query(idx, idx + 1)) % MOD;
            }
            ans.push_back(res);
        }
    }

    return ans;
}

queries and fruits✅

Company Name: Optum
Role: Software Engineer
Batch eligible: 2023 and 2024 grads

Apply: https://careers.unitedhealthgroup.com/job/21243748/software-engineer-hyderabad-in

Company Name: Zebra Technology
Role: Software Engineer 1
YOE: 0-2 years

Apply: https://zebra.eightfold.ai/careers/job?domain=zebra.com&pid=343623229683&domain=zebra.com

Company Name : UKG
Batch : 2024 passouts
Role : SDE Internship

Link : https://apply.ukg.com/careers/job?domain=ukg.com&pid=893379164769&domain=ukg.com&sort_by=relevance&job_index=0

Company Name : Meesho
Batch : 2024/2023 passouts
Role : SDE1

Link : https://docs.google.com/forms/d/e/1FAIpQLScESUZ3QSePda-W4tpRQh3jYgI5l5LqvdzscXosghfVTOgvNA/viewform?pli=1

Will be closed soon, fill asap.

Synopsys Internship
Batch - 2024,2025

Link - https://careers.synopsys.com/job/-/-/44408/70164146400?codes=OT

📌RSM Hiring !!
Role - Associate Engineer 1
Experience: 0 to 2 year

💻Apply Link:  https://rsm.wd1.myworkdayjobs.com/RSMCareers/job/Hyderabad/Associate-Engineer-1_JR109851

📢 Hiring Alert: Data Science Interns Wanted! (Offline, Full-Time, 3 Months)

Location - Indore

Seeking enthusiastic, data-driven individuals for a full-time, on-site internship lasting 3 months! This is a unique opportunity to dive into real-world data science projects, collaborate with industry experts, and build valuable skills in a hands-on environment. If you're ready to learn, innovate, and make a difference, we’d love to hear from you!

Note - To be considered for further process,
Mail your resume at ankush.deshmukh@artivatic.ai
mail subject / Title - internship_application
resume - internship_yourname.pdf

We're looking for talented B.Tech (CS/IT) & MCA graduates from the 2024/2025 batch to join our team. If you're ready to kickstart your tech career, apply by 20th November 2024 and become part of our innovation-driven culture! Please DM me if you are interested!

#Email- hr@venturesdigitalindia.com

Hello All,
       I am delighted to announce that We are currently hiring freshers with backgrounds in MTech Optical Engineering/ Applied Optics/ Optoelectronics and Optical Communication/ Laser and Electro-Optical Engineering, or Optics and Optoelectronics.
If you are interested, please share your resume with us at suganya.umameshwaran@vcti.io
Thank you,
Suganya

We’re #Hiring #Freshers! Join Our Dynamic Team! 🌟

Position: Trainee Software Engineer
Location: Hyderabad
Industry: IT Software
Job Type: Full-time

Role Overview:
We are looking for enthusiastic and motivated Freshers to join our dynamic team. If you are passionate about working with latest technologies, eager to learn, and excited to contribute to a vibrant team environment, this is the perfect opportunity for you!

Key Responsibilities:
Assist with day-to-day tasks and projects
Collaborate with cross-functional teams
Learn and adapt to [specific tools/technologies related to the role]
Contribute fresh ideas and solutions
Participate in training and development sessions to build your skills

Who We Are Looking For:

Recent graduates or individuals with less than 1 year of work experience
Strong communication and interpersonal skills
Eagerness to learn and adapt in a fast-paced environment
Proactive attitude and willingness to take initiative

Skills: Python, React JS, Node JS or any running/upcoming tech stack in the market

Why #AthenaGlobalTechnologiesLtd?
Opportunities for growth and career advancement
A supportive and inclusive work culture
Training and mentorship from experienced professionals

How to Apply:
Please submit your updated resume and a brief cover letter to praveen.pappu@athenagt.com & ramana.singh@athenagt.com

Qualcomm is hiring Associate Software Engineer

For 2023, 2024 grads
Location: Hyderabad

https://careers.qualcomm.com/careers/job/446702219357-engineer-hyderabad-telangana-india?domain=qualcomm.com

iOS Internship at Swipe (YC S21) - Onsite in Hyderabad

Stipend: ₹30K-₹45K per month
Location: Onsite - Hyderabad
Duration: 6 months
Pre-Placement Offer (PPO): Available, subject to performance

Eligibility: Complete the assignment
https://drive.google.com/file/d/1D7TbI6TUX3lDvb8VA-47zQw41wy6wAW9/view

import math
def solve(n, treasures):
    t = treasures
    s = sum(v for _, v in t)
    trg = math.ceil(s / 2)
    t.sort()
    c = 0
    m = float('inf')
    left = 0
    for right in range(n):
        c += t[right][1]
        while c >= trg:
            m = min(m, t[right][0] - t[left][0] + 1)
            c -= t[left][1]
            left += 1
    return m  

Teasure division

Asian Paints ✅

static boolean solve(int n, String s, String t) {
    int[] countS = new int[26];
    int[] countT = new int[26];

    for (int i = 0; i < n; i++) {
        countS[s.charAt(i) - 'a']++;
    }

    for (int i = 0; i < n; i++) {
        countT[t.charAt(i) - 'a']++;
    }

    for (int i = 0; i < 26; i++) {
        if (countS[i] != countT[i]) {
            return false;
        }
    }

    return true;
}

Perfect String ✅
Netcore

What are you learning these Days?

int getMaxBeauty(vector<int>&v){
    int n=v.size();
     sort(v.begin(), v.end());

    vector<int> a;
    int half=n/2;
    int i=0;int j=n-1;
    while(i<=j){
        if(i==j){
            a.push_back(v[i]);
            break;
        }
       
        a.push_back(v[j]);
         a.push_back(v[i]);
        i++;j--;
    }

 

    vector<int> preSum(n + 1, 0);
    for (int i = 1; i <= n; i++) {
        preSum[i] = preSum[i - 1] + a[i - 1];
    }

    long long sum=0;
    for(int i=1;i<=n;i++){
        if(i%2==1){
            sum+=preSum[i];
        }
        else{
            sum-=preSum[i];
        }
    }
   
    return sum;
}

IBM ✅