Happy Krishna Janmashtami everyone ✨✨❤️❤️

Attention aspiring Data scientist/Data Engineer

Batch : 2021/2022/2023/2024

Celebal Technologies (Microsoft gold AI partner ) is hiring Data Scientist and Data Engineer.

Mode of Hiring: Hire, Train and Deploy.

You would be given rigorous training by Authorised Hiring Partner, if shortlisted.

Apply Now: https://lnkd.in/diTKXdW5

Company Name: Altair

Role: SDE

Batch eligible: 2022 and 2023 grads

Apply: https://phh.tbe.taleo.net/phh01/ats/careers/v2/viewRequisition?org=ALTAENGI&cws=39&rid=44326

📌Phonepe is Hiring !! 

Role: Site Reliability Engineer

Experience: 0-1 year

Expected CTC: 12-20 Lpa

Location: Bangalore

Apply here- https://boards.greenhouse.io/embed/job_app?token=5696981003&source=LinkedIn

def maxProfit(costPerCut, salePrice, lengths):
    max_profit = 0

    for sale_length in range(1, max(lengths) + 1):
        sale_price_per_rod = salePrice * sale_length
        profit = 0

        for rod_length in lengths:
            uniform_rods = rod_length // sale_length

            if uniform_rods > 0:
                extra_cut = 1 if rod_length % sale_length > 0 else 0
                total_cuts = uniform_rods - 1 + extra_cut

                costs = total_cuts * costPerCut
                revenues = uniform_rods * sale_price_per_rod

                if revenues > costs:
                    profit += revenues - costs

        if profit > max_profit:
            max_profit = profit

    return max_profit

Cutting Metal Surplus ✅

int findmaxPath(int root, int &ans, vector<int> &parent, vector<int> &values, vector<bool> &computed){
    if(computed[root]) return values[root];
    if(parent[root]==-1) {
         computed[root]=true;
    }
    else{
        computed[root]=true;
        int parentpath = findmaxPath(parent[root], ans, parent, values, computed);
        values[root] = max(parentpath+values[root], values[root]);
    }
    ans = max(ans, values[root]);
    return values[root];
}

int bestSumDownwardTreePath(vector<int> parent, vector<int> values) {
    int n=parent.size();
    int ans = values[0];
    vector<bool> computed(n, false);
    for(int i=0; i<n; i++){
        if(computed[i]) continue;
        findmaxPath(i, ans, parent, values, computed);
    }
    return ans;
}
Best Sum Any Tree Path ✅
(Nvidia )