Teksun Hiring Firmware Engineer

https://career.teksun.com/jobs/embedded-firmware-engineer-microcontroller-fresher

Company - Amazon

Role - Graduate Analyst

Batch - 2024/2023/2022/2021

Location - Pune

https://grow.almabetter.com/auth/signup?utm_source=shareearn&utm_content=job_board&redirectTo=https%3A%2F%2Fgrow.almabetter.com%2Fjob-board%2F8225ad27-3b4a-4303-bf8e-499208f36de7&referralCode=6GL9EW

Company Name : Western Digital
Role : Software Engineer
Batch : 2024 passouts

Link : https://jobs.smartrecruiters.com/WesternDigital/743999978560376-engineer-software-development-engineering-apps-be-2024-pass

Full Stack Developer intern At Orangewood

Batch :2024/2025

https://orangewood.keka.com/careers/jobdetails/39183

int solve(vector<int> sec_values, string s){
    vector<int> aux;
    for(char &c: s)
        aux.push_back(sec_values[c-'a']);
    sort(aux.begin(), aux.end());
    int sum = 0;
    for(int i=0; i<aux.size()-1; i++)
        sum+= abs(aux[i+1]-aux[i]);
    return sum;
}

Security Values✅
Adobeshecodes

Counting analogues Array c++ ✅
Adobeshecodes

🌟 Alight is Hiring for 2024! 🌟

🙌 Role: Financial Analyst I

📍 Job Location: Gurgaon, Haryana

🔍 Experience: 0 - 2 years

🎓 Qualification: B.Com, M.Com, BBA, MBA, CA/CS/ICWA

🔗 Link- https://careers.alight.com/us/en/job/ALIGUSR28009EXTERNALENUS/Financial-Analyst-I


All the best 👍👍

def squaredSum(arr):
    max_sum = float('-inf')
    current_sum = 0
    for num in arr:
        current_sum = max(0, current_sum + num) 
        max_sum = max(max_sum, current_sum ** 2)
    return max_sum

Squared Sum ✅

long maxSpanRelation(int idx, vector<int>& arr1, long mini, vector<int>& arr2, long sum, int k, vector<vector<long>>& dp) {
    if(idx == arr1.size()) {
        if(k == 0) {
            return mini * sum;
        }
        return 0;
    }
   
    if(dp[idx][k] != -1) return dp[idx][k];
   
    long pick = maxSpanRelation(idx + 1, arr1, min(mini, (long)arr1[idx]), arr2, sum + arr2[idx], k - 1, dp);
    long notPick = maxSpanRelation(idx + 1, arr1, mini, arr2, sum, k, dp);
   
    return dp[idx][k] = max(pick, notPick);
}

long getMaxSpanRelation(vector<int>& arr1, vector<int>& arr2, int k) {
    int n = arr1.size();
    vector<vector<long>> dp(n, vector<long>(k + 1, -1));
   
    return maxSpanRelation(0, arr1, 5001, arr2, 0, k, dp);
}

int main() {
    vector<int> arr1 = {1, 2, 3};
    vector<int> arr2 = {4, 5, 6};
    int k = 2;
   
    cout << getMaxSpanRelation(arr1, arr2, k) << endl;
   
    return 0;
}

Maximum Span Relation ✅