Stecktra Technologies Pvt. Ltd. is currently #hiring the #freshers for the position of Microsoft SOC Analyst (L1 level). Know anyone who might be interested?

Qualification: B.Tech/BE (strictly) (2025 pass outs are not eligible for this opportunity )

Interested candidates are kindly requested to share their updated resumes at nisha.das@stecktra.com

Desired Certifications: CEH, AZ-900

This entry-level position is open to freshers who possess a strong understanding of Azure cloud services and passion for cybersecurity.

Looking forward to your applications!

Company Name: Groww

🛄 Job Title: SDE Intern


✍🏻 YOE: 2024 and 2025 grads


➡️ Apply: https://docs.google.com/forms/d/e/1FAIpQLSdq_LbiY3BIZDZ_fCh8Ba59W08fSqFk_jEPjtiGDGgJ-SOi6w/viewform

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

Company Name: Zupee

🛄 Job Title: SDE 1 (Backend)

✍🏻 YOE: 2022 and 2023 grads

➡️ Apply: https://www.linkedin.com/jobs/view/3955626028

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

Scalex is looking for a motivated Java Developer (Fresher). Proficiency in Java programming language and Spring Boot framework. Solid understanding of SQL and relational database concepts. Experience working with MongoDB or other NoSQL databases. rupalig@scalextechnologies.com

Myntra Off Campus Drive for Experience 2024 Hiring Phoenix Intern – Software Engineer I

https://boards.greenhouse.io/myntra/jobs/7491965002?gh_src=bb272d8c2

Was getting queries on this, yes even as students you can deploy your projects on Google Cloud ⬇️

If you work or want to work on Google Cloud, they are offering 300 USD free for all for a limited period of time, so go ahead and grab the same  asap.

Link here : https://ad.doubleclick.net/ddm/trackclk/N5295.4347315TECHGIG/B28999036.394199262;dc_trk_aid=585472451;dc_trk_cid=183313769;dc_lat=;dc_rdid=;tag_for_child_directed_treatment=;tfua=;ltd=;dc_tdv=1

This is officially by Google Cloud and you can run,test and deploy on GCP free for 300 USD 🫡

Register for Hackathon DevX JMI - https://unstop.com/hackathons/devx-jmi-jamia-millia-islamia-1055794?lb=Uy5zoiXM&utm_medium=Share&utm_source=shortUrl

A good opportunity to build some good projects for your resume!

class UserMainCode(object):
    @classmethod
    def theLastChocolate(cls, input1, input2):
        dp = [[0] * (input1 + 1) for _ in range(input1 + 1)]
        dp[1][1] = 1
       
        for i in range(2, input1 + 1):
            for j in range(1, i + 1):
                dp[i][j] += dp[i - 1][j - 1] if j - 1 >= 1 else 0
                dp[i][j] += dp[i - 1][j] if j <= i - 1 else 0
       
        return dp[input1][input2]. 

//   Amazon ml  THE LAST Chocolate

int gcd(int a, int b) {
    while (b != 0) {
        int t = b;
        b = a % b;
        a = t;
    }
    return a;
}

int calculatesun(int input1, int input2[]) {
    // Read only region end
    int N = input1;
    int max_so_far = input2[0];
   
    for (int i = 0; i < N; ++i) {
        max_so_far = std::max(max_so_far, input2[i]);
        input2[i] = gcd(input2[i], max_so_far);
    }
   
    std::sort(input2, input2 + N);
   
    int sum = 0;
    for (int i = 0; i < N / 2; ++i) {
        sum += gcd(input2[i], input2[N - 1 - i]);
    }
   
    return sum;
}

Sum in Array ✅
Amazon ML