Need SAP Certified Freshers for Quints Global | Location: Okhla, New Delhi* 💥💥💥

Positions available:
1. SAP SD Management Trainee.
2. SAP FICO Management Trainee.
3. SAP MM Management Trainee.

Qualification: BCA/ MCA/ B Tech.

Date of Interview: 5th & 6th September

Venue: Quints Global Pvt. Ltd., 3rd Floor, 12 A Pride Tower, Near Kotak Mahindra, Sector- 125, Noida, Nearest Metro: Okhla Bird Sanctuary.

Apply, if interested!!

def solve(histogram):
    a = 0
    n = len(histogram)
    for i in range(n):
        m = histogram[i]
        for j in range(i, n):
            m = min(m, histogram[j])
            s = min(m, j - i + 1)
            w = s * s
            a = max(a, w)
    return a

Visa ✅

int webdev(int numProject,vector<int>projectId,vector<int>bid){
    vector<int>ans(numProject,INT_MAX);
    for(int i=0; i<projectId.size(); i++){
        ans[projectId[i]]=min(ans[projectId[i]], bid[i]);
    }
    int sum=0;
    for(auto x: ans){
        if(x!=INT_MAX)
        sum+=x;
        else
        return -1;
    }

American Express is hiring for multiple roles

For 2022, 2023 grads

https://www.linkedin.com/posts/satvik-jain-a939b4212_apply-to-team-amex-activity-7236473446245818368-beDQ?utm_source=share&utm_medium=member_android

Bungee Tech is hiring SDE intern

For 2024, 2025 grads
Location: Remote


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

Google Hiring SDE Winter Internship
Duration: 6 Months
Batch : 2025

Apply: https://www.google.com/about/careers/applications/jobs/results/76016493501784774

def solution(number):
    left = 0
    while left < len(number):
        right = left
        candidateNumb = number[left]
        while right < len(number) and number[right] == candidateNumb:
            right += 1
        if right - 1 > left:
            newNumber = number[left:right]
            newNumberList = [int(n) for n in newNumber]
            newNumberSum = sum(newNumberList)
            number = number[:left] + str(newNumberSum) + number[right:]
            if left > 0:
                left -= 1
        else:
            left += 1
    return number

Visa ✅

int cardsDeck(int N, vector<int>& A) {
    vector<pair<int, int>> v(N);
    for (int i = 0; i < N; i++) v[i] = {A[i], i};
    sort(v.rbegin(), v.rend());
    
    vector<bool> used(N);
    int res = 0, cur = 0;
    for (auto [val, idx] : v) {
        if (!used[idx]) {
            used[idx] = true;
            res = max(res, ++cur);
        }
        if (cur + (N - idx - 1) <= res) break;
    }
    return res;
}

Cards Deck
Grow(FTE) ✅