❗️EcoEnergy Insights Off Campus Drive 2024 Hiring AS Project Engineer | INR 3 LPA❗️

👨‍💻Job Role : Project Engineer
🎓Qualification : B.E/B.Tech
🎖Batch : 2023
💰Package : INR 3 LPA

⭕️ Apply Fast :   

https://mycareernet.in/mycareernet/challenges/Ecoenergy-Project-Engineer-155

Company – Druva
Role –  Technical Support Team
Qualification – Any Graduate
Experience - Freshers
Location –  Across India
Salary – 7.5 LPA - 19 LPA

Link - https://www.druva.com/about/careers/jobs/7109712002?gh_jid=7109712002

Company Name : Google
Role : Data Scientist

Batch : 2024 passouts M.Tech/MS Students only

Link : https://www.google.com/about/careers/applications/jobs/results/82920494979785414-data-scientist/

Looking for an SDET(QA) Intern for HSR Layout

Technical Requirements:

Sound understanding of the Phases of SDLC,
Hands on with any of the one coding language(Python /Java etc )
API validation & automation
Good to have but not mandatory: Selenium, Appium

2. Non-technical Requirements:
Mode: Work from Office (5days/week)
Base Location: Bangalore based / willing to relocate to Bangalore
Qualification: Freshers or final year students 2024 B Tech / BE / MCA / Equivalent

SDET Interview process:
1- Offline assessment test: 40 mins (aptitude & coding basics)
2- F-2-F Interview: 1 Hr - (Logical thinking & Coding)

Interested candidates please share your resume to Sreekanth.nair@mfine.co

Juppiter Ai Labs looking for Technical PM full Time Intern
Position : PM technical
Location : Remote
Salary : 10 to 12k
Working Hours: 8 hrs
If you are interested plz share your resume on aishwarya@juppiterailabs.com

int maxDepth(TreeNode* root) {
        if(!root)   return 0;
        int l=1+maxDepth(root->left);
        int r=1+maxDepth(root->right);
       return max(l,r);
    }

Infibeam height of tree ✅

Company Name: McAfee

🛄 Job Title: SDET

✍🏻 YOE: 0-1 years


➡️ Apply: https://careers.mcafee.com/global/en/job/MCAFGLOBALJR0030993ENGLOBALEXTERNAL/Software-Development-Engineer-in-Test-Remote

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

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

int solve(vector<int>& t, int i) {
    if(i >= t.size()) return 0;
    int l = solve(t, 2*i + 1);
    t[i] += l;
    int r = solve(t, 2*i + 2);
    return t[i] + r;
}

void print(vector<int>& t, int i) {
    if(i >= t.size()) return;
    print(t, 2*i + 1);
    cout << t[i] << "\n";
    print(t, 2*i + 2);
}

int main() {
    string s;
    getline(cin, s);
    stringstream ss(s);
    vector<int> t;
    int n;
    while(ss >> n) {
        t.push_back(n);
    }
    solve(t, 0);
    print(t, 0);
    return 0;
}

Replace node value with sum of self and left subtree ✅