vector<vector<int>> precompute_extra_time(const string &s) {
    int n = s.length();
    vector<vector<int>> extra_time(n, vector<int>(n, 0));

    for (int i = 0; i < n; i++) {
        vector<int> freq(26, 0);
        for (int j = i; j < n; j++) {
            freq[s[j] - 'a']++;
            int pairs = 0;
            for (int f : freq) if (f > 1) pairs += (f * (f - 1)) / 2;
            extra_time[i][j] = pairs;
        }
    }

    return extra_time;
}

int getMinTotalExtraTime(string s, int k) {
    int n = s.length();
    vector<vector<int>> extra_time = precompute_extra_time(s);
   
    vector<int> dp(n + 1, INT_MAX);
    dp[0] = 0;

    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < i; j++) {
            dp[i] = min(dp[i], dp[j] + extra_time[j][i - 1] + k);
        }
    }

    return dp[n] - k;
}

DE Shaw ✅

https://www.naukri.com/job-listings-it-intern-leuwint-technologies-palakkad-0-to-1-years-110924906843?src=cluster&sid=17260519887449949_2&xp=6&px=1&nignbevent_src=jobsearchDeskGNB

Leuwint Technologies Hiring IT Intern

Completed a degree in Computer Science, Software Engineering, or a related field.(2022- 2024 pass out)
Proficiency in at least one programming language, such as Java, Python, C++, JavaScript, or similar.
Familiarity with web development (HTML, CSS, JavaScript) or mobile app development (iOS, Android) is a plus.
Ability to work collaboratively in a team environment.

Company Name : Autodesk

Batches : 2025,2026 passouts

Internship and Apprenticeship Program details

Register here : https://forms.office.com/pages/responsepage.aspx?id=nve_Z5F_M0So5cklLS3cHfVqUB1IYMFAl5HYFnwntqJURjIyRzJWMVhMMFNQVjdEUE1YS0JFQk02MC4u&origin=QRCode&route=shorturl

Company Name : DE Shaw and Group
Batch : 2024 passouts eligible
CTC : 33-35 LPA

Link :
AQAE/QAE: https://www.deshawindia.com/careers/associate-qae-qte-fte-off-campus-2024-grads-5482
SDE: https://www.deshawindia.com/careers/all-positions-in-software-development-2614

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

Scientific Software Developer_ Job Application Form

https://www.linkedin.com/jobs/view/4021738027/

Kaspro Solutions Hiring Software Engineer Intern

https://www.linkedin.com/jobs/view/4021735210/

SWIL Hiring MERN Intern

https://www.linkedin.com/jobs/view/4020399900/

Appinventiv Hiring Software Engineer Intern

Currently pursuing a degree in Computer Science, Engineering, or a related field.
Familiarity with programming languages such as Java, Python, C++, or JavaScript.
Basic understanding of software development principles and methodologies.
Strong problem-solving skills and attention to detail.
Ability to work collaboratively in a team environment.
Excellent communication skills and a proactive attitude.

https://wellfound.com/l/2zwMTy

Oriserve hiring Intern Frontend Engineer

Internship Duration - 6 Months to 1 Year
Location - Noida, Work from Office

Previous experience working as a React.js Intern.
A solid grounding in Computer Science fundamentals (based on a BE/BTech or MS inc Information Technologies/Computer Science)
Strong proficiency with JavaScript and ES6.
Strong understanding of web markup, including HTML5, CSS3.
Proficient understanding of React & Redux and also having familiarity with RESTful APIs & Git.

📌Multiple Openings for Freshers/ Experienced

1. Business Analyst (freshers)

2. Business development Executive (freshers)

3. Flutter developer (0-3 years experience)

4. Front office executive (fresher)

5. MERN Stack Developer (1-3 years experience)

6. Full stack developer Laravel, PHP Frameworks (0-3 years experience)

Share Your Resume To:
hr@m8itsolutions.com
Contact: +91 9344660083

📌Hiring for a Backend + Content Intern at Proelevate.

Prime responsibilities include backend and strong hold over core CS Subjects.

✨Remote Opportunity

Eligibility : 2025,2026 passouts

Apply Link & Details: https://www.proelevate.in/job/backend-developer-proelevate-609847

📌Cencora is hiring for SDE

For 2022, 2023, 2024 grads
Experience: 0 - 2 years

Location: Pune

💻Apply:
https://careers.cencora.com/us/en/job/CHKCENUSR249350EXTERNALENUS/Software-Engineer

ScaleneWorks hiring Associate Software Engineer

0-1 year experience

Apply Here : https://www.hirewand.com/r/job/110535987?sid=60488d09f4186b6923717b20&cpid=1105&uid=null&src=jobpost

Meesho hiring for Business Analyst

0-1 year experience

Apply Here : https://www.meesho.io/jobs/business-analyst---2024?id=a33be922-bd1f-41de-b865-6198f1f50ac6

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

bool canRobAll(const vector<int>& houses, int H, int K) {
    int hours_needed = 0;
    for (int house_count : houses) {
        hours_needed += (house_count + K - 1) / K; // Ceiling division
    }
    return hours_needed <= H;
}

int main() {
    int N, H;
    cin >> N >> H;
   
    vector<int> A(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
   
    int left = 1;
    int right = *max_element(A.begin(), A.end());
   
    while (left < right) {
        int mid = left + (right - left) / 2;
        if (canRobAll(A, H, mid)) {
            right = mid;
        } else {
            left = mid + 1;
        }
    }
   
    cout << left << endl;
   
    return 0;
}

//Richies World
Flipkart ✅

int countOverlappingPairs(vector<pair<int, int>>& ranges) {
    // Sort ranges by their left boundary
    sort(ranges.begin(), ranges.end());
   
    int n = ranges.size();
    int count = 0;
   
    // Check for overlap between adjacent ranges
    for (int i = 0; i < n - 1; ++i) {
        // If the end of the current range is greater than the start of the next range
        if (ranges[i].second >= ranges[i + 1].first) {
            count++;
        }
    }
   
    return count;
}

Secure the kingdom ✅

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

double solve(vector<int> &a, vector<int> &b)
{
    int N = a.size();
   
   vector<double>temp;
    for(int i=0;i<N;i++){
         temp.push_back((double)a[i]/94.0);

    }
   vector<int>temp1;
   for(int i=1;i<N;i++){
       temp1.push_back(b[i]-b[i-1]);
   }
   double sum=0;
    for(int i=0;i<temp1.size();i++){
         sum+=temp1[i]/temp[i+1];
    }
    return sum/temp1.size();


}


int32_t main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<int>b(n);
    for(int i=0;i<n;i++){
        cin>>b[i];
    }
   double ans = solve(a,b);
    cout << fixed << setprecision(2);
    cout << ans << endl;
    return 0;
}
//Bob has petrol car

Flipkart ✅