𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Company Name: Yugabyte
Role: Software Engineer Intern
Batch eligible: 2025 grads only

Apply: https://job-boards.greenhouse.io/yugabyte/jobs/4389419006?gh_src=ce944bbf6us

430 views15:53

Company Name : Razorpay
Roles : Analytics Specialist
Skillset : Python and SQL

For 2023, 2022, 2021

https://docs.google.com/forms/d/e/1FAIpQLSfURE9kIPyUB6BD-K0pT6KbqPy2xJXnLEYonHvn7l7ZbTZfFA/viewform

402 views15:53

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

McAfee is hiring SDET

For 2021 grads
Location: Remote

https://careers.mcafee.com/global/en/job/MCAFGLOBALJR0031208ENGLOBALEXTERNAL/SDET-Remote?s=08

510 views15:54

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

ByteRaven is hiring for SDE - 1 (Entry Level)
Apply here:
https://linkedin.com/jobs/view/3986850819/?alternateChannel=search

497 views15:56

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Xempla is hiring for Software Engineer
Apply here:
https://linkedin.com/jobs/view/3977715818/

Xempla - Decision Support System for Enterprise Asset Management hiring Software Engineer in Greater Kolkata Area | LinkedIn

Posted 9:52:19 AM. Position: Software Development Engineer - I, Back-endLocation:Kolkata(In-office)Type:Full-TimeCTC-…See this and similar jobs on LinkedIn.

391 views15:57

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Hiring for the position of Technical Support Engineer:

Experience: 0 to 2years
Location: Bangalore
Notice Period: Immediate

Mandatory skills required:
· Should have attended regular school/college with 10+2+3 as a minimum qualification in any stream of subject.
· Good understanding of computer systems, mobile devices, and other tech products.
. Excellent Communication

Job Description: Technical Support Engineer

Roles:

Provides level 1 technical support to end users on computer-related technical problems to assigned accounts/ customers through voice support.

Essential Job Functions:
· Taking ownership of customer issues reported and responding to customer inquiries to ensure customer needs are met.
·Assists customers in resolving technical problems by providing guidance regarding software/hardware/application issues etc.
·Researching, diagnosing, troubleshooting, and identifying solutions to resolve system issues and/or refer more complex technical problems through a defined escalation process.
·Identifies, evaluates, and prioritizes customer problems and complaints to ensure that inquiries are resolved appropriately.

Basic Qualifications

·Ability to diagnose and troubleshoot basic technical issues.
· Fresher or has work experience as a Technical Support Engineer, Desktop Support Engineer, IT Help Desk Technician, or similar role.
· Ability to provide step-by-step technical help, both written and verbal.
·Experience with solving computer-related problems.
·Experience working with company escalation policy.

Requirements and Skills
·Interpersonal skills to interact with customers and team members.
·Excellent problem-solving and communication skills with fluent spoken English and good thought flow.
·Organization skills to balance and prioritize work.
·Ability to work in a team environment.

Please drop the CV on ramya.cr@dxc.com

497 views15:59

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Company Name : Stable Money
Role : SDE Intern ( Frontend and Backend) - 6M
Batch : 2024/2025 passouts

Link : https://docs.google.com/forms/d/e/1FAIpQLSeEq0y09dG2oRZOgUPrbvM-iqaU9c6NTN_Myv-uUmc_RUwSkQ/viewform

❤6👍2

477 views16:11

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Please try to react on the post in case you are applying, it will hardly take your 10 secs but enough to motivate me to share more and more opportunities everyday without fail:)

Just one favour if you can❤️

❤5👍3

529 views16:12

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Company Name: Curefit
Role: Test Engineer (QA)
Batch eligible: Only 2024 grads

Apply: https://www.linkedin.com/jobs/view/3986862709

👍4

508 views16:27

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Company name: The Trade Desk
Role: Software Engineering Intern (2025 Summer Internship)
Batch: 2026 passouts
Internship Duration: 12 weeks
Location: Bangalore

Apply Link: https://boards.greenhouse.io/thetradedesk/jobs/4435073007?gh_src=1c01b2067us

Do share with your Juniors too

482 views16:36

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

652 views17:11

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Photo

#include <vector>
#include <string>
#include <set>

class DSU {
public:
    std::vector<int> parent, size;

    DSU(int n) {
        parent.resize(n + 1);
        size.resize(n + 1, 1);
        for (int i = 1; i <= n; i++) {
            parent[i] = i;
        }
    }

    int find(int x) {
        if (x == parent[x]) {
            return x;
        }
        return parent[x] = find(parent[x]);
    }

    void merge(int x, int y) {
        int rootX = find(x);
        int rootY = find(y);
        if (rootX != rootY) {
            if (size[rootX] < size[rootY]) {
                std::swap(rootX, rootY);
            }
            parent[rootY] = rootX;
            size[rootX] += size[rootY];
        }
    }
};

vector<int> getTheGroups(int n, std::vector<std::string>& queryType, std::vector<int>& student1, std::vector<int>& student2) {
    DSU dsu(n + 1);
    std::vector<int> ans;

    for (int i = 0; i < n; i++) {
        if (queryType[i] == "Friend") {
            dsu.merge(student1[i], student2[i]);
        } else {
            int root1 = dsu.find(student1[i]);
            int root2 = dsu.find(student2[i]);
            ans.push_back(dsu.size[root1] + dsu.size[root2] - (root1 == root2 ? 1 : 0));
        }
    }

    return ans;
}

Get the groups✅

❤1👍1

735 views17:11

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Company Name: Rupeek
Role: SDE 1

Batch eligible: 2022 and 2023 grads

Apply: https://docs.google.com/forms/d/e/1FAIpQLSc0BQZHyLQWFyo0CMIaW4BRBAOokSFNGGyBvKlJV2_3-H4v_Q/viewform

463 views17:12

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

def solution(arr):
    return all(arr[i] == arr[~i] for i in range(len(arr) // 2))

👍1

675 views17:13

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

def solution(n, t, edges):
    graph = [[] for _ in range(n)]
    for u, v in edges:
        graph[u].append(v)
        graph[v].append(u)
    
    def dfs(node, parent):
        size, time_sum = 1, 0
        for child in graph[node]:
            if child != parent:
                c_size, c_time = dfs(child, node)
                size += c_size
                time_sum += c_time + t[child] * c_size
        return size, time_sum
    
    total_time = sum(t)
    expected_times = [0] * n
    
    def calculate_expected(node, parent, parent_contrib):
        size, time_sum = dfs(node, parent)
        expected_times[node] = t[node] + (time_sum + parent_contrib) / (n - 1)
        for child in graph[node]:
            if child != parent:
                child_contrib = parent_contrib + (total_time - time_sum - t[child]) * (n - size)
                calculate_expected(child, node, child_contrib / (n - 1))
    
    calculate_expected(0, -1, 0)
    return min(range(n), key=lambda i: expected_times[i])

893 views17:14

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Company Name: Suvi
Role: Software Engineer

Batch eligible: 2024 grads only

Apply: https://job-boards.greenhouse.io/suki/jobs/6072793003

It’s mentioned that it’s for tier 1 colleges, but you can also give it a try!!

544 views08:42