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) ✅

def findMinimumIdleness(s, k):
    def ci(t):
        m, c = 0, 1
        for i in range(1, len(t)):
            if t[i] == t[i-1]:
                c += 1
            else:
                m = max(m, c)
                c = 1
        return max(m, c)

    def dfs(t, r):
        if r == 0:
            return ci(t)
        m = ci(t)
        for i in range(len(t)):
            m = min(m, dfs(t[:i] + ('b' if t[i] == 'a' else 'a') + t[i+1:], r - 1))
        return m

    return dfs(s, k)

LinkedIn(FTE) ✅

vector<int> findCompletePrefixes(vector<string> names, vector<string> queries){
    vector<int> res;
   
    for(string q : queries){
        int count = 0;
        for(string s : names){
            if(s.size() >= q.size() + 1 && s.compare(0, q.size(), q) == 0){
                count++;
            }
        }
        res.push_back(count);
    }
    return res;
}

Amdocs ✅

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

void f(vector<int> &A, vector<int> &B) {
    vector<int> c(B.size(), -1);
    vector<int> preSum(A.size(), 0);
   
    preSum[0] = A[0];
    for(int i = 1; i < A.size(); i++) {
        preSum[i] = preSum[i-1] + A[i];
    }

    for(int i = 0; i < B.size(); i++) {
        int val = B[i];
        int x = val / preSum[A.size() - 1];
        int y = val % preSum[A.size() - 1];

        if (y == 0) {
            c[i] = x * A.size();
            continue;
        }

        int cnt = 0;
        for(int j = 0; j < A.size(); j++) {
            if (A[j] >= y) {
                cnt = j + 1;
                break;
            }
        }

        int res = (x * A.size()) + cnt;
        if (res > 0) {
            c[i] = res;
        }
    }

    for(auto x : c) {
        cout << x << " ";
    }
}

int main() {
    vector<int> A{7, -15, 19, -15, -11, 17, 5};
    vector<int> B{6, 30, -17, 12};

    f(A, B);
    return 0;
}

Read Books nckd ✅