string shift(string s) {
    string minStr = s;
    for(int i=0; i<s.size(); i++) {
        s = s.substr(1) + s[0];
        if(s < minStr) {
            minStr = s;
        }
    }
    return minStr;
}

int solve(vector<int> a) {
    map<string, int> m;
    for(int i=0; i<a.size(); i++) {
        string s = to_string(a[i]);
        string minStr = shift(s);
        m[minStr]++;
    }
    int count = 0;
    for(auto it=m.begin(); it!=m.end(); it++) {
        int n = it->second;
        count += (n*(n-1))/2;
    }
    return count;
}

Autodesk ✅

Company: Hexagon

Role: Applications Engineer Intern

Expected CTC: 22K (Est)

Batch Eligible: 2022-2024

Website: https://myhr-hexagonmi.my.salesforce-sites.com/recruit/fRecruit__ApplyJob?vacancyNo=VN4383

Company: GlobalLogic

Role: Trainee Software Engineer/ Software Engineer

Expected CTC: 8.3 - 12 LPA

Batch Eligible: 2023

Website: https://docs.google.com/forms/d/e/1FAIpQLSdCi5VF6nb-eWvp6aHNhRFZKF232-EyvyaFIl9XHvd0AmSdBg/viewform

ServiceNow Women Code to Win 2024 - India by ServiceNow! // Unstop (formerly Dare2Compete)
https://unstop.com/competitions/servicenow-women-code-to-win-2024-india-servicenow-838054

Company: Sportskeeda

Role: Social Media Intern - WFH

Expected CTC: 3 - 8 LPA

Batch Eligible: Any

Website: https://sportskeeda.zohorecruit.in/jobs/Careers/59509000015968895/Social-Media-Intern-US-Sports

Company: Amazon

Role: Associate Quality Services

Expected CTC: 3.5 to 5.5 LPA

Batch Eligible: Any

Website: https://amazonvirtualhiring.hirepro.in/registration/incta/ju0f4/apply/?j=56434&e=12271

vector<string> solve(vector<string> s, vector<string> a) {
    vector<string> r;
    for (auto& song : s) {
        string sn;
        int sl;
        istringstream ss(song);
        getline(ss, sn, ':');
        ss >> sl;

        for (auto& anim : a) {
            string an;
            int al;
            istringstream as(anim);
            getline(as, an, '/');
            as >> al;

            if (sl % al == 0) {
                r.push_back(an + ":" + to_string(sl / al));
                break;
            }
        }
    }
    return r;
}

Tradedesk ✅

import java.util.*;
public class Main {
    public int solution(int[] A, int X, int Y) {
        if (A == null || A.length < 1) return 0;
        Arrays.sort(A);
        int r = Integer.MAX_VALUE;
        for (int i = 0, j = 0, left = 0, right = 0;;) {
            for (; j < A.length - i && (left + A[j]) <= right; left += A[j++])
            ;
            r = Math.min(r, X * Math.max(A.length - j - i, 0) + Y * i);
            if (++i > A.length) break;
            right += A[A.length - i];
           
        }
        return r;
    }

Tradedesk ✅

GD & INTERVIEW MAILS FROM IBM

void solve(vector<ll> a,ll l ,ll r){
   set<pair<ll,ll>>s;
   map<ll,ll>m;
   ll i=0;
   ll ans=INT_MAX;
   for(auto x:a){
      
       if(x<l || x>r){
           i++;
           continue;
       }
       else{
           if(m.find(x)==m.end()){
               m[x]=i;
               s.insert({i,x});
           }
           else{
               s.erase({m[x],x});
               s.insert({i,x});
               m[x]=i;
           }
       }
       //cout<<i<<" "<<m.size()<<endl;
       if(m.size()==r-l+1){
           auto it=s.begin();
         
           ans=min(ans,i-(*s.begin()).first+1);
       }
       i++;
   }
   cout<<(ans==INT_MAX?-1:ans)<<endl;
}

Tradedesk ✅

Llyod Hiring fresher !

Role - Data Analyst

Exp CTC - 10 lpa

Key Skills - Python, SQL, Java, Scala or Go

Link - https://amslbg.avature.net/careers/JobDetail/Hyderabad-Telangana-India-Data-Analyst/4345

def getMaximumLength(lotteryID, winnerID, k):
    m, n = len(lotteryID), len(winnerID)

    dp = [[[0] * n for _ in range(m)] for _ in range(k + 1)]

    for o in range(k + 1):
        for i in range(m):
            for j in range(n):
                c1, c2 = lotteryID[i], winnerID[j]
                abs_diff = abs(ord(c1) - ord(c2))
                diff = (26 - abs_diff if abs_diff > 13 else abs_diff)
               
                if o > 0:
                    dp[o][i][j] = max(dp[o][i][j], dp[o - 1][i][j])
                if i > 0:
                    dp[o][i][j] = max(dp[o][i][j], dp[o][i - 1][j])
                if j > 0:
                    dp[o][i][j] = max(dp[o][i][j], dp[o][i][j - 1])
                if o - diff >= 0:
                    if i > 0 and j > 0:
                        dp[o][i][j] = max(dp[o][i][j], dp[o - diff][i - 1][j - 1] + 1)
                    else:
                        dp[o][i][j] = 1 # if i or j==0 and it is possible to use a move then string can only match 1 char

    return dp[k][m - 1][n - 1]

Source : Winner ✅

Company Name: Cashfree Payments

Role: Technical Solution Engineer -1 

Eligibility: those who are good in communication and proficient in Java, SQL having atleast 6 months of internship experience.

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

Company Name: Airbus

Role: Data Analyst Intern

Batch eligible: 2024 and 2025 grads

Apply: https://ag.wd3.myworkdayjobs.com/en-US/Airbus/job/Bangalore-Area/Intern_JR10240511

Company Name: Zennode Technologies

Role: Junior Software Engineer

Batch eligible: 2022 and 2023 grads

Apply: https://www.zennode.com/jobs/junior-software-developer/