#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
int solve(const string& str) {
    vector<char> vowels = {'a', 'e', 'i', 'o', 'u'};
    const int a = 10;
        vector<int> freq(26, 0);
    for (char c : str) {
        freq[c - 'a']++;
    }
    
    int n = str.size();
    int minCost = INT_MAX;
        for (char target : vowels) {
        int cost = 0;
        for (int i = 0; i < 26; ++i) {
            char c = 'a' + i;
            if (c == target) continue; 
            if (freq[i] > 0) {
                if (find(vowels.begin(), vowels.end(), c) != vowels.end()) {
                    cost += freq[i] * abs(c - target);
                } else {
                    cost += freq[i] * a;
                }
            }
        }
        minCost = min(minCost, cost);
    }
        for (char c : str) {
        if (find(vowels.begin(), vowels.end(), c) == vowels.end()) {
            return minCost; 
        }
    }
    
    return -1; 
}

int main() {
    string str;
    cin >> str;
    
    cout << solve(str) << endl;
    
    return 0;
}

Minimum Cost String ✅

#include <bits/stdc++.h>
using namespace std;
int solve(int N, const vector<int>& A) {
    if (N == 0) return 0;
    vector<int> dp(N, 0);
    for (int i = 0; i < N; ++i) {
        int a = A[i];
        int b = A[i];
                for (int j = i; j >= 0; --j) {
            a = min(a, A[j]);
            b = max(b, A[j]);
            int c = b - a;
            if (j > 0) {
                dp[i] = max(dp[i], dp[j - 1] + c);
            } else {
                dp[i] = max(dp[i], c);
            }
        }
    }
    
    return dp[N - 1];
}

Suit Up ✅

long getPairs(int x, vector<int> cost) {
    unordered_map<long, long> mp;
    long count = 0;

    for (int c : cost) {
        long rem = c % x;
        long comp = (x - rem) % x;
        count += mp[comp];
        mp[rem]++;
    }

    return count;
}

Amazon ✅

Congratulations Gargi All the best for the future 🍾

How many of you have received test or interview links for Google FTE/Internship, Morgan Stanley, Goldman Sachs, Atlan or DE Shaw?

Freshers hiring Opportunity at Vipul Trade Enter , Gurgaon

Send resume to : Pratibha@capitalplacementservices.com

Phn No : 8595665108

Send Your Resume Here
jobs@aimleap.com

https://accuknox.zohorecruit.in/jobs/Careers/88774000007273253/Django-Trainee?source=CareerSite

AccuKnox Hiring Django Trainee

https://jobs.amdocs.com/careers/job?pid=563430997179688&domain=amdocs.com

Amdocs Hiring Java Developer- Fresh Graduate (Year 2023 & 2024 Graduates only)

•    Bachelor's degree in Science/IT/Computer Science or equivalent
•    0-11 months work experience in Core Java (OMS, CRM, ARIC). With basic knowledge in Python, SQL, UNIX, Linux, Shell/ Perl scripting.
•    Open to Fresh Graduates (Year 2023 and 2024 only).
•    Local hiring only: Not open to Expat hiring.
•    Willing to work on a Dayshift, Hybrid set- up (Work from home + 3x per week work on site in BGC or in Ortigas).
•    With background and understanding in Software Development Life Cycle.
•    With knowledge in Cloud computing (AWS, Azure)- good-to-have.

Why you will love this job:
•    You will be challenged to design and develop new software applications.
•    You will have the opportunity to work in a growing organization, with ever growing opportunities for personal growth.

https://jobs.eu.lever.co/payu/ee2691f3-64c7-4251-9284-e91aa40b2932/apply?utm_source=Data_Internship_unstop&utm_medium=listing&utm_campaign=unstop

PayU Hiring Data Intern

https://www.naukri.com/job-listings-java-developer-fable-fintech-pvt-ltd-mumbai-0-to-5-years-130924022893?src=cluster&sid=1726473982209105_5&xp=15&px=4&nignbevent_src=jobsearchDeskGNB

Fable Fintech hiring java Developer

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

TechSopi Global Hiring Java Full Stack

We are looking for a motivated Java Developer to join our growing team and contribute to exciting projects.


Job role - Java FullStack Developer
Experience - Minimum 6 Months
Skills - Core Java, spring, springboot, Angular
Qualification - BCA/ MCA/ B.Tech (CS/ IT)
Passout Year - From 2021 year onwards
Job Type - Full Time
Work Mode - Work from Office (5 Days a week)
Location - Banipark (Jaipur)


If you are excited about this opportunity and meet the qualifications, please send your resume to diksha.khandelwal@techsopi.com